/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:13:37,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:13:37,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:13:37,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:13:37,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:13:37,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:13:37,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:13:37,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:13:37,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:13:37,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:13:37,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:13:37,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:13:37,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:13:37,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:13:37,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:13:37,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:13:37,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:13:37,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:13:37,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:13:37,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:13:37,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:13:37,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:13:37,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:13:37,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:13:37,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:13:37,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:13:37,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:13:37,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:13:37,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:13:37,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:13:37,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:13:37,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:13:37,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:13:37,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:13:37,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:13:37,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:13:37,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:13:37,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:13:37,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:13:37,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:13:37,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:13:37,765 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-RepeatedSemanticLbe.epf [2022-12-13 03:13:37,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:13:37,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:13:37,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:13:37,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:13:37,793 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:13:37,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:13:37,794 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:13:37,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:13:37,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:13:37,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:13:37,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:13:37,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:13:37,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:13:37,795 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:13:37,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:13:37,795 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:13:37,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:13:37,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:13:37,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:13:37,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:13:37,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:13:37,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:13:37,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:13:37,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:13:37,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:13:37,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:13:37,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:13:37,801 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:13:37,801 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-13 03:13:38,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:13:38,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:13:38,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:13:38,099 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:13:38,099 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:13:38,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 03:13:39,192 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:13:39,415 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:13:39,415 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 03:13:39,426 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea249c28/71cf861e52cf4bc3aeee9a593164231f/FLAG7b67299e5 [2022-12-13 03:13:39,438 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea249c28/71cf861e52cf4bc3aeee9a593164231f [2022-12-13 03:13:39,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:13:39,442 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:13:39,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:13:39,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:13:39,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:13:39,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:39,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3909f01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39, skipping insertion in model container [2022-12-13 03:13:39,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:39,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:13:39,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:13:39,652 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/safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i[1017,1030] [2022-12-13 03:13:39,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:13:39,844 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:13:39,854 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/safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i[1017,1030] [2022-12-13 03:13:39,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:13:39,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:13:39,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:13:39,932 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:13:39,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39 WrapperNode [2022-12-13 03:13:39,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:13:39,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:13:39,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:13:39,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:13:39,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:39,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:39,993 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2022-12-13 03:13:39,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:13:39,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:13:39,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:13:39,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:13:40,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:40,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:40,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:40,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:40,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:40,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:40,019 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:40,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:40,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:13:40,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:13:40,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:13:40,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:13:40,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (1/1) ... [2022-12-13 03:13:40,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:13:40,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:13:40,050 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-13 03:13:40,079 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-13 03:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:13:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:13:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:13:40,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:13:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:13:40,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:13:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:13:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:13:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:13:40,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:13:40,114 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:13:40,271 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:13:40,272 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:13:40,438 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:13:40,443 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:13:40,444 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:13:40,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:13:40 BoogieIcfgContainer [2022-12-13 03:13:40,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:13:40,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:13:40,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:13:40,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:13:40,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:13:39" (1/3) ... [2022-12-13 03:13:40,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b6d8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:13:40, skipping insertion in model container [2022-12-13 03:13:40,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:13:39" (2/3) ... [2022-12-13 03:13:40,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b6d8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:13:40, skipping insertion in model container [2022-12-13 03:13:40,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:13:40" (3/3) ... [2022-12-13 03:13:40,452 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 03:13:40,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:13:40,466 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:13:40,466 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:13:40,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:13:40,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 68 transitions, 146 flow [2022-12-13 03:13:40,597 INFO L130 PetriNetUnfolder]: 2/66 cut-off events. [2022-12-13 03:13:40,598 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:13:40,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 66 events. 2/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-13 03:13:40,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 68 transitions, 146 flow [2022-12-13 03:13:40,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 56 transitions, 118 flow [2022-12-13 03:13:40,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:13:40,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 56 transitions, 118 flow [2022-12-13 03:13:40,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 56 transitions, 118 flow [2022-12-13 03:13:40,642 INFO L130 PetriNetUnfolder]: 1/56 cut-off events. [2022-12-13 03:13:40,642 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:13:40,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 56 events. 1/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2022-12-13 03:13:40,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 56 transitions, 118 flow [2022-12-13 03:13:40,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-13 03:13:42,122 INFO L241 LiptonReduction]: Total number of compositions: 44 [2022-12-13 03:13:42,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:13:42,143 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=REPEATED_LIPTON_PN, 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;@721122f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:13:42,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 03:13:42,146 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 03:13:42,146 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:13:42,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:13:42,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 03:13:42,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 03:13:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:13:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1567709208, now seen corresponding path program 1 times [2022-12-13 03:13:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:13:42,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299165082] [2022-12-13 03:13:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:13:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:13:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:13:42,473 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-13 03:13:42,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:13:42,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299165082] [2022-12-13 03:13:42,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299165082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:13:42,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:13:42,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:13:42,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887996437] [2022-12-13 03:13:42,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:13:42,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:13:42,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:13:42,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:13:42,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:13:42,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 19 [2022-12-13 03:13:42,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-13 03:13:42,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:13:42,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 19 [2022-12-13 03:13:42,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:13:42,607 INFO L130 PetriNetUnfolder]: 61/143 cut-off events. [2022-12-13 03:13:42,607 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:13:42,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 143 events. 61/143 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 609 event pairs, 31 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 264. Up to 113 conditions per place. [2022-12-13 03:13:42,609 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 14 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2022-12-13 03:13:42,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 23 transitions, 89 flow [2022-12-13 03:13:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:13:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:13:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-13 03:13:42,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 03:13:42,620 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2022-12-13 03:13:42,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 23 transitions, 89 flow [2022-12-13 03:13:42,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 23 transitions, 89 flow [2022-12-13 03:13:42,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:13:42,623 INFO L89 Accepts]: Start accepts. Operand has 27 places, 23 transitions, 89 flow [2022-12-13 03:13:42,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:13:42,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:13:42,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 23 transitions, 89 flow [2022-12-13 03:13:42,628 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 23 transitions, 89 flow [2022-12-13 03:13:42,628 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 03:13:42,766 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:13:42,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 03:13:42,769 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 89 flow [2022-12-13 03:13:42,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-13 03:13:42,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:13:42,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:13:42,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:13:42,772 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 03:13:42,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:13:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1354345921, now seen corresponding path program 1 times [2022-12-13 03:13:42,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:13:42,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863543843] [2022-12-13 03:13:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:13:42,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:13:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:13:42,857 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-13 03:13:42,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:13:42,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863543843] [2022-12-13 03:13:42,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863543843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:13:42,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:13:42,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:13:42,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504227697] [2022-12-13 03:13:42,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:13:42,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:13:42,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:13:42,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:13:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:13:42,859 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 19 [2022-12-13 03:13:42,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:13:42,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:13:42,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 19 [2022-12-13 03:13:42,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:13:42,890 INFO L130 PetriNetUnfolder]: 53/132 cut-off events. [2022-12-13 03:13:42,891 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 03:13:42,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 132 events. 53/132 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 570 event pairs, 8 based on Foata normal form. 6/113 useless extension candidates. Maximal degree in co-relation 346. Up to 102 conditions per place. [2022-12-13 03:13:42,892 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 16 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2022-12-13 03:13:42,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 135 flow [2022-12-13 03:13:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:13:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:13:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-13 03:13:42,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-13 03:13:42,894 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2022-12-13 03:13:42,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 25 transitions, 135 flow [2022-12-13 03:13:42,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 24 transitions, 133 flow [2022-12-13 03:13:42,895 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:13:42,895 INFO L89 Accepts]: Start accepts. Operand has 28 places, 24 transitions, 133 flow [2022-12-13 03:13:42,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:13:42,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:13:42,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 24 transitions, 133 flow [2022-12-13 03:13:42,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 24 transitions, 133 flow [2022-12-13 03:13:42,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 03:13:42,898 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:13:42,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 03:13:42,899 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 133 flow [2022-12-13 03:13:42,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:13:42,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:13:42,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:13:42,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:13:42,900 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 03:13:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:13:42,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1354345053, now seen corresponding path program 1 times [2022-12-13 03:13:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:13:42,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964600488] [2022-12-13 03:13:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:13:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:13:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:13:42,972 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-13 03:13:42,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:13:42,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964600488] [2022-12-13 03:13:42,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964600488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:13:42,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:13:42,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:13:42,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894206739] [2022-12-13 03:13:42,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:13:42,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:13:42,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:13:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:13:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:13:42,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2022-12-13 03:13:42,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-13 03:13:42,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:13:42,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2022-12-13 03:13:42,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:13:43,026 INFO L130 PetriNetUnfolder]: 71/189 cut-off events. [2022-12-13 03:13:43,027 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-13 03:13:43,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 189 events. 71/189 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 998 event pairs, 6 based on Foata normal form. 30/178 useless extension candidates. Maximal degree in co-relation 627. Up to 135 conditions per place. [2022-12-13 03:13:43,028 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 24 selfloop transitions, 4 changer transitions 7/38 dead transitions. [2022-12-13 03:13:43,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 284 flow [2022-12-13 03:13:43,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:13:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:13:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-13 03:13:43,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 03:13:43,030 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2022-12-13 03:13:43,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 38 transitions, 284 flow [2022-12-13 03:13:43,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 31 transitions, 238 flow [2022-12-13 03:13:43,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:13:43,032 INFO L89 Accepts]: Start accepts. Operand has 30 places, 31 transitions, 238 flow [2022-12-13 03:13:43,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:13:43,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:13:43,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 31 transitions, 238 flow [2022-12-13 03:13:43,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 31 transitions, 238 flow [2022-12-13 03:13:43,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 03:13:43,035 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:13:43,036 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 03:13:43,036 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 238 flow [2022-12-13 03:13:43,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-13 03:13:43,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:13:43,036 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:13:43,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:13:43,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 03:13:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:13:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 964975588, now seen corresponding path program 1 times [2022-12-13 03:13:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:13:43,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408892040] [2022-12-13 03:13:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:13:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:13:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:13:43,098 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-13 03:13:43,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:13:43,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408892040] [2022-12-13 03:13:43,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408892040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:13:43,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:13:43,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:13:43,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105435705] [2022-12-13 03:13:43,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:13:43,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:13:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:13:43,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:13:43,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:13:43,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2022-12-13 03:13:43,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-13 03:13:43,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:13:43,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2022-12-13 03:13:43,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:13:43,146 INFO L130 PetriNetUnfolder]: 87/218 cut-off events. [2022-12-13 03:13:43,147 INFO L131 PetriNetUnfolder]: For 280/280 co-relation queries the response was YES. [2022-12-13 03:13:43,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 218 events. 87/218 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1092 event pairs, 0 based on Foata normal form. 32/204 useless extension candidates. Maximal degree in co-relation 874. Up to 151 conditions per place. [2022-12-13 03:13:43,148 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 28 selfloop transitions, 4 changer transitions 10/45 dead transitions. [2022-12-13 03:13:43,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 45 transitions, 428 flow [2022-12-13 03:13:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:13:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:13:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-13 03:13:43,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2022-12-13 03:13:43,150 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2022-12-13 03:13:43,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 45 transitions, 428 flow [2022-12-13 03:13:43,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 35 transitions, 334 flow [2022-12-13 03:13:43,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:13:43,153 INFO L89 Accepts]: Start accepts. Operand has 33 places, 35 transitions, 334 flow [2022-12-13 03:13:43,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:13:43,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:13:43,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 35 transitions, 334 flow [2022-12-13 03:13:43,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 35 transitions, 334 flow [2022-12-13 03:13:43,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 03:13:43,174 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:13:43,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 03:13:43,175 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 35 transitions, 334 flow [2022-12-13 03:13:43,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-13 03:13:43,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:13:43,175 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:13:43,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:13:43,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 03:13:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:13:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash -151385878, now seen corresponding path program 1 times [2022-12-13 03:13:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:13:43,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553371138] [2022-12-13 03:13:43,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:13:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:13:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:13:43,259 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-13 03:13:43,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:13:43,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553371138] [2022-12-13 03:13:43,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553371138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:13:43,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:13:43,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:13:43,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638781369] [2022-12-13 03:13:43,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:13:43,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:13:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:13:43,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:13:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:13:43,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2022-12-13 03:13:43,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 35 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-13 03:13:43,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:13:43,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2022-12-13 03:13:43,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:13:43,305 INFO L130 PetriNetUnfolder]: 69/177 cut-off events. [2022-12-13 03:13:43,305 INFO L131 PetriNetUnfolder]: For 282/282 co-relation queries the response was YES. [2022-12-13 03:13:43,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 177 events. 69/177 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 825 event pairs, 0 based on Foata normal form. 24/160 useless extension candidates. Maximal degree in co-relation 885. Up to 133 conditions per place. [2022-12-13 03:13:43,307 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 16 selfloop transitions, 3 changer transitions 15/37 dead transitions. [2022-12-13 03:13:43,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 422 flow [2022-12-13 03:13:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:13:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:13:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 03:13:43,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-13 03:13:43,308 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2022-12-13 03:13:43,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 37 transitions, 422 flow [2022-12-13 03:13:43,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 22 transitions, 242 flow [2022-12-13 03:13:43,311 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:13:43,311 INFO L89 Accepts]: Start accepts. Operand has 34 places, 22 transitions, 242 flow [2022-12-13 03:13:43,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:13:43,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:13:43,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 22 transitions, 242 flow [2022-12-13 03:13:43,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 242 flow [2022-12-13 03:13:43,312 INFO L226 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-13 03:13:43,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->P1FINAL: Formula: (and (= v_~x~0_44 v_~__unbuffered_p1_EAX~0_54) (= v_~__unbuffered_cnt~0_175 (+ v_~__unbuffered_cnt~0_176 1)) (= |v_P1Thread1of1ForFork1_#res.base_19| 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_21| v_P1Thread1of1ForFork1_~arg.offset_21) (= |v_P1Thread1of1ForFork1_#res.offset_19| 0) (= v_P1Thread1of1ForFork1_~arg.base_21 |v_P1Thread1of1ForFork1_#in~arg.base_21|) (= v_~y~0_34 1)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_176, ~x~0=v_~x~0_44} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~y~0=v_~y~0_34, ~x~0=v_~x~0_44, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_19|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#res.base] and [171] $Ultimate##0-->L723: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_8 v_~y~0_9) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_9, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 03:13:43,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] $Ultimate##0-->L741: Formula: (and (= v_~y~0_32 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= v_~x~0_42 v_~__unbuffered_p1_EAX~0_52)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~x~0=v_~x~0_42} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~y~0=v_~y~0_32, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~y~0] and [171] $Ultimate##0-->L723: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_8 v_~y~0_9) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_9, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 03:13:43,463 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [213] $Ultimate##0-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_23 |v_P1Thread1of1ForFork1_#in~arg.base_23|) (= |v_P1Thread1of1ForFork1_#res.base_21| 0) (= v_~x~0_46 v_~__unbuffered_p1_EAX~0_56) (= v_~__unbuffered_cnt~0_179 (+ v_~__unbuffered_cnt~0_180 1)) (= v_~y~0_36 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_23| v_P1Thread1of1ForFork1_~arg.offset_23) (= |v_P1Thread1of1ForFork1_#res.offset_21| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_180, ~x~0=v_~x~0_46} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_23, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_23, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_179, ~y~0=v_~y~0_36, ~x~0=v_~x~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#res.base] and [171] $Ultimate##0-->L723: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_8 v_~y~0_9) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_9, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 03:13:43,513 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:13:43,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-13 03:13:43,514 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 236 flow [2022-12-13 03:13:43,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-13 03:13:43,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:13:43,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:13:43,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:13:43,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 03:13:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:13:43,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1354344557, now seen corresponding path program 1 times [2022-12-13 03:13:43,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:13:43,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153378677] [2022-12-13 03:13:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:13:43,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:13:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:13:43,572 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-13 03:13:43,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:13:43,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153378677] [2022-12-13 03:13:43,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153378677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:13:43,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:13:43,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:13:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349872030] [2022-12-13 03:13:43,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:13:43,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:13:43,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:13:43,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:13:43,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:13:43,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 03:13:43,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-13 03:13:43,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:13:43,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 03:13:43,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:13:43,602 INFO L130 PetriNetUnfolder]: 16/53 cut-off events. [2022-12-13 03:13:43,603 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 03:13:43,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 53 events. 16/53 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 177 event pairs, 0 based on Foata normal form. 24/59 useless extension candidates. Maximal degree in co-relation 293. Up to 35 conditions per place. [2022-12-13 03:13:43,604 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2022-12-13 03:13:43,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 17 transitions, 218 flow [2022-12-13 03:13:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:13:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:13:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-13 03:13:43,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-13 03:13:43,610 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2022-12-13 03:13:43,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 17 transitions, 218 flow [2022-12-13 03:13:43,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:13:43,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:13:43,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:13:43,611 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:13:43,611 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:13:43,611 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:13:43,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 03:13:43,612 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:13:43,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-13 03:13:43,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 03:13:43,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 03:13:43,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 03:13:43,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:13:43,616 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-13 03:13:43,618 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:13:43,619 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:13:43,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:13:43 BasicIcfg [2022-12-13 03:13:43,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:13:43,625 INFO L158 Benchmark]: Toolchain (without parser) took 4182.44ms. Allocated memory was 187.7MB in the beginning and 228.6MB in the end (delta: 40.9MB). Free memory was 163.6MB in the beginning and 141.8MB in the end (delta: 21.8MB). Peak memory consumption was 63.2MB. Max. memory is 8.0GB. [2022-12-13 03:13:43,625 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:13:43,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.15ms. Allocated memory is still 187.7MB. Free memory was 163.0MB in the beginning and 141.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-13 03:13:43,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.89ms. Allocated memory is still 187.7MB. Free memory was 141.0MB in the beginning and 139.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 03:13:43,625 INFO L158 Benchmark]: Boogie Preprocessor took 26.93ms. Allocated memory is still 187.7MB. Free memory was 139.5MB in the beginning and 137.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:13:43,626 INFO L158 Benchmark]: RCFGBuilder took 423.84ms. Allocated memory is still 187.7MB. Free memory was 137.9MB in the beginning and 125.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 03:13:43,626 INFO L158 Benchmark]: TraceAbstraction took 3177.16ms. Allocated memory was 187.7MB in the beginning and 228.6MB in the end (delta: 40.9MB). Free memory was 124.2MB in the beginning and 141.8MB in the end (delta: -17.5MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. [2022-12-13 03:13:43,627 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 187.7MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 490.15ms. Allocated memory is still 187.7MB. Free memory was 163.0MB in the beginning and 141.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.89ms. Allocated memory is still 187.7MB. Free memory was 141.0MB in the beginning and 139.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.93ms. Allocated memory is still 187.7MB. Free memory was 139.5MB in the beginning and 137.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 423.84ms. Allocated memory is still 187.7MB. Free memory was 137.9MB in the beginning and 125.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3177.16ms. Allocated memory was 187.7MB in the beginning and 228.6MB in the end (delta: 40.9MB). Free memory was 124.2MB in the beginning and 141.8MB in the end (delta: -17.5MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 62 PlacesBefore, 25 PlacesAfterwards, 56 TransitionsBefore, 19 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 24 ConcurrentYvCompositions, 0 ChoiceCompositions, 44 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 613, independent: 575, independent conditional: 575, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 613, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 613, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 613, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 431, independent: 404, independent conditional: 0, independent unconditional: 404, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 431, independent: 401, independent conditional: 0, independent unconditional: 401, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 613, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 431, unknown conditional: 0, unknown unconditional: 431] , Statistics on independence cache: Total cache size (in pairs): 697, Positive cache size: 670, Positive conditional cache size: 0, Positive unconditional cache size: 670, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 27 PlacesBefore, 27 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 43, independent conditional: 12, independent unconditional: 31, dependent: 11, dependent conditional: 6, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 34 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 6, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 83 locations, 3 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.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 6 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=4, InterpolantAutomatonStates: 24, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 03:13:43,648 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...