/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:34:12,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:34:12,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:34:12,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:34:12,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:34:12,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:34:12,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:34:12,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:34:12,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:34:12,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:34:12,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:34:12,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:34:12,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:34:12,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:34:12,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:34:12,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:34:12,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:34:12,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:34:12,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:34:12,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:34:12,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:34:12,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:34:12,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:34:12,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:34:12,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:34:12,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:34:12,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:34:12,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:34:12,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:34:12,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:34:12,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:34:12,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:34:12,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:34:12,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:34:12,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:34:12,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:34:12,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:34:12,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:34:12,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:34:12,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:34:12,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:34:12,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 16:34:12,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:34:12,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:34:12,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:34:12,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:34:12,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:34:12,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:34:12,553 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:34:12,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:34:12,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:34:12,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:34:12,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:34:12,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:34:12,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:34:12,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:34:12,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:34:12,555 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:34:12,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:34:12,555 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:34:12,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:34:12,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:34:12,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:34:12,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:34:12,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:34:12,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:34:12,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:34:12,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:34:12,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:34:12,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:34:12,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:34:12,556 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:34:12,556 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:34:12,557 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 [2022-12-06 16:34:12,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:34:12,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:34:12,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:34:12,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:34:12,967 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:34:12,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:34:14,028 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:34:14,297 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:34:14,297 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:34:14,316 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e5a6154/6ba2bdcb75c44cff9e34339afc1df094/FLAG16b27c501 [2022-12-06 16:34:14,330 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e5a6154/6ba2bdcb75c44cff9e34339afc1df094 [2022-12-06 16:34:14,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:34:14,333 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:34:14,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:34:14,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:34:14,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:34:14,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a65ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14, skipping insertion in model container [2022-12-06 16:34:14,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:34:14,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:34:14,526 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/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-12-06 16:34:14,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:34:14,690 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:34:14,701 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/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-12-06 16:34:14,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:34:14,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:34:14,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:34:14,761 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:34:14,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14 WrapperNode [2022-12-06 16:34:14,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:34:14,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:34:14,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:34:14,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:34:14,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,804 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-12-06 16:34:14,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:34:14,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:34:14,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:34:14,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:34:14,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,823 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:34:14,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:34:14,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:34:14,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:34:14,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (1/1) ... [2022-12-06 16:34:14,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:34:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:34:14,872 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-06 16:34:14,891 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-06 16:34:14,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:34:14,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:34:14,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:34:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:34:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:34:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:34:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:34:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:34:14,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:34:14,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:34:14,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:34:14,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:34:14,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:34:14,922 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:34:15,014 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:34:15,015 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:34:15,291 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:34:15,428 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:34:15,428 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:34:15,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:34:15 BoogieIcfgContainer [2022-12-06 16:34:15,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:34:15,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:34:15,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:34:15,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:34:15,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:34:14" (1/3) ... [2022-12-06 16:34:15,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ab67af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:34:15, skipping insertion in model container [2022-12-06 16:34:15,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:14" (2/3) ... [2022-12-06 16:34:15,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ab67af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:34:15, skipping insertion in model container [2022-12-06 16:34:15,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:34:15" (3/3) ... [2022-12-06 16:34:15,436 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:34:15,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:34:15,448 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:34:15,449 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:34:15,495 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:34:15,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-06 16:34:15,592 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-06 16:34:15,592 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:34:15,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 16:34:15,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-06 16:34:15,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-06 16:34:15,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:34:15,618 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;@9df3e8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:34:15,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 16:34:15,632 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-06 16:34:15,632 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:34:15,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:34:15,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:34:15,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:34:15,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:34:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1121057190, now seen corresponding path program 1 times [2022-12-06 16:34:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:34:15,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427430041] [2022-12-06 16:34:15,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:34:15,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:34:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:34:16,066 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-06 16:34:16,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:34:16,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427430041] [2022-12-06 16:34:16,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427430041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:34:16,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:34:16,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:34:16,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643600396] [2022-12-06 16:34:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:34:16,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:34:16,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:34:16,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:34:16,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:34:16,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 89 [2022-12-06 16:34:16,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-06 16:34:16,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:34:16,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 89 [2022-12-06 16:34:16,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:34:16,203 INFO L130 PetriNetUnfolder]: 18/142 cut-off events. [2022-12-06 16:34:16,203 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 16:34:16,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 142 events. 18/142 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 364 event pairs, 2 based on Foata normal form. 10/143 useless extension candidates. Maximal degree in co-relation 149. Up to 31 conditions per place. [2022-12-06 16:34:16,205 INFO L137 encePairwiseOnDemand]: 84/89 looper letters, 10 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2022-12-06 16:34:16,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 207 flow [2022-12-06 16:34:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:34:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:34:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2022-12-06 16:34:16,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9288389513108615 [2022-12-06 16:34:16,218 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 0 predicate places. [2022-12-06 16:34:16,218 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 207 flow [2022-12-06 16:34:16,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-06 16:34:16,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:34:16,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:34:16,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:34:16,223 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:34:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:34:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 691597229, now seen corresponding path program 1 times [2022-12-06 16:34:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:34:16,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173439231] [2022-12-06 16:34:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:34:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:34:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:34:16,559 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-06 16:34:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:34:16,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173439231] [2022-12-06 16:34:16,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173439231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:34:16,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:34:16,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:34:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878000500] [2022-12-06 16:34:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:34:16,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:34:16,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:34:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:34:16,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:34:16,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 89 [2022-12-06 16:34:16,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 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-06 16:34:16,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:34:16,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 89 [2022-12-06 16:34:16,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:34:17,017 INFO L130 PetriNetUnfolder]: 443/1339 cut-off events. [2022-12-06 16:34:17,017 INFO L131 PetriNetUnfolder]: For 258/529 co-relation queries the response was YES. [2022-12-06 16:34:17,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 1339 events. 443/1339 cut-off events. For 258/529 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9539 event pairs, 84 based on Foata normal form. 0/1286 useless extension candidates. Maximal degree in co-relation 2456. Up to 329 conditions per place. [2022-12-06 16:34:17,028 INFO L137 encePairwiseOnDemand]: 78/89 looper letters, 28 selfloop transitions, 7 changer transitions 63/154 dead transitions. [2022-12-06 16:34:17,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 154 transitions, 595 flow [2022-12-06 16:34:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:34:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:34:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 667 transitions. [2022-12-06 16:34:17,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.83270911360799 [2022-12-06 16:34:17,034 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 8 predicate places. [2022-12-06 16:34:17,035 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 154 transitions, 595 flow [2022-12-06 16:34:17,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 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-06 16:34:17,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:34:17,035 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:34:17,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:34:17,035 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:34:17,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:34:17,036 INFO L85 PathProgramCache]: Analyzing trace with hash -24590258, now seen corresponding path program 1 times [2022-12-06 16:34:17,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:34:17,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914703491] [2022-12-06 16:34:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:34:17,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:34:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:34:17,263 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-06 16:34:17,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:34:17,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914703491] [2022-12-06 16:34:17,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914703491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:34:17,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:34:17,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:34:17,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041990001] [2022-12-06 16:34:17,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:34:17,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:34:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:34:17,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:34:17,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:34:17,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 89 [2022-12-06 16:34:17,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 154 transitions, 595 flow. Second operand has 7 states, 7 states have (on average 66.85714285714286) internal successors, (468), 7 states have internal predecessors, (468), 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-06 16:34:17,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:34:17,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 89 [2022-12-06 16:34:17,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:34:17,748 INFO L130 PetriNetUnfolder]: 535/1639 cut-off events. [2022-12-06 16:34:17,749 INFO L131 PetriNetUnfolder]: For 421/2065 co-relation queries the response was YES. [2022-12-06 16:34:17,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4053 conditions, 1639 events. 535/1639 cut-off events. For 421/2065 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12646 event pairs, 56 based on Foata normal form. 5/1604 useless extension candidates. Maximal degree in co-relation 3996. Up to 431 conditions per place. [2022-12-06 16:34:17,753 INFO L137 encePairwiseOnDemand]: 81/89 looper letters, 37 selfloop transitions, 5 changer transitions 149/247 dead transitions. [2022-12-06 16:34:17,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 247 transitions, 1437 flow [2022-12-06 16:34:17,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:34:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:34:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 934 transitions. [2022-12-06 16:34:17,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8072601555747623 [2022-12-06 16:34:17,782 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 20 predicate places. [2022-12-06 16:34:17,782 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 247 transitions, 1437 flow [2022-12-06 16:34:17,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.85714285714286) internal successors, (468), 7 states have internal predecessors, (468), 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-06 16:34:17,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:34:17,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:34:17,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:34:17,782 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:34:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:34:17,783 INFO L85 PathProgramCache]: Analyzing trace with hash 451412311, now seen corresponding path program 1 times [2022-12-06 16:34:17,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:34:17,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278453280] [2022-12-06 16:34:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:34:17,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:34:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:34:17,901 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-06 16:34:17,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:34:17,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278453280] [2022-12-06 16:34:17,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278453280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:34:17,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:34:17,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:34:17,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004726389] [2022-12-06 16:34:17,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:34:17,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:34:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:34:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:34:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:34:17,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 89 [2022-12-06 16:34:17,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 247 transitions, 1437 flow. Second operand has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 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-06 16:34:17,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:34:17,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 89 [2022-12-06 16:34:17,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:34:18,160 INFO L130 PetriNetUnfolder]: 481/1352 cut-off events. [2022-12-06 16:34:18,161 INFO L131 PetriNetUnfolder]: For 1796/2114 co-relation queries the response was YES. [2022-12-06 16:34:18,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3726 conditions, 1352 events. 481/1352 cut-off events. For 1796/2114 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8953 event pairs, 17 based on Foata normal form. 27/1332 useless extension candidates. Maximal degree in co-relation 3665. Up to 378 conditions per place. [2022-12-06 16:34:18,166 INFO L137 encePairwiseOnDemand]: 80/89 looper letters, 41 selfloop transitions, 6 changer transitions 130/250 dead transitions. [2022-12-06 16:34:18,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 250 transitions, 1652 flow [2022-12-06 16:34:18,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:34:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:34:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 751 transitions. [2022-12-06 16:34:18,168 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8438202247191011 [2022-12-06 16:34:18,170 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 29 predicate places. [2022-12-06 16:34:18,170 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 250 transitions, 1652 flow [2022-12-06 16:34:18,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 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-06 16:34:18,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:34:18,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:34:18,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:34:18,176 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:34:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:34:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 55144810, now seen corresponding path program 1 times [2022-12-06 16:34:18,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:34:18,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003338903] [2022-12-06 16:34:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:34:18,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:34:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:34:18,421 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-06 16:34:18,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:34:18,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003338903] [2022-12-06 16:34:18,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003338903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:34:18,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:34:18,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:34:18,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878156151] [2022-12-06 16:34:18,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:34:18,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:34:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:34:18,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:34:18,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:34:18,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 89 [2022-12-06 16:34:18,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 250 transitions, 1652 flow. Second operand has 7 states, 7 states have (on average 69.85714285714286) internal successors, (489), 7 states have internal predecessors, (489), 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-06 16:34:18,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:34:18,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 89 [2022-12-06 16:34:18,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:34:18,663 INFO L130 PetriNetUnfolder]: 375/922 cut-off events. [2022-12-06 16:34:18,663 INFO L131 PetriNetUnfolder]: For 1829/2413 co-relation queries the response was YES. [2022-12-06 16:34:18,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3274 conditions, 922 events. 375/922 cut-off events. For 1829/2413 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5580 event pairs, 19 based on Foata normal form. 58/951 useless extension candidates. Maximal degree in co-relation 3209. Up to 292 conditions per place. [2022-12-06 16:34:18,666 INFO L137 encePairwiseOnDemand]: 80/89 looper letters, 37 selfloop transitions, 15 changer transitions 105/218 dead transitions. [2022-12-06 16:34:18,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 218 transitions, 1674 flow [2022-12-06 16:34:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:34:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:34:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 948 transitions. [2022-12-06 16:34:18,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8193604148660328 [2022-12-06 16:34:18,669 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 32 predicate places. [2022-12-06 16:34:18,669 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 218 transitions, 1674 flow [2022-12-06 16:34:18,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.85714285714286) internal successors, (489), 7 states have internal predecessors, (489), 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-06 16:34:18,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:34:18,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:34:18,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:34:18,670 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:34:18,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:34:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2027895091, now seen corresponding path program 1 times [2022-12-06 16:34:18,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:34:18,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58696925] [2022-12-06 16:34:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:34:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:34:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:34:19,099 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-06 16:34:19,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:34:19,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58696925] [2022-12-06 16:34:19,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58696925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:34:19,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:34:19,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 16:34:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896849065] [2022-12-06 16:34:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:34:19,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 16:34:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:34:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 16:34:19,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 16:34:19,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2022-12-06 16:34:19,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 218 transitions, 1674 flow. Second operand has 9 states, 9 states have (on average 66.22222222222223) internal successors, (596), 9 states have internal predecessors, (596), 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-06 16:34:19,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:34:19,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2022-12-06 16:34:19,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:34:19,313 INFO L130 PetriNetUnfolder]: 430/1090 cut-off events. [2022-12-06 16:34:19,314 INFO L131 PetriNetUnfolder]: For 3836/4380 co-relation queries the response was YES. [2022-12-06 16:34:19,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4118 conditions, 1090 events. 430/1090 cut-off events. For 3836/4380 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7029 event pairs, 18 based on Foata normal form. 30/1091 useless extension candidates. Maximal degree in co-relation 4043. Up to 316 conditions per place. [2022-12-06 16:34:19,317 INFO L137 encePairwiseOnDemand]: 80/89 looper letters, 20 selfloop transitions, 9 changer transitions 154/247 dead transitions. [2022-12-06 16:34:19,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 247 transitions, 2279 flow [2022-12-06 16:34:19,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:34:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:34:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 675 transitions. [2022-12-06 16:34:19,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7584269662921348 [2022-12-06 16:34:19,319 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 41 predicate places. [2022-12-06 16:34:19,319 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 247 transitions, 2279 flow [2022-12-06 16:34:19,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 66.22222222222223) internal successors, (596), 9 states have internal predecessors, (596), 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-06 16:34:19,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:34:19,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:34:19,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:34:19,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:34:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:34:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash -742194407, now seen corresponding path program 2 times [2022-12-06 16:34:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:34:19,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552440144] [2022-12-06 16:34:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:34:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:34:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:34:19,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:34:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:34:19,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:34:19,408 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:34:19,409 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 16:34:19,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 16:34:19,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 16:34:19,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 16:34:19,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 16:34:19,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:34:19,411 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-12-06 16:34:19,414 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:34:19,414 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:34:19,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:34:19 BasicIcfg [2022-12-06 16:34:19,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:34:19,463 INFO L158 Benchmark]: Toolchain (without parser) took 5130.41ms. Allocated memory was 219.2MB in the beginning and 407.9MB in the end (delta: 188.7MB). Free memory was 192.8MB in the beginning and 361.4MB in the end (delta: -168.7MB). Peak memory consumption was 245.2MB. Max. memory is 8.0GB. [2022-12-06 16:34:19,464 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 219.2MB. Free memory is still 194.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:34:19,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.80ms. Allocated memory is still 219.2MB. Free memory was 192.8MB in the beginning and 167.8MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 16:34:19,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.48ms. Allocated memory is still 219.2MB. Free memory was 167.8MB in the beginning and 165.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:34:19,464 INFO L158 Benchmark]: Boogie Preprocessor took 21.50ms. Allocated memory is still 219.2MB. Free memory was 165.2MB in the beginning and 163.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:34:19,465 INFO L158 Benchmark]: RCFGBuilder took 585.21ms. Allocated memory is still 219.2MB. Free memory was 163.6MB in the beginning and 131.6MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 16:34:19,465 INFO L158 Benchmark]: TraceAbstraction took 4031.38ms. Allocated memory was 219.2MB in the beginning and 407.9MB in the end (delta: 188.7MB). Free memory was 131.1MB in the beginning and 361.4MB in the end (delta: -230.3MB). Peak memory consumption was 183.3MB. Max. memory is 8.0GB. [2022-12-06 16:34:19,466 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.21ms. Allocated memory is still 219.2MB. Free memory is still 194.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 427.80ms. Allocated memory is still 219.2MB. Free memory was 192.8MB in the beginning and 167.8MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.48ms. Allocated memory is still 219.2MB. Free memory was 167.8MB in the beginning and 165.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.50ms. Allocated memory is still 219.2MB. Free memory was 165.2MB in the beginning and 163.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 585.21ms. Allocated memory is still 219.2MB. Free memory was 163.6MB in the beginning and 131.6MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4031.38ms. Allocated memory was 219.2MB in the beginning and 407.9MB in the end (delta: 188.7MB). Free memory was 131.1MB in the beginning and 361.4MB in the end (delta: -230.3MB). Peak memory consumption was 183.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L728] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L732] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] 0 pthread_t t1705; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705={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] [L811] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1705, ((void *)0), P0, ((void *)0))=-1, t1705={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] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 0 pthread_t t1706; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705={5:0}, t1706={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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] FCALL, FORK 0 pthread_create(&t1706, ((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(&t1706, ((void *)0), P1, ((void *)0))=0, t1705={5:0}, t1706={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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 1 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] 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) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 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 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 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) [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 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 [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 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) [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 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 [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, 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: 813]: 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: 811]: 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, 108 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: 3.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 266 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 624 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 57 mSDtfsCounter, 624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2279occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 1400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-06 16:34:19,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...