/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:04:12,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:04:12,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:04:12,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:04:12,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:04:12,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:04:12,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:04:12,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:04:12,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:04:12,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:04:12,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:04:12,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:04:12,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:04:12,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:04:12,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:04:12,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:04:12,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:04:12,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:04:12,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:04:12,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:04:12,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:04:12,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:04:12,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:04:12,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:04:12,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:04:12,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:04:12,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:04:12,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:04:12,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:04:12,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:04:12,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:04:12,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:04:12,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:04:12,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:04:12,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:04:12,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:04:12,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:04:12,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:04:12,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:04:12,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:04:12,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:04:12,696 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-VariableLbe.epf [2023-01-28 07:04:12,722 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:04:12,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:04:12,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:04:12,723 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:04:12,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:04:12,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:04:12,724 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:04:12,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:04:12,724 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:04:12,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:04:12,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:04:12,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:04:12,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:04:12,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:04:12,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:04:12,725 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:04:12,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:04:12,725 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:04:12,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:04:12,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:04:12,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:04:12,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:04:12,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:04:12,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:04:12,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:04:12,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:04:12,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:04:12,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:04:12,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:04:12,726 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:04:12,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:04:12,727 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 07:04:12,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:04:12,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:04:12,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:04:12,947 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:04:12,947 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:04:12,948 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:04:13,867 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:04:14,095 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:04:14,096 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:04:14,106 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df79ccf05/0021e8c732c1405ba3f7c7cdae2a90be/FLAG37abbebdc [2023-01-28 07:04:14,473 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df79ccf05/0021e8c732c1405ba3f7c7cdae2a90be [2023-01-28 07:04:14,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:04:14,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:04:14,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:04:14,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:04:14,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:04:14,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da4ad98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14, skipping insertion in model container [2023-01-28 07:04:14,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:04:14,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:04:14,634 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-01-28 07:04:14,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:04:14,805 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:04:14,814 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-01-28 07:04:14,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:04:14,863 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:04:14,863 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:04:14,868 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:04:14,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14 WrapperNode [2023-01-28 07:04:14,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:04:14,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:04:14,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:04:14,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:04:14,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,901 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2023-01-28 07:04:14,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:04:14,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:04:14,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:04:14,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:04:14,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,917 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:04:14,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:04:14,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:04:14,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:04:14,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (1/1) ... [2023-01-28 07:04:14,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:04:14,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:04:14,942 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) [2023-01-28 07:04:14,943 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 [2023-01-28 07:04:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:04:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 07:04:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:04:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:04:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:04:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 07:04:14,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 07:04:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 07:04:14,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 07:04:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:04:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 07:04:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:04:14,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:04:14,972 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 07:04:15,061 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:04:15,066 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:04:15,304 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:04:15,374 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:04:15,375 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 07:04:15,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:04:15 BoogieIcfgContainer [2023-01-28 07:04:15,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:04:15,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:04:15,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:04:15,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:04:15,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:04:14" (1/3) ... [2023-01-28 07:04:15,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f41c2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:04:15, skipping insertion in model container [2023-01-28 07:04:15,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:04:14" (2/3) ... [2023-01-28 07:04:15,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f41c2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:04:15, skipping insertion in model container [2023-01-28 07:04:15,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:04:15" (3/3) ... [2023-01-28 07:04:15,382 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:04:15,394 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:04:15,394 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 07:04:15,394 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:04:15,448 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 07:04:15,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2023-01-28 07:04:15,508 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2023-01-28 07:04:15,509 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:04:15,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-01-28 07:04:15,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2023-01-28 07:04:15,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2023-01-28 07:04:15,517 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:04:15,524 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2023-01-28 07:04:15,527 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2023-01-28 07:04:15,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2023-01-28 07:04:15,559 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2023-01-28 07:04:15,559 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:04:15,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-01-28 07:04:15,561 INFO L119 LiptonReduction]: Number of co-enabled transitions 936 [2023-01-28 07:04:17,747 INFO L134 LiptonReduction]: Checked pairs total: 2195 [2023-01-28 07:04:17,747 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-01-28 07:04:17,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:04:17,770 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;@3d633735, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:04:17,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 07:04:17,773 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-28 07:04:17,773 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:04:17,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:17,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 07:04:17,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:04:17,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash 370794521, now seen corresponding path program 1 times [2023-01-28 07:04:17,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:17,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891091017] [2023-01-28 07:04:17,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:17,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:04:18,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:18,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891091017] [2023-01-28 07:04:18,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891091017] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:18,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:18,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:04:18,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349255953] [2023-01-28 07:04:18,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:18,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:04:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:04:18,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:04:18,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 166 [2023-01-28 07:04:18,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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) [2023-01-28 07:04:18,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:18,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 166 [2023-01-28 07:04:18,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:18,165 INFO L130 PetriNetUnfolder]: 111/220 cut-off events. [2023-01-28 07:04:18,166 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 07:04:18,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 220 events. 111/220 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 796 event pairs, 18 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 424. Up to 154 conditions per place. [2023-01-28 07:04:18,169 INFO L137 encePairwiseOnDemand]: 162/166 looper letters, 17 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2023-01-28 07:04:18,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 92 flow [2023-01-28 07:04:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:04:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:04:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2023-01-28 07:04:18,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 07:04:18,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 249 transitions. [2023-01-28 07:04:18,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 249 transitions. [2023-01-28 07:04:18,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:18,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 249 transitions. [2023-01-28 07:04:18,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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) [2023-01-28 07:04:18,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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) [2023-01-28 07:04:18,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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) [2023-01-28 07:04:18,193 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 40 flow. Second operand 3 states and 249 transitions. [2023-01-28 07:04:18,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 92 flow [2023-01-28 07:04:18,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:04:18,205 INFO L231 Difference]: Finished difference. Result has 22 places, 14 transitions, 36 flow [2023-01-28 07:04:18,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=36, PETRI_PLACES=22, PETRI_TRANSITIONS=14} [2023-01-28 07:04:18,208 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2023-01-28 07:04:18,208 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 36 flow [2023-01-28 07:04:18,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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) [2023-01-28 07:04:18,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:18,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:18,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:04:18,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:04:18,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash -148694516, now seen corresponding path program 1 times [2023-01-28 07:04:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292344334] [2023-01-28 07:04:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:04:18,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:18,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292344334] [2023-01-28 07:04:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292344334] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:18,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:04:18,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081523137] [2023-01-28 07:04:18,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:18,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:04:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:18,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:04:18,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:04:18,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-01-28 07:04:18,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 36 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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) [2023-01-28 07:04:18,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:18,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-01-28 07:04:18,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:18,548 INFO L130 PetriNetUnfolder]: 132/252 cut-off events. [2023-01-28 07:04:18,548 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-28 07:04:18,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 252 events. 132/252 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1014 event pairs, 36 based on Foata normal form. 14/266 useless extension candidates. Maximal degree in co-relation 523. Up to 161 conditions per place. [2023-01-28 07:04:18,551 INFO L137 encePairwiseOnDemand]: 161/166 looper letters, 20 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2023-01-28 07:04:18,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 108 flow [2023-01-28 07:04:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:04:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:04:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-01-28 07:04:18,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779116465863454 [2023-01-28 07:04:18,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-01-28 07:04:18,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-01-28 07:04:18,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:18,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-01-28 07:04:18,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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) [2023-01-28 07:04:18,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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) [2023-01-28 07:04:18,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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) [2023-01-28 07:04:18,558 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 36 flow. Second operand 3 states and 238 transitions. [2023-01-28 07:04:18,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 108 flow [2023-01-28 07:04:18,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:04:18,559 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 58 flow [2023-01-28 07:04:18,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2023-01-28 07:04:18,562 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2023-01-28 07:04:18,562 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 58 flow [2023-01-28 07:04:18,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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) [2023-01-28 07:04:18,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:18,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:18,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:04:18,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:04:18,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash -314563431, now seen corresponding path program 1 times [2023-01-28 07:04:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:18,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180792544] [2023-01-28 07:04:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:04:18,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180792544] [2023-01-28 07:04:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180792544] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:04:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533388549] [2023-01-28 07:04:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:04:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:04:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:04:18,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 166 [2023-01-28 07:04:18,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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) [2023-01-28 07:04:18,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:18,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 166 [2023-01-28 07:04:18,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:18,813 INFO L130 PetriNetUnfolder]: 71/167 cut-off events. [2023-01-28 07:04:18,813 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2023-01-28 07:04:18,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 167 events. 71/167 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 647 event pairs, 13 based on Foata normal form. 25/192 useless extension candidates. Maximal degree in co-relation 407. Up to 83 conditions per place. [2023-01-28 07:04:18,814 INFO L137 encePairwiseOnDemand]: 161/166 looper letters, 20 selfloop transitions, 3 changer transitions 15/40 dead transitions. [2023-01-28 07:04:18,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 40 transitions, 214 flow [2023-01-28 07:04:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:04:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:04:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 376 transitions. [2023-01-28 07:04:18,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4530120481927711 [2023-01-28 07:04:18,816 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 376 transitions. [2023-01-28 07:04:18,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 376 transitions. [2023-01-28 07:04:18,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:18,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 376 transitions. [2023-01-28 07:04:18,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 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) [2023-01-28 07:04:18,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 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) [2023-01-28 07:04:18,819 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 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) [2023-01-28 07:04:18,819 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 58 flow. Second operand 5 states and 376 transitions. [2023-01-28 07:04:18,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 40 transitions, 214 flow [2023-01-28 07:04:18,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 40 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:04:18,821 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 77 flow [2023-01-28 07:04:18,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-01-28 07:04:18,821 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-01-28 07:04:18,822 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 77 flow [2023-01-28 07:04:18,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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) [2023-01-28 07:04:18,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:18,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:18,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 07:04:18,822 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:04:18,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:18,823 INFO L85 PathProgramCache]: Analyzing trace with hash 133497022, now seen corresponding path program 1 times [2023-01-28 07:04:18,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:18,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427753744] [2023-01-28 07:04:18,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:18,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:04:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:04:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:04:18,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427753744] [2023-01-28 07:04:18,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427753744] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:04:18,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:04:18,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:04:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575845702] [2023-01-28 07:04:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:04:18,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:04:18,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:04:18,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:04:18,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:04:18,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 166 [2023-01-28 07:04:18,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 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) [2023-01-28 07:04:18,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:04:18,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 166 [2023-01-28 07:04:18,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:04:19,042 INFO L130 PetriNetUnfolder]: 28/82 cut-off events. [2023-01-28 07:04:19,042 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2023-01-28 07:04:19,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 82 events. 28/82 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 239 event pairs, 8 based on Foata normal form. 12/94 useless extension candidates. Maximal degree in co-relation 245. Up to 33 conditions per place. [2023-01-28 07:04:19,043 INFO L137 encePairwiseOnDemand]: 161/166 looper letters, 15 selfloop transitions, 5 changer transitions 11/33 dead transitions. [2023-01-28 07:04:19,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 193 flow [2023-01-28 07:04:19,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:04:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:04:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 438 transitions. [2023-01-28 07:04:19,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4397590361445783 [2023-01-28 07:04:19,045 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 438 transitions. [2023-01-28 07:04:19,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 438 transitions. [2023-01-28 07:04:19,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:04:19,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 438 transitions. [2023-01-28 07:04:19,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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) [2023-01-28 07:04:19,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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) [2023-01-28 07:04:19,048 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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) [2023-01-28 07:04:19,048 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 77 flow. Second operand 6 states and 438 transitions. [2023-01-28 07:04:19,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 193 flow [2023-01-28 07:04:19,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 180 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-28 07:04:19,049 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 88 flow [2023-01-28 07:04:19,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2023-01-28 07:04:19,050 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2023-01-28 07:04:19,050 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 88 flow [2023-01-28 07:04:19,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 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) [2023-01-28 07:04:19,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:04:19,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:04:19,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 07:04:19,051 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:04:19,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:04:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash -903166353, now seen corresponding path program 1 times [2023-01-28 07:04:19,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:04:19,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141506869] [2023-01-28 07:04:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:04:19,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:04:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:04:19,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:04:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:04:19,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:04:19,127 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:04:19,128 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 07:04:19,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 07:04:19,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 07:04:19,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 07:04:19,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 07:04:19,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 07:04:19,130 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-01-28 07:04:19,135 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 07:04:19,135 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 07:04:19,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 07:04:19 BasicIcfg [2023-01-28 07:04:19,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 07:04:19,184 INFO L158 Benchmark]: Toolchain (without parser) took 4708.59ms. Allocated memory is still 616.6MB. Free memory was 569.7MB in the beginning and 285.9MB in the end (delta: 283.8MB). Peak memory consumption was 286.9MB. Max. memory is 16.0GB. [2023-01-28 07:04:19,184 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 356.5MB. Free memory is still 300.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 07:04:19,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.18ms. Allocated memory is still 616.6MB. Free memory was 569.1MB in the beginning and 547.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-28 07:04:19,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.89ms. Allocated memory is still 616.6MB. Free memory was 547.4MB in the beginning and 544.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:04:19,185 INFO L158 Benchmark]: Boogie Preprocessor took 18.05ms. Allocated memory is still 616.6MB. Free memory was 544.6MB in the beginning and 543.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:04:19,185 INFO L158 Benchmark]: RCFGBuilder took 454.74ms. Allocated memory is still 616.6MB. Free memory was 543.2MB in the beginning and 513.2MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-28 07:04:19,185 INFO L158 Benchmark]: TraceAbstraction took 3806.01ms. Allocated memory is still 616.6MB. Free memory was 512.4MB in the beginning and 285.9MB in the end (delta: 226.5MB). Peak memory consumption was 228.2MB. Max. memory is 16.0GB. [2023-01-28 07:04:19,187 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.12ms. Allocated memory is still 356.5MB. Free memory is still 300.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 392.18ms. Allocated memory is still 616.6MB. Free memory was 569.1MB in the beginning and 547.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.89ms. Allocated memory is still 616.6MB. Free memory was 547.4MB in the beginning and 544.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.05ms. Allocated memory is still 616.6MB. Free memory was 544.6MB in the beginning and 543.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 454.74ms. Allocated memory is still 616.6MB. Free memory was 543.2MB in the beginning and 513.2MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 3806.01ms. Allocated memory is still 616.6MB. Free memory was 512.4MB in the beginning and 285.9MB in the end (delta: 226.5MB). Peak memory consumption was 228.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 89 PlacesBefore, 23 PlacesAfterwards, 84 TransitionsBefore, 17 TransitionsAfterwards, 936 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 2195 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 996, independent: 891, independent conditional: 0, independent unconditional: 891, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 525, independent: 501, independent conditional: 0, independent unconditional: 501, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 996, independent: 390, independent conditional: 0, independent unconditional: 390, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 525, unknown conditional: 0, unknown unconditional: 525] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2561, ((void *)0), P0, ((void *)0))=-1, t2561={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2562, ((void *)0), P1, ((void *)0))=0, t2561={5:0}, t2562={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: 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: 806]: 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: 804]: 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, 103 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1 mSDtfsCounter, 156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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! [2023-01-28 07:04:19,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...