/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/mix022_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:23:50,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:23:50,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:23:50,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:23:50,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:23:50,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:23:50,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:23:50,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:23:50,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:23:50,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:23:50,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:23:50,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:23:50,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:23:50,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:23:50,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:23:50,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:23:50,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:23:50,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:23:50,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:23:50,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:23:50,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:23:50,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:23:50,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:23:50,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:23:50,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:23:50,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:23:50,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:23:50,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:23:50,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:23:50,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:23:50,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:23:50,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:23:50,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:23:50,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:23:50,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:23:50,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:23:50,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:23:50,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:23:50,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:23:50,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:23:50,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:23:50,895 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:23:50,927 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:23:50,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:23:50,929 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:23:50,929 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:23:50,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:23:50,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:23:50,930 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:23:50,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:23:50,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:23:50,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:23:50,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:23:50,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:23:50,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:23:50,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:23:50,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:23:50,932 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:23:50,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:23:50,932 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:23:50,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:23:50,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:23:50,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:23:50,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:23:50,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:23:50,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:23:50,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:23:50,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:23:50,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:23:50,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:23:50,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:23:50,933 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:23:50,933 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:23:50,933 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:23:51,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:23:51,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:23:51,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:23:51,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:23:51,243 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:23:51,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:23:52,284 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:23:52,512 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:23:52,512 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:23:52,532 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c06590d5f/294d236eb021468891193e1280fafd5d/FLAG19ea5d8e7 [2022-12-06 16:23:52,545 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c06590d5f/294d236eb021468891193e1280fafd5d [2022-12-06 16:23:52,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:23:52,548 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:23:52,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:23:52,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:23:52,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:23:52,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:23:52" (1/1) ... [2022-12-06 16:23:52,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6201e21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:52, skipping insertion in model container [2022-12-06 16:23:52,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:23:52" (1/1) ... [2022-12-06 16:23:52,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:23:52,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:23:52,744 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-12-06 16:23:52,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:23:52,933 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:23:52,943 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-12-06 16:23:52,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:23:52,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:23:52,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:23:53,020 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:23:53,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53 WrapperNode [2022-12-06 16:23:53,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:23:53,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:23:53,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:23:53,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:23:53,027 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:23:53" (1/1) ... [2022-12-06 16:23:53,053 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:23:53" (1/1) ... [2022-12-06 16:23:53,078 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-12-06 16:23:53,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:23:53,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:23:53,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:23:53,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:23:53,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53" (1/1) ... [2022-12-06 16:23:53,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53" (1/1) ... [2022-12-06 16:23:53,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53" (1/1) ... [2022-12-06 16:23:53,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53" (1/1) ... [2022-12-06 16:23:53,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53" (1/1) ... [2022-12-06 16:23:53,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53" (1/1) ... [2022-12-06 16:23:53,095 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53" (1/1) ... [2022-12-06 16:23:53,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53" (1/1) ... [2022-12-06 16:23:53,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:23:53,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:23:53,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:23:53,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:23:53,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53" (1/1) ... [2022-12-06 16:23:53,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:23:53,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:23:53,132 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:23:53,141 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:23:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:23:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:23:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:23:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:23:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:23:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:23:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:23:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:23:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:23:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:23:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:23:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:23:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:23:53,162 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:23:53,241 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:23:53,242 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:23:53,447 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:23:53,548 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:23:53,548 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:23:53,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:23:53 BoogieIcfgContainer [2022-12-06 16:23:53,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:23:53,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:23:53,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:23:53,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:23:53,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:23:52" (1/3) ... [2022-12-06 16:23:53,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22086f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:23:53, skipping insertion in model container [2022-12-06 16:23:53,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:53" (2/3) ... [2022-12-06 16:23:53,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22086f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:23:53, skipping insertion in model container [2022-12-06 16:23:53,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:23:53" (3/3) ... [2022-12-06 16:23:53,555 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:23:53,568 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:23:53,568 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:23:53,568 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:23:53,616 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:23:53,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-06 16:23:53,697 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-06 16:23:53,698 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:23:53,702 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:23:53,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-06 16:23:53,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-06 16:23:53,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:23:53,721 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;@4fefbf07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:23:53,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 16:23:53,734 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-06 16:23:53,734 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:23:53,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:23:53,735 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:23:53,737 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:23:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:23:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash 769390310, now seen corresponding path program 1 times [2022-12-06 16:23:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:23:53,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288203269] [2022-12-06 16:23:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:23:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:23:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:23:54,154 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:23:54,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:23:54,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288203269] [2022-12-06 16:23:54,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288203269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:23:54,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:23:54,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:23:54,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912531405] [2022-12-06 16:23:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:23:54,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:23:54,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:23:54,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:23:54,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:23:54,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 89 [2022-12-06 16:23:54,205 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:23:54,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:23:54,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 89 [2022-12-06 16:23:54,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:23:54,286 INFO L130 PetriNetUnfolder]: 18/142 cut-off events. [2022-12-06 16:23:54,286 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 16:23:54,287 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 362 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:23:54,290 INFO L137 encePairwiseOnDemand]: 84/89 looper letters, 10 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2022-12-06 16:23:54,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 207 flow [2022-12-06 16:23:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:23:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:23:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2022-12-06 16:23:54,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9288389513108615 [2022-12-06 16:23:54,311 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 0 predicate places. [2022-12-06 16:23:54,312 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 207 flow [2022-12-06 16:23:54,312 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:23:54,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:23:54,312 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:23:54,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:23:54,313 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:23:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:23:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1440059305, now seen corresponding path program 1 times [2022-12-06 16:23:54,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:23:54,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695783207] [2022-12-06 16:23:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:23:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:23:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:23:54,557 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:23:54,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:23:54,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695783207] [2022-12-06 16:23:54,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695783207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:23:54,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:23:54,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:23:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706337104] [2022-12-06 16:23:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:23:54,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:23:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:23:54,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:23:54,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:23:54,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 89 [2022-12-06 16:23:54,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 207 flow. Second operand has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:23:54,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:23:54,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 89 [2022-12-06 16:23:54,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:23:55,026 INFO L130 PetriNetUnfolder]: 370/1089 cut-off events. [2022-12-06 16:23:55,026 INFO L131 PetriNetUnfolder]: For 214/463 co-relation queries the response was YES. [2022-12-06 16:23:55,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 1089 events. 370/1089 cut-off events. For 214/463 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7106 event pairs, 60 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 2056. Up to 302 conditions per place. [2022-12-06 16:23:55,035 INFO L137 encePairwiseOnDemand]: 81/89 looper letters, 32 selfloop transitions, 4 changer transitions 68/160 dead transitions. [2022-12-06 16:23:55,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 160 transitions, 629 flow [2022-12-06 16:23:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:23:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:23:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 934 transitions. [2022-12-06 16:23:55,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8072601555747623 [2022-12-06 16:23:55,042 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 12 predicate places. [2022-12-06 16:23:55,042 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 160 transitions, 629 flow [2022-12-06 16:23:55,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:23:55,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:23:55,042 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:23:55,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:23:55,043 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:23:55,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:23:55,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1716816525, now seen corresponding path program 1 times [2022-12-06 16:23:55,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:23:55,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319699095] [2022-12-06 16:23:55,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:23:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:23:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:23:55,233 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:23:55,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:23:55,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319699095] [2022-12-06 16:23:55,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319699095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:23:55,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:23:55,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:23:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613780557] [2022-12-06 16:23:55,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:23:55,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:23:55,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:23:55,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:23:55,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:23:55,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 89 [2022-12-06 16:23:55,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 160 transitions, 629 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:23:55,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:23:55,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 89 [2022-12-06 16:23:55,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:23:55,496 INFO L130 PetriNetUnfolder]: 455/1226 cut-off events. [2022-12-06 16:23:55,496 INFO L131 PetriNetUnfolder]: For 974/1067 co-relation queries the response was YES. [2022-12-06 16:23:55,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 1226 events. 455/1226 cut-off events. For 974/1067 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7749 event pairs, 25 based on Foata normal form. 23/1198 useless extension candidates. Maximal degree in co-relation 2852. Up to 361 conditions per place. [2022-12-06 16:23:55,501 INFO L137 encePairwiseOnDemand]: 80/89 looper letters, 38 selfloop transitions, 6 changer transitions 101/216 dead transitions. [2022-12-06 16:23:55,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 216 transitions, 1136 flow [2022-12-06 16:23:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:23:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:23:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 751 transitions. [2022-12-06 16:23:55,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8438202247191011 [2022-12-06 16:23:55,504 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 21 predicate places. [2022-12-06 16:23:55,504 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 216 transitions, 1136 flow [2022-12-06 16:23:55,504 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:23:55,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:23:55,504 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:23:55,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:23:55,505 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:23:55,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:23:55,506 INFO L85 PathProgramCache]: Analyzing trace with hash -407117790, now seen corresponding path program 1 times [2022-12-06 16:23:55,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:23:55,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314896579] [2022-12-06 16:23:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:23:55,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:23:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:23:55,752 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:23:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:23:55,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314896579] [2022-12-06 16:23:55,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314896579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:23:55,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:23:55,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:23:55,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529338802] [2022-12-06 16:23:55,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:23:55,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:23:55,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:23:55,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:23:55,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:23:55,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 89 [2022-12-06 16:23:55,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 216 transitions, 1136 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:23:55,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:23:55,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 89 [2022-12-06 16:23:55,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:23:55,970 INFO L130 PetriNetUnfolder]: 354/890 cut-off events. [2022-12-06 16:23:55,971 INFO L131 PetriNetUnfolder]: For 945/1147 co-relation queries the response was YES. [2022-12-06 16:23:55,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 890 events. 354/890 cut-off events. For 945/1147 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5392 event pairs, 25 based on Foata normal form. 71/933 useless extension candidates. Maximal degree in co-relation 2730. Up to 270 conditions per place. [2022-12-06 16:23:55,973 INFO L137 encePairwiseOnDemand]: 80/89 looper letters, 25 selfloop transitions, 9 changer transitions 117/210 dead transitions. [2022-12-06 16:23:55,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 210 transitions, 1376 flow [2022-12-06 16:23:55,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:23:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:23:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 948 transitions. [2022-12-06 16:23:55,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8193604148660328 [2022-12-06 16:23:55,976 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 27 predicate places. [2022-12-06 16:23:55,976 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 210 transitions, 1376 flow [2022-12-06 16:23:55,977 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:23:55,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:23:55,977 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:23:55,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:23:55,977 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:23:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:23:55,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1844641251, now seen corresponding path program 1 times [2022-12-06 16:23:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:23:55,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428146092] [2022-12-06 16:23:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:23:55,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:23:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:23:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:23:56,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:23:56,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428146092] [2022-12-06 16:23:56,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428146092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:23:56,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:23:56,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:23:56,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353013735] [2022-12-06 16:23:56,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:23:56,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:23:56,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:23:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:23:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:23:56,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 89 [2022-12-06 16:23:56,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 210 transitions, 1376 flow. Second operand has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 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:23:56,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:23:56,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 89 [2022-12-06 16:23:56,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:23:56,354 INFO L130 PetriNetUnfolder]: 476/1203 cut-off events. [2022-12-06 16:23:56,355 INFO L131 PetriNetUnfolder]: For 2066/2503 co-relation queries the response was YES. [2022-12-06 16:23:56,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4183 conditions, 1203 events. 476/1203 cut-off events. For 2066/2503 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8092 event pairs, 23 based on Foata normal form. 106/1287 useless extension candidates. Maximal degree in co-relation 4118. Up to 360 conditions per place. [2022-12-06 16:23:56,358 INFO L137 encePairwiseOnDemand]: 80/89 looper letters, 22 selfloop transitions, 5 changer transitions 172/256 dead transitions. [2022-12-06 16:23:56,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 256 transitions, 2097 flow [2022-12-06 16:23:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 16:23:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 16:23:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 490 transitions. [2022-12-06 16:23:56,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7865168539325843 [2022-12-06 16:23:56,360 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 33 predicate places. [2022-12-06 16:23:56,360 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 256 transitions, 2097 flow [2022-12-06 16:23:56,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 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:23:56,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:23:56,361 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:23:56,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:23:56,361 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:23:56,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:23:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash -523994683, now seen corresponding path program 2 times [2022-12-06 16:23:56,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:23:56,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569993593] [2022-12-06 16:23:56,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:23:56,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:23:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:23:56,741 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:23:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:23:56,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569993593] [2022-12-06 16:23:56,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569993593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:23:56,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:23:56,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 16:23:56,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166990095] [2022-12-06 16:23:56,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:23:56,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 16:23:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:23:56,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 16:23:56,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 16:23:56,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2022-12-06 16:23:56,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 256 transitions, 2097 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:23:56,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:23:56,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2022-12-06 16:23:56,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:23:56,974 INFO L130 PetriNetUnfolder]: 584/1539 cut-off events. [2022-12-06 16:23:56,974 INFO L131 PetriNetUnfolder]: For 4825/5527 co-relation queries the response was YES. [2022-12-06 16:23:56,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5607 conditions, 1539 events. 584/1539 cut-off events. For 4825/5527 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11290 event pairs, 31 based on Foata normal form. 74/1584 useless extension candidates. Maximal degree in co-relation 5532. Up to 410 conditions per place. [2022-12-06 16:23:56,979 INFO L137 encePairwiseOnDemand]: 80/89 looper letters, 20 selfloop transitions, 5 changer transitions 226/307 dead transitions. [2022-12-06 16:23:56,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 307 transitions, 3054 flow [2022-12-06 16:23:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:23:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:23:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 675 transitions. [2022-12-06 16:23:56,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7584269662921348 [2022-12-06 16:23:56,981 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 42 predicate places. [2022-12-06 16:23:56,981 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 307 transitions, 3054 flow [2022-12-06 16:23:56,982 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:23:56,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:23:56,982 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:23:56,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:23:56,982 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:23:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:23:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1904204301, now seen corresponding path program 3 times [2022-12-06 16:23:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:23:56,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672155387] [2022-12-06 16:23:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:23:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:23:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:23:57,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:23:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:23:57,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:23:57,057 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:23:57,058 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 16:23:57,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 16:23:57,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 16:23:57,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 16:23:57,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 16:23:57,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:23:57,060 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-12-06 16:23:57,063 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:23:57,063 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:23:57,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:23:57 BasicIcfg [2022-12-06 16:23:57,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:23:57,122 INFO L158 Benchmark]: Toolchain (without parser) took 4573.81ms. Allocated memory was 217.1MB in the beginning and 442.5MB in the end (delta: 225.4MB). Free memory was 191.7MB in the beginning and 372.9MB in the end (delta: -181.1MB). Peak memory consumption was 45.6MB. Max. memory is 8.0GB. [2022-12-06 16:23:57,122 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 217.1MB. Free memory is still 193.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:23:57,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.17ms. Allocated memory is still 217.1MB. Free memory was 191.4MB in the beginning and 166.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 16:23:57,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.82ms. Allocated memory is still 217.1MB. Free memory was 166.3MB in the beginning and 164.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:23:57,123 INFO L158 Benchmark]: Boogie Preprocessor took 19.19ms. Allocated memory is still 217.1MB. Free memory was 164.2MB in the beginning and 162.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:23:57,123 INFO L158 Benchmark]: RCFGBuilder took 451.02ms. Allocated memory is still 217.1MB. Free memory was 162.1MB in the beginning and 130.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 16:23:57,123 INFO L158 Benchmark]: TraceAbstraction took 3570.26ms. Allocated memory was 217.1MB in the beginning and 442.5MB in the end (delta: 225.4MB). Free memory was 130.1MB in the beginning and 372.9MB in the end (delta: -242.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:23:57,124 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.11ms. Allocated memory is still 217.1MB. Free memory is still 193.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.17ms. Allocated memory is still 217.1MB. Free memory was 191.4MB in the beginning and 166.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.82ms. Allocated memory is still 217.1MB. Free memory was 166.3MB in the beginning and 164.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.19ms. Allocated memory is still 217.1MB. Free memory was 164.2MB in the beginning and 162.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 451.02ms. Allocated memory is still 217.1MB. Free memory was 162.1MB in the beginning and 130.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3570.26ms. Allocated memory was 217.1MB in the beginning and 442.5MB in the end (delta: 225.4MB). Free memory was 130.1MB in the beginning and 372.9MB in the end (delta: -242.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [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] [L718] 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, y=0] [L719] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L720] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L721] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L722] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L723] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L724] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L728] 0 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L729] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L730] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L731] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L732] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 pthread_t t585; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t585, ((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(&t585, ((void *)0), P0, ((void *)0))=-1, t585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 pthread_t t586; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585={5:0}, t586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] FCALL, FORK 0 pthread_create(&t586, ((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(&t586, ((void *)0), P1, ((void *)0))=0, t585={5:0}, t586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 x = 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 x = 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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 __unbuffered_p1_EAX = x 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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$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=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$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=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, t585={5:0}, t586={3:0}, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$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, t585={5:0}, t586={3:0}, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 main$tmp_guard1 = !(x == 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, t585={5:0}, t586={3:0}, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 53 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3054occurred in iteration=6, InterpolantAutomatonStates: 56, 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.3s InterpolantComputationTime, 435 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 1519 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:23:57,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...