/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:43:09,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:43:09,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:43:09,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:43:09,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:43:09,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:43:09,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:43:09,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:43:09,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:43:09,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:43:09,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:43:09,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:43:09,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:43:09,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:43:09,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:43:09,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:43:09,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:43:09,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:43:09,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:43:09,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:43:09,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:43:09,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:43:09,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:43:09,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:43:09,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:43:09,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:43:09,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:43:09,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:43:09,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:43:09,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:43:09,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:43:09,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:43:09,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:43:09,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:43:09,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:43:09,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:43:09,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:43:09,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:43:09,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:43:09,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:43:09,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:43:09,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 18:43:09,717 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:43:09,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:43:09,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:43:09,718 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:43:09,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:43:09,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:43:09,720 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:43:09,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:43:09,720 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:43:09,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:43:09,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:43:09,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:43:09,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:43:09,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:43:09,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:43:09,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:43:09,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:43:09,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:43:09,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:43:09,722 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:43:09,722 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-12 18:43:10,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:43:10,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:43:10,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:43:10,040 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:43:10,041 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:43:10,042 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 18:43:11,139 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:43:11,385 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:43:11,385 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 18:43:11,405 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2640e94/96d669e4164647ac8a0b2f764ba7da05/FLAG4e2776d75 [2022-12-12 18:43:11,422 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2640e94/96d669e4164647ac8a0b2f764ba7da05 [2022-12-12 18:43:11,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:43:11,425 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:43:11,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:43:11,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:43:11,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:43:11,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5dfbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11, skipping insertion in model container [2022-12-12 18:43:11,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:43:11,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:43:11,606 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-12 18:43:11,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:43:11,797 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:43:11,808 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-12 18:43:11,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:43:11,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:43:11,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:43:11,889 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:43:11,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11 WrapperNode [2022-12-12 18:43:11,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:43:11,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:43:11,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:43:11,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:43:11,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,946 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-12-12 18:43:11,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:43:11,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:43:11,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:43:11,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:43:11,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,976 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:43:11,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:43:11,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:43:11,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:43:11,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (1/1) ... [2022-12-12 18:43:11,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:43:12,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:43:12,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 18:43:12,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 18:43:12,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:43:12,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:43:12,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:43:12,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:43:12,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:43:12,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:43:12,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:43:12,064 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:43:12,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:43:12,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:43:12,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:43:12,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:43:12,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:43:12,065 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:43:12,176 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:43:12,178 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:43:12,441 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:43:12,583 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:43:12,583 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:43:12,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:43:12 BoogieIcfgContainer [2022-12-12 18:43:12,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:43:12,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:43:12,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:43:12,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:43:12,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:43:11" (1/3) ... [2022-12-12 18:43:12,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1f7bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:43:12, skipping insertion in model container [2022-12-12 18:43:12,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:43:11" (2/3) ... [2022-12-12 18:43:12,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1f7bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:43:12, skipping insertion in model container [2022-12-12 18:43:12,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:43:12" (3/3) ... [2022-12-12 18:43:12,606 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 18:43:12,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:43:12,632 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:43:12,632 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:43:12,662 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:43:12,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 186 flow [2022-12-12 18:43:12,737 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2022-12-12 18:43:12,738 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:43:12,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 18:43:12,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 88 transitions, 186 flow [2022-12-12 18:43:12,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 86 transitions, 178 flow [2022-12-12 18:43:12,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:43:12,762 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 86 transitions, 178 flow [2022-12-12 18:43:12,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 178 flow [2022-12-12 18:43:12,781 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2022-12-12 18:43:12,781 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:43:12,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 18:43:12,784 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 86 transitions, 178 flow [2022-12-12 18:43:12,784 INFO L226 LiptonReduction]: Number of co-enabled transitions 1034 [2022-12-12 18:43:16,257 INFO L241 LiptonReduction]: Total number of compositions: 70 [2022-12-12 18:43:16,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:43:16,285 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2cae9e2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:43:16,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 18:43:16,287 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-12 18:43:16,287 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:43:16,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:43:16,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 18:43:16,288 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:43:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:43:16,302 INFO L85 PathProgramCache]: Analyzing trace with hash 406336, now seen corresponding path program 1 times [2022-12-12 18:43:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:43:16,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056143566] [2022-12-12 18:43:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:43:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:43:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:43:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:43:16,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:43:16,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056143566] [2022-12-12 18:43:16,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056143566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:43:16,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:43:16,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:43:16,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937244136] [2022-12-12 18:43:16,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:43:16,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:43:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:43:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:43:16,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:43:16,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2022-12-12 18:43:16,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:16,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:43:16,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2022-12-12 18:43:16,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:43:16,939 INFO L130 PetriNetUnfolder]: 1122/2148 cut-off events. [2022-12-12 18:43:16,940 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 18:43:16,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4007 conditions, 2148 events. 1122/2148 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 14779 event pairs, 110 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 3997. Up to 1589 conditions per place. [2022-12-12 18:43:16,948 INFO L137 encePairwiseOnDemand]: 45/51 looper letters, 24 selfloop transitions, 2 changer transitions 47/80 dead transitions. [2022-12-12 18:43:16,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 313 flow [2022-12-12 18:43:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:43:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:43:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-12-12 18:43:16,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.673202614379085 [2022-12-12 18:43:16,960 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2022-12-12 18:43:16,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 80 transitions, 313 flow [2022-12-12 18:43:16,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 127 flow [2022-12-12 18:43:16,965 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2022-12-12 18:43:16,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:16,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:43:16,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:43:16,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:43:16,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:43:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:43:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1623345271, now seen corresponding path program 1 times [2022-12-12 18:43:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:43:16,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657973652] [2022-12-12 18:43:16,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:43:16,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:43:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:43:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:43:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:43:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657973652] [2022-12-12 18:43:17,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657973652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:43:17,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:43:17,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:43:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860612956] [2022-12-12 18:43:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:43:17,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:43:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:43:17,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:43:17,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:43:17,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2022-12-12 18:43:17,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:17,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:43:17,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2022-12-12 18:43:17,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:43:17,163 INFO L130 PetriNetUnfolder]: 215/404 cut-off events. [2022-12-12 18:43:17,164 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-12 18:43:17,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 404 events. 215/404 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1749 event pairs, 24 based on Foata normal form. 5/353 useless extension candidates. Maximal degree in co-relation 1120. Up to 321 conditions per place. [2022-12-12 18:43:17,165 INFO L137 encePairwiseOnDemand]: 48/51 looper letters, 31 selfloop transitions, 3 changer transitions 2/42 dead transitions. [2022-12-12 18:43:17,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 233 flow [2022-12-12 18:43:17,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:43:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:43:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-12 18:43:17,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3006535947712418 [2022-12-12 18:43:17,167 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -23 predicate places. [2022-12-12 18:43:17,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 42 transitions, 233 flow [2022-12-12 18:43:17,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 40 transitions, 225 flow [2022-12-12 18:43:17,169 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 40 transitions, 225 flow [2022-12-12 18:43:17,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:17,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:43:17,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:43:17,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:43:17,170 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:43:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:43:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1215906392, now seen corresponding path program 1 times [2022-12-12 18:43:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:43:17,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071441422] [2022-12-12 18:43:17,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:43:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:43:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:43:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:43:17,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:43:17,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071441422] [2022-12-12 18:43:17,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071441422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:43:17,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:43:17,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:43:17,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019790585] [2022-12-12 18:43:17,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:43:17,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:43:17,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:43:17,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:43:17,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:43:17,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-12 18:43:17,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 40 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:17,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:43:17,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-12 18:43:17,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:43:17,438 INFO L130 PetriNetUnfolder]: 217/407 cut-off events. [2022-12-12 18:43:17,438 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-12 18:43:17,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 407 events. 217/407 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1665 event pairs, 21 based on Foata normal form. 6/361 useless extension candidates. Maximal degree in co-relation 1497. Up to 317 conditions per place. [2022-12-12 18:43:17,441 INFO L137 encePairwiseOnDemand]: 46/51 looper letters, 52 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2022-12-12 18:43:17,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 486 flow [2022-12-12 18:43:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:43:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:43:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-12 18:43:17,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27058823529411763 [2022-12-12 18:43:17,444 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -20 predicate places. [2022-12-12 18:43:17,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 64 transitions, 486 flow [2022-12-12 18:43:17,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 64 transitions, 486 flow [2022-12-12 18:43:17,448 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 64 transitions, 486 flow [2022-12-12 18:43:17,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:17,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:43:17,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:43:17,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:43:17,449 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:43:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:43:17,450 INFO L85 PathProgramCache]: Analyzing trace with hash 961604527, now seen corresponding path program 1 times [2022-12-12 18:43:17,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:43:17,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016632577] [2022-12-12 18:43:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:43:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:43:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:43:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:43:17,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:43:17,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016632577] [2022-12-12 18:43:17,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016632577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:43:17,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:43:17,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:43:17,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274404263] [2022-12-12 18:43:17,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:43:17,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:43:17,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:43:17,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:43:17,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:43:17,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-12 18:43:17,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 64 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:17,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:43:17,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-12 18:43:17,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:43:17,703 INFO L130 PetriNetUnfolder]: 259/501 cut-off events. [2022-12-12 18:43:17,703 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-12 18:43:17,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 501 events. 259/501 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2319 event pairs, 16 based on Foata normal form. 24/451 useless extension candidates. Maximal degree in co-relation 2303. Up to 410 conditions per place. [2022-12-12 18:43:17,707 INFO L137 encePairwiseOnDemand]: 47/51 looper letters, 27 selfloop transitions, 3 changer transitions 36/70 dead transitions. [2022-12-12 18:43:17,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 70 transitions, 664 flow [2022-12-12 18:43:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:43:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:43:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-12 18:43:17,714 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29901960784313725 [2022-12-12 18:43:17,715 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -17 predicate places. [2022-12-12 18:43:17,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 70 transitions, 664 flow [2022-12-12 18:43:17,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 34 transitions, 316 flow [2022-12-12 18:43:17,718 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 316 flow [2022-12-12 18:43:17,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:17,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:43:17,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:43:17,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:43:17,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:43:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:43:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash -253490571, now seen corresponding path program 1 times [2022-12-12 18:43:17,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:43:17,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065612587] [2022-12-12 18:43:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:43:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:43:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:43:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:43:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:43:17,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065612587] [2022-12-12 18:43:17,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065612587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:43:17,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:43:17,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:43:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174159617] [2022-12-12 18:43:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:43:17,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:43:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:43:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:43:17,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:43:17,793 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-12 18:43:17,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:17,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:43:17,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-12 18:43:17,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:43:17,840 INFO L130 PetriNetUnfolder]: 123/255 cut-off events. [2022-12-12 18:43:17,841 INFO L131 PetriNetUnfolder]: For 276/276 co-relation queries the response was YES. [2022-12-12 18:43:17,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 255 events. 123/255 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 977 event pairs, 19 based on Foata normal form. 10/233 useless extension candidates. Maximal degree in co-relation 1385. Up to 226 conditions per place. [2022-12-12 18:43:17,842 INFO L137 encePairwiseOnDemand]: 43/51 looper letters, 30 selfloop transitions, 9 changer transitions 1/42 dead transitions. [2022-12-12 18:43:17,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 461 flow [2022-12-12 18:43:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:43:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:43:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-12 18:43:17,843 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3202614379084967 [2022-12-12 18:43:17,844 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -17 predicate places. [2022-12-12 18:43:17,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 42 transitions, 461 flow [2022-12-12 18:43:17,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 41 transitions, 459 flow [2022-12-12 18:43:17,845 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 41 transitions, 459 flow [2022-12-12 18:43:17,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:17,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:43:17,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:43:17,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:43:17,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:43:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:43:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash -306202580, now seen corresponding path program 1 times [2022-12-12 18:43:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:43:17,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980864264] [2022-12-12 18:43:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:43:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:43:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:43:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:43:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:43:17,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980864264] [2022-12-12 18:43:17,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980864264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:43:17,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:43:17,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:43:17,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656209570] [2022-12-12 18:43:17,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:43:17,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:43:17,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:43:17,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:43:17,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:43:17,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-12 18:43:17,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:17,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:43:17,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-12 18:43:17,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:43:17,976 INFO L130 PetriNetUnfolder]: 36/116 cut-off events. [2022-12-12 18:43:17,977 INFO L131 PetriNetUnfolder]: For 232/232 co-relation queries the response was YES. [2022-12-12 18:43:17,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 116 events. 36/116 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 393 event pairs, 0 based on Foata normal form. 18/120 useless extension candidates. Maximal degree in co-relation 738. Up to 95 conditions per place. [2022-12-12 18:43:17,978 INFO L137 encePairwiseOnDemand]: 43/51 looper letters, 22 selfloop transitions, 15 changer transitions 0/39 dead transitions. [2022-12-12 18:43:17,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 509 flow [2022-12-12 18:43:17,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:43:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:43:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-12 18:43:17,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2696078431372549 [2022-12-12 18:43:17,979 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -15 predicate places. [2022-12-12 18:43:17,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 509 flow [2022-12-12 18:43:17,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 39 transitions, 509 flow [2022-12-12 18:43:17,980 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 509 flow [2022-12-12 18:43:17,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:17,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:43:17,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:43:17,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:43:17,981 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:43:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:43:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2051884909, now seen corresponding path program 1 times [2022-12-12 18:43:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:43:17,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885816636] [2022-12-12 18:43:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:43:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:43:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:43:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:43:18,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:43:18,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885816636] [2022-12-12 18:43:18,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885816636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:43:18,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:43:18,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:43:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539532295] [2022-12-12 18:43:18,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:43:18,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:43:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:43:18,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:43:18,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:43:18,355 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2022-12-12 18:43:18,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:18,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:43:18,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2022-12-12 18:43:18,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:43:18,468 INFO L130 PetriNetUnfolder]: 47/165 cut-off events. [2022-12-12 18:43:18,469 INFO L131 PetriNetUnfolder]: For 346/346 co-relation queries the response was YES. [2022-12-12 18:43:18,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 165 events. 47/165 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 753 event pairs, 0 based on Foata normal form. 9/151 useless extension candidates. Maximal degree in co-relation 1181. Up to 136 conditions per place. [2022-12-12 18:43:18,470 INFO L137 encePairwiseOnDemand]: 45/51 looper letters, 24 selfloop transitions, 5 changer transitions 23/58 dead transitions. [2022-12-12 18:43:18,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 882 flow [2022-12-12 18:43:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:43:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:43:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-12 18:43:18,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22969187675070027 [2022-12-12 18:43:18,473 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2022-12-12 18:43:18,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 58 transitions, 882 flow [2022-12-12 18:43:18,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 35 transitions, 508 flow [2022-12-12 18:43:18,474 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 508 flow [2022-12-12 18:43:18,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:43:18,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:43:18,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:43:18,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:43:18,474 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:43:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:43:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1174591298, now seen corresponding path program 1 times [2022-12-12 18:43:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:43:18,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570607243] [2022-12-12 18:43:18,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:43:18,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:43:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:43:18,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:43:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:43:18,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:43:18,541 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:43:18,541 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 18:43:18,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 18:43:18,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 18:43:18,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 18:43:18,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 18:43:18,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:43:18,543 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:43:18,548 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:43:18,548 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:43:18,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:43:18 BasicIcfg [2022-12-12 18:43:18,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:43:18,586 INFO L158 Benchmark]: Toolchain (without parser) took 7160.40ms. Allocated memory was 223.3MB in the beginning and 369.1MB in the end (delta: 145.8MB). Free memory was 197.2MB in the beginning and 201.9MB in the end (delta: -4.7MB). Peak memory consumption was 141.6MB. Max. memory is 8.0GB. [2022-12-12 18:43:18,586 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 223.3MB. Free memory was 199.8MB in the beginning and 199.7MB in the end (delta: 77.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:43:18,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.48ms. Allocated memory is still 223.3MB. Free memory was 196.7MB in the beginning and 171.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 18:43:18,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.39ms. Allocated memory is still 223.3MB. Free memory was 171.6MB in the beginning and 169.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:43:18,587 INFO L158 Benchmark]: Boogie Preprocessor took 31.61ms. Allocated memory is still 223.3MB. Free memory was 169.5MB in the beginning and 167.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:43:18,587 INFO L158 Benchmark]: RCFGBuilder took 609.08ms. Allocated memory is still 223.3MB. Free memory was 167.4MB in the beginning and 135.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-12 18:43:18,587 INFO L158 Benchmark]: TraceAbstraction took 5983.81ms. Allocated memory was 223.3MB in the beginning and 369.1MB in the end (delta: 145.8MB). Free memory was 134.3MB in the beginning and 201.9MB in the end (delta: -67.6MB). Peak memory consumption was 78.7MB. Max. memory is 8.0GB. [2022-12-12 18:43:18,588 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.10ms. Allocated memory is still 223.3MB. Free memory was 199.8MB in the beginning and 199.7MB in the end (delta: 77.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 462.48ms. Allocated memory is still 223.3MB. Free memory was 196.7MB in the beginning and 171.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.39ms. Allocated memory is still 223.3MB. Free memory was 171.6MB in the beginning and 169.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.61ms. Allocated memory is still 223.3MB. Free memory was 169.5MB in the beginning and 167.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 609.08ms. Allocated memory is still 223.3MB. Free memory was 167.4MB in the beginning and 135.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5983.81ms. Allocated memory was 223.3MB in the beginning and 369.1MB in the end (delta: 145.8MB). Free memory was 134.3MB in the beginning and 201.9MB in the end (delta: -67.6MB). Peak memory consumption was 78.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 91 PlacesBefore, 57 PlacesAfterwards, 86 TransitionsBefore, 51 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2043, independent: 1950, independent conditional: 1950, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2043, independent: 1950, independent conditional: 0, independent unconditional: 1950, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2043, independent: 1950, independent conditional: 0, independent unconditional: 1950, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2043, independent: 1950, independent conditional: 0, independent unconditional: 1950, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 998, independent: 963, independent conditional: 0, independent unconditional: 963, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 998, independent: 954, independent conditional: 0, independent unconditional: 954, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 159, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2043, independent: 987, independent conditional: 0, independent unconditional: 987, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 998, unknown conditional: 0, unknown unconditional: 998] , Statistics on independence cache: Total cache size (in pairs): 2010, Positive cache size: 1975, Positive conditional cache size: 0, Positive unconditional cache size: 1975, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2305; [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2305, ((void *)0), P0, ((void *)0))=-1, t2305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 pthread_t t2306; [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2306, ((void *)0), P1, ((void *)0))=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L825] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 106 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 2 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=509occurred in iteration=6, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 918 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:43:18,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...