/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 BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:48:53,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:48:53,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:48:53,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:48:53,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:48:53,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:48:53,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:48:53,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:48:53,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:48:53,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:48:53,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:48:53,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:48:53,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:48:53,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:48:53,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:48:53,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:48:53,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:48:53,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:48:53,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:48:53,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:48:53,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:48:53,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:48:53,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:48:53,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:48:53,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:48:53,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:48:53,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:48:53,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:48:53,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:48:53,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:48:53,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:48:53,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:48:53,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:48:53,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:48:53,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:48:53,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:48:53,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:48:53,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:48:53,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:48:53,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:48:53,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:48:53,838 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 00:48:53,859 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:48:53,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:48:53,860 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:48:53,860 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:48:53,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:48:53,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:48:53,861 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:48:53,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:48:53,861 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:48:53,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:48:53,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:48:53,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:48:53,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:48:53,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:48:53,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:48:53,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:48:53,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:48:53,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:48:53,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:48:53,863 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:48:53,863 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:48:53,863 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 -> BEFORE [2023-01-28 00:48:54,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:48:54,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:48:54,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:48:54,085 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:48:54,085 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:48:54,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 00:48:55,119 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:48:55,308 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:48:55,308 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 00:48:55,325 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153362ead/51149e527efb4a568cd4bc2700f324a2/FLAGa6a508b09 [2023-01-28 00:48:55,335 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153362ead/51149e527efb4a568cd4bc2700f324a2 [2023-01-28 00:48:55,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:48:55,337 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:48:55,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:48:55,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:48:55,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:48:55,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2027a5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55, skipping insertion in model container [2023-01-28 00:48:55,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:48:55,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:48:55,485 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-01-28 00:48:55,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:48:55,622 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:48:55,633 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-01-28 00:48:55,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:48:55,704 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:48:55,704 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:48:55,709 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:48:55,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55 WrapperNode [2023-01-28 00:48:55,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:48:55,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:48:55,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:48:55,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:48:55,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,771 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-01-28 00:48:55,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:48:55,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:48:55,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:48:55,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:48:55,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,802 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:48:55,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:48:55,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:48:55,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:48:55,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (1/1) ... [2023-01-28 00:48:55,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:48:55,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:48:55,861 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 00:48:55,876 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 00:48:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:48:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:48:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:48:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:48:55,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:48:55,900 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:48:55,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:48:55,901 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:48:55,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:48:55,901 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:48:55,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:48:55,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:48:55,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:48:55,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:48:55,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:48:55,902 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 00:48:56,056 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:48:56,058 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:48:56,386 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:48:56,497 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:48:56,497 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:48:56,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:48:56 BoogieIcfgContainer [2023-01-28 00:48:56,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:48:56,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:48:56,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:48:56,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:48:56,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:48:55" (1/3) ... [2023-01-28 00:48:56,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3be227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:48:56, skipping insertion in model container [2023-01-28 00:48:56,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:55" (2/3) ... [2023-01-28 00:48:56,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3be227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:48:56, skipping insertion in model container [2023-01-28 00:48:56,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:48:56" (3/3) ... [2023-01-28 00:48:56,504 INFO L112 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 00:48:56,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:48:56,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:48:56,514 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:48:56,557 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:48:56,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2023-01-28 00:48:56,622 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 00:48:56,622 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:48:56,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:48:56,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2023-01-28 00:48:56,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2023-01-28 00:48:56,638 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:48:56,655 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2023-01-28 00:48:56,657 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2023-01-28 00:48:56,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2023-01-28 00:48:56,682 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 00:48:56,682 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:48:56,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:48:56,684 INFO L119 LiptonReduction]: Number of co-enabled transitions 1818 [2023-01-28 00:48:59,274 INFO L134 LiptonReduction]: Checked pairs total: 4673 [2023-01-28 00:48:59,274 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-01-28 00:48:59,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:48:59,295 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;@5d5c0897, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:48:59,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:48:59,299 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-28 00:48:59,299 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:48:59,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:59,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:48:59,301 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:48:59,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash 461903, now seen corresponding path program 1 times [2023-01-28 00:48:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:59,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661107301] [2023-01-28 00:48:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:59,602 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 00:48:59,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:59,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661107301] [2023-01-28 00:48:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661107301] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:59,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:59,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:48:59,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207005284] [2023-01-28 00:48:59,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:59,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:48:59,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:59,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:48:59,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:48:59,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 195 [2023-01-28 00:48:59,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 00:48:59,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:59,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 195 [2023-01-28 00:48:59,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:59,849 INFO L130 PetriNetUnfolder]: 1263/2014 cut-off events. [2023-01-28 00:48:59,850 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-28 00:48:59,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3925 conditions, 2014 events. 1263/2014 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10361 event pairs, 204 based on Foata normal form. 80/1934 useless extension candidates. Maximal degree in co-relation 3914. Up to 1510 conditions per place. [2023-01-28 00:48:59,859 INFO L137 encePairwiseOnDemand]: 191/195 looper letters, 33 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-01-28 00:48:59,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 173 flow [2023-01-28 00:48:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:48:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:48:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-01-28 00:48:59,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435897435897435 [2023-01-28 00:48:59,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-01-28 00:48:59,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-01-28 00:48:59,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:59,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-01-28 00:48:59,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 00:48:59,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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 00:48:59,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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 00:48:59,877 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 318 transitions. [2023-01-28 00:48:59,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 173 flow [2023-01-28 00:48:59,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:48:59,880 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-01-28 00:48:59,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-01-28 00:48:59,883 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-28 00:48:59,883 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-01-28 00:48:59,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 00:48:59,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:59,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:59,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:48:59,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:48:59,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1085565946, now seen corresponding path program 1 times [2023-01-28 00:48:59,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:59,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861319407] [2023-01-28 00:48:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:59,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:00,066 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 00:49:00,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861319407] [2023-01-28 00:49:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861319407] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:49:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370523074] [2023-01-28 00:49:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:00,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:49:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:00,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:49:00,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:49:00,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 195 [2023-01-28 00:49:00,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 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 00:49:00,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:00,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 195 [2023-01-28 00:49:00,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:00,411 INFO L130 PetriNetUnfolder]: 1918/2919 cut-off events. [2023-01-28 00:49:00,412 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2023-01-28 00:49:00,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6040 conditions, 2919 events. 1918/2919 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14363 event pairs, 566 based on Foata normal form. 157/3076 useless extension candidates. Maximal degree in co-relation 6030. Up to 1664 conditions per place. [2023-01-28 00:49:00,422 INFO L137 encePairwiseOnDemand]: 188/195 looper letters, 32 selfloop transitions, 5 changer transitions 23/60 dead transitions. [2023-01-28 00:49:00,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 60 transitions, 258 flow [2023-01-28 00:49:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:49:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:49:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2023-01-28 00:49:00,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4841025641025641 [2023-01-28 00:49:00,426 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 472 transitions. [2023-01-28 00:49:00,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 472 transitions. [2023-01-28 00:49:00,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:00,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 472 transitions. [2023-01-28 00:49:00,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 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 00:49:00,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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 00:49:00,431 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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 00:49:00,431 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 472 transitions. [2023-01-28 00:49:00,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 60 transitions, 258 flow [2023-01-28 00:49:00,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 60 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:49:00,433 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 98 flow [2023-01-28 00:49:00,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-01-28 00:49:00,434 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-01-28 00:49:00,434 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 98 flow [2023-01-28 00:49:00,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 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 00:49:00,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:00,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:00,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:49:00,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:00,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash -707212828, now seen corresponding path program 1 times [2023-01-28 00:49:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872102352] [2023-01-28 00:49:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:00,654 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 00:49:00,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:00,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872102352] [2023-01-28 00:49:00,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872102352] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:00,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:00,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:49:00,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130046202] [2023-01-28 00:49:00,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:00,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:49:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:00,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:49:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:49:00,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 195 [2023-01-28 00:49:00,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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 00:49:00,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:00,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 195 [2023-01-28 00:49:00,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:01,013 INFO L130 PetriNetUnfolder]: 1707/2623 cut-off events. [2023-01-28 00:49:01,013 INFO L131 PetriNetUnfolder]: For 1614/1614 co-relation queries the response was YES. [2023-01-28 00:49:01,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6869 conditions, 2623 events. 1707/2623 cut-off events. For 1614/1614 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12491 event pairs, 315 based on Foata normal form. 120/2743 useless extension candidates. Maximal degree in co-relation 6855. Up to 1368 conditions per place. [2023-01-28 00:49:01,024 INFO L137 encePairwiseOnDemand]: 188/195 looper letters, 37 selfloop transitions, 6 changer transitions 25/68 dead transitions. [2023-01-28 00:49:01,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 68 transitions, 358 flow [2023-01-28 00:49:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:49:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:49:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 642 transitions. [2023-01-28 00:49:01,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703296703296703 [2023-01-28 00:49:01,026 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 642 transitions. [2023-01-28 00:49:01,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 642 transitions. [2023-01-28 00:49:01,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:01,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 642 transitions. [2023-01-28 00:49:01,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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 00:49:01,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 00:49:01,030 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 00:49:01,030 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 98 flow. Second operand 7 states and 642 transitions. [2023-01-28 00:49:01,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 68 transitions, 358 flow [2023-01-28 00:49:01,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 68 transitions, 328 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 00:49:01,036 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 130 flow [2023-01-28 00:49:01,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2023-01-28 00:49:01,037 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-01-28 00:49:01,037 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 130 flow [2023-01-28 00:49:01,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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 00:49:01,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:01,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:01,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:49:01,038 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:01,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash -707219555, now seen corresponding path program 1 times [2023-01-28 00:49:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:01,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304250991] [2023-01-28 00:49:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:01,146 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 00:49:01,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:01,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304250991] [2023-01-28 00:49:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304250991] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:01,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:01,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:49:01,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805650989] [2023-01-28 00:49:01,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:01,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:49:01,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:01,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:49:01,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:49:01,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 195 [2023-01-28 00:49:01,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 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 00:49:01,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:01,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 195 [2023-01-28 00:49:01,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:01,561 INFO L130 PetriNetUnfolder]: 2270/3466 cut-off events. [2023-01-28 00:49:01,561 INFO L131 PetriNetUnfolder]: For 4197/4197 co-relation queries the response was YES. [2023-01-28 00:49:01,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9483 conditions, 3466 events. 2270/3466 cut-off events. For 4197/4197 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17919 event pairs, 490 based on Foata normal form. 125/3591 useless extension candidates. Maximal degree in co-relation 9463. Up to 1663 conditions per place. [2023-01-28 00:49:01,577 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 36 selfloop transitions, 5 changer transitions 33/74 dead transitions. [2023-01-28 00:49:01,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 468 flow [2023-01-28 00:49:01,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:49:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:49:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-01-28 00:49:01,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48205128205128206 [2023-01-28 00:49:01,579 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-01-28 00:49:01,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-01-28 00:49:01,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:01,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-01-28 00:49:01,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 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 00:49:01,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 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 00:49:01,582 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 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 00:49:01,582 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 130 flow. Second operand 6 states and 564 transitions. [2023-01-28 00:49:01,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 468 flow [2023-01-28 00:49:01,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 74 transitions, 456 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-28 00:49:01,598 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 152 flow [2023-01-28 00:49:01,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2023-01-28 00:49:01,598 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-01-28 00:49:01,598 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 152 flow [2023-01-28 00:49:01,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 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 00:49:01,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:01,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:01,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:49:01,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:01,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash -448786701, now seen corresponding path program 1 times [2023-01-28 00:49:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:01,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108886659] [2023-01-28 00:49:01,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:01,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:01,741 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 00:49:01,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:01,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108886659] [2023-01-28 00:49:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108886659] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:01,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:49:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001661287] [2023-01-28 00:49:01,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:01,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:49:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:01,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:49:01,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:49:01,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 195 [2023-01-28 00:49:01,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 00:49:01,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:01,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 195 [2023-01-28 00:49:01,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:01,915 INFO L130 PetriNetUnfolder]: 862/1434 cut-off events. [2023-01-28 00:49:01,915 INFO L131 PetriNetUnfolder]: For 2028/2060 co-relation queries the response was YES. [2023-01-28 00:49:01,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 1434 events. 862/1434 cut-off events. For 2028/2060 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7001 event pairs, 170 based on Foata normal form. 121/1551 useless extension candidates. Maximal degree in co-relation 4244. Up to 921 conditions per place. [2023-01-28 00:49:01,922 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 37 selfloop transitions, 4 changer transitions 28/72 dead transitions. [2023-01-28 00:49:01,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 512 flow [2023-01-28 00:49:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:49:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:49:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2023-01-28 00:49:01,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48923076923076925 [2023-01-28 00:49:01,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 477 transitions. [2023-01-28 00:49:01,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 477 transitions. [2023-01-28 00:49:01,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:01,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 477 transitions. [2023-01-28 00:49:01,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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 00:49:01,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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 00:49:01,926 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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 00:49:01,926 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 152 flow. Second operand 5 states and 477 transitions. [2023-01-28 00:49:01,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 512 flow [2023-01-28 00:49:01,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 455 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-01-28 00:49:01,929 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 161 flow [2023-01-28 00:49:01,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-01-28 00:49:01,930 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-01-28 00:49:01,930 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 161 flow [2023-01-28 00:49:01,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 00:49:01,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:01,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:01,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:49:01,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:01,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:01,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1171889109, now seen corresponding path program 1 times [2023-01-28 00:49:01,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:01,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494059676] [2023-01-28 00:49:01,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:02,088 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 00:49:02,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494059676] [2023-01-28 00:49:02,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494059676] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:02,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:02,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:49:02,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707542152] [2023-01-28 00:49:02,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:02,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:49:02,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:02,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:49:02,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:49:02,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 195 [2023-01-28 00:49:02,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 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 00:49:02,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:02,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 195 [2023-01-28 00:49:02,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:02,246 INFO L130 PetriNetUnfolder]: 396/723 cut-off events. [2023-01-28 00:49:02,246 INFO L131 PetriNetUnfolder]: For 840/848 co-relation queries the response was YES. [2023-01-28 00:49:02,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 723 events. 396/723 cut-off events. For 840/848 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3273 event pairs, 84 based on Foata normal form. 72/791 useless extension candidates. Maximal degree in co-relation 2383. Up to 259 conditions per place. [2023-01-28 00:49:02,249 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 48 selfloop transitions, 7 changer transitions 26/84 dead transitions. [2023-01-28 00:49:02,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 591 flow [2023-01-28 00:49:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:49:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:49:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2023-01-28 00:49:02,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897435897435897 [2023-01-28 00:49:02,250 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 573 transitions. [2023-01-28 00:49:02,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 573 transitions. [2023-01-28 00:49:02,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:02,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 573 transitions. [2023-01-28 00:49:02,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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 00:49:02,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 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 00:49:02,253 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 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 00:49:02,253 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 161 flow. Second operand 6 states and 573 transitions. [2023-01-28 00:49:02,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 591 flow [2023-01-28 00:49:02,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 585 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:49:02,256 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 211 flow [2023-01-28 00:49:02,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2023-01-28 00:49:02,257 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-01-28 00:49:02,257 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 211 flow [2023-01-28 00:49:02,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 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 00:49:02,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:02,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:02,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:49:02,257 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:02,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:02,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1648453958, now seen corresponding path program 1 times [2023-01-28 00:49:02,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:02,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775637350] [2023-01-28 00:49:02,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:02,523 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 00:49:02,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775637350] [2023-01-28 00:49:02,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775637350] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:02,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:02,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:49:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273247497] [2023-01-28 00:49:02,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:02,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:49:02,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:49:02,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:49:02,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 195 [2023-01-28 00:49:02,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 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 00:49:02,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:02,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 195 [2023-01-28 00:49:02,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:02,656 INFO L130 PetriNetUnfolder]: 251/464 cut-off events. [2023-01-28 00:49:02,656 INFO L131 PetriNetUnfolder]: For 817/823 co-relation queries the response was YES. [2023-01-28 00:49:02,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 464 events. 251/464 cut-off events. For 817/823 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1923 event pairs, 75 based on Foata normal form. 20/480 useless extension candidates. Maximal degree in co-relation 1639. Up to 178 conditions per place. [2023-01-28 00:49:02,658 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 44 selfloop transitions, 10 changer transitions 14/71 dead transitions. [2023-01-28 00:49:02,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 542 flow [2023-01-28 00:49:02,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:49:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:49:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2023-01-28 00:49:02,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473992673992674 [2023-01-28 00:49:02,660 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2023-01-28 00:49:02,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2023-01-28 00:49:02,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:02,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2023-01-28 00:49:02,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 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 00:49:02,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 00:49:02,663 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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 00:49:02,663 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 211 flow. Second operand 7 states and 647 transitions. [2023-01-28 00:49:02,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 542 flow [2023-01-28 00:49:02,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 481 flow, removed 22 selfloop flow, removed 6 redundant places. [2023-01-28 00:49:02,668 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 200 flow [2023-01-28 00:49:02,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-01-28 00:49:02,669 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-01-28 00:49:02,669 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 200 flow [2023-01-28 00:49:02,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 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 00:49:02,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:02,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:02,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:49:02,670 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:02,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash 123066235, now seen corresponding path program 1 times [2023-01-28 00:49:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592473136] [2023-01-28 00:49:02,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:03,354 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 00:49:03,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:03,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592473136] [2023-01-28 00:49:03,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592473136] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:03,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:03,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:49:03,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254339068] [2023-01-28 00:49:03,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:03,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:49:03,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:03,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:49:03,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:49:03,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 195 [2023-01-28 00:49:03,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 76.625) internal successors, (613), 8 states have internal predecessors, (613), 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 00:49:03,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:03,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 195 [2023-01-28 00:49:03,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:03,644 INFO L130 PetriNetUnfolder]: 287/526 cut-off events. [2023-01-28 00:49:03,644 INFO L131 PetriNetUnfolder]: For 925/925 co-relation queries the response was YES. [2023-01-28 00:49:03,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 526 events. 287/526 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2176 event pairs, 31 based on Foata normal form. 1/527 useless extension candidates. Maximal degree in co-relation 1820. Up to 168 conditions per place. [2023-01-28 00:49:03,646 INFO L137 encePairwiseOnDemand]: 185/195 looper letters, 52 selfloop transitions, 16 changer transitions 23/91 dead transitions. [2023-01-28 00:49:03,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 697 flow [2023-01-28 00:49:03,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:49:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:49:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 737 transitions. [2023-01-28 00:49:03,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41994301994301997 [2023-01-28 00:49:03,648 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 737 transitions. [2023-01-28 00:49:03,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 737 transitions. [2023-01-28 00:49:03,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:03,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 737 transitions. [2023-01-28 00:49:03,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.88888888888889) internal successors, (737), 9 states have internal predecessors, (737), 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 00:49:03,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 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 00:49:03,652 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 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 00:49:03,652 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 200 flow. Second operand 9 states and 737 transitions. [2023-01-28 00:49:03,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 697 flow [2023-01-28 00:49:03,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 91 transitions, 593 flow, removed 30 selfloop flow, removed 7 redundant places. [2023-01-28 00:49:03,655 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 236 flow [2023-01-28 00:49:03,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-01-28 00:49:03,656 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2023-01-28 00:49:03,656 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 236 flow [2023-01-28 00:49:03,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.625) internal successors, (613), 8 states have internal predecessors, (613), 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 00:49:03,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:03,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:03,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:49:03,656 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:03,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash 342469509, now seen corresponding path program 2 times [2023-01-28 00:49:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:03,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436424017] [2023-01-28 00:49:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:03,904 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 00:49:03,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:03,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436424017] [2023-01-28 00:49:03,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436424017] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:03,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:03,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:49:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471158437] [2023-01-28 00:49:03,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:03,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:49:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:03,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:49:03,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:49:03,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 195 [2023-01-28 00:49:03,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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 00:49:03,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:03,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 195 [2023-01-28 00:49:03,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:04,077 INFO L130 PetriNetUnfolder]: 410/792 cut-off events. [2023-01-28 00:49:04,077 INFO L131 PetriNetUnfolder]: For 1104/1104 co-relation queries the response was YES. [2023-01-28 00:49:04,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2732 conditions, 792 events. 410/792 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3926 event pairs, 105 based on Foata normal form. 3/795 useless extension candidates. Maximal degree in co-relation 2716. Up to 271 conditions per place. [2023-01-28 00:49:04,080 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 30 selfloop transitions, 3 changer transitions 61/94 dead transitions. [2023-01-28 00:49:04,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 698 flow [2023-01-28 00:49:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:49:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:49:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 803 transitions. [2023-01-28 00:49:04,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45754985754985755 [2023-01-28 00:49:04,083 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 803 transitions. [2023-01-28 00:49:04,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 803 transitions. [2023-01-28 00:49:04,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:04,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 803 transitions. [2023-01-28 00:49:04,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 89.22222222222223) internal successors, (803), 9 states have internal predecessors, (803), 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 00:49:04,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 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 00:49:04,087 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 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 00:49:04,087 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 236 flow. Second operand 9 states and 803 transitions. [2023-01-28 00:49:04,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 698 flow [2023-01-28 00:49:04,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 676 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-01-28 00:49:04,093 INFO L231 Difference]: Finished difference. Result has 64 places, 27 transitions, 151 flow [2023-01-28 00:49:04,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=64, PETRI_TRANSITIONS=27} [2023-01-28 00:49:04,094 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2023-01-28 00:49:04,094 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 27 transitions, 151 flow [2023-01-28 00:49:04,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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 00:49:04,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:04,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:04,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:49:04,094 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:04,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:04,095 INFO L85 PathProgramCache]: Analyzing trace with hash -660440461, now seen corresponding path program 3 times [2023-01-28 00:49:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:04,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787233402] [2023-01-28 00:49:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:04,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:49:04,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:49:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:49:04,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:49:04,211 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:49:04,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:49:04,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:49:04,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:49:04,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:49:04,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:49:04,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:49:04,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:49:04,214 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:04,218 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:49:04,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:49:04,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:49:04 BasicIcfg [2023-01-28 00:49:04,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:49:04,271 INFO L158 Benchmark]: Toolchain (without parser) took 8933.88ms. Allocated memory was 316.7MB in the beginning and 551.6MB in the end (delta: 234.9MB). Free memory was 276.3MB in the beginning and 317.9MB in the end (delta: -41.7MB). Peak memory consumption was 194.6MB. Max. memory is 16.0GB. [2023-01-28 00:49:04,271 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:49:04,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.82ms. Allocated memory is still 316.7MB. Free memory was 275.9MB in the beginning and 252.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:49:04,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.10ms. Allocated memory is still 316.7MB. Free memory was 252.8MB in the beginning and 250.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:49:04,272 INFO L158 Benchmark]: Boogie Preprocessor took 33.80ms. Allocated memory is still 316.7MB. Free memory was 250.4MB in the beginning and 248.7MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 00:49:04,272 INFO L158 Benchmark]: RCFGBuilder took 692.61ms. Allocated memory is still 316.7MB. Free memory was 248.7MB in the beginning and 281.1MB in the end (delta: -32.5MB). Peak memory consumption was 34.4MB. Max. memory is 16.0GB. [2023-01-28 00:49:04,272 INFO L158 Benchmark]: TraceAbstraction took 7770.56ms. Allocated memory was 316.7MB in the beginning and 551.6MB in the end (delta: 234.9MB). Free memory was 280.3MB in the beginning and 317.9MB in the end (delta: -37.6MB). Peak memory consumption was 197.9MB. Max. memory is 16.0GB. [2023-01-28 00:49:04,273 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.09ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 371.82ms. Allocated memory is still 316.7MB. Free memory was 275.9MB in the beginning and 252.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.10ms. Allocated memory is still 316.7MB. Free memory was 252.8MB in the beginning and 250.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 33.80ms. Allocated memory is still 316.7MB. Free memory was 250.4MB in the beginning and 248.7MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 692.61ms. Allocated memory is still 316.7MB. Free memory was 248.7MB in the beginning and 281.1MB in the end (delta: -32.5MB). Peak memory consumption was 34.4MB. Max. memory is 16.0GB. * TraceAbstraction took 7770.56ms. Allocated memory was 316.7MB in the beginning and 551.6MB in the end (delta: 234.9MB). Free memory was 280.3MB in the beginning and 317.9MB in the end (delta: -37.6MB). Peak memory consumption was 197.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 111 PlacesBefore, 34 PlacesAfterwards, 103 TransitionsBefore, 25 TransitionsAfterwards, 1818 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 4673 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1887, independent: 1713, independent conditional: 0, independent unconditional: 1713, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 948, independent: 917, independent conditional: 0, independent unconditional: 917, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1887, independent: 796, independent conditional: 0, independent unconditional: 796, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 948, unknown conditional: 0, unknown unconditional: 948] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L828] 0 pthread_t t2393; [L829] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2393, ((void *)0), P0, ((void *)0))=-1, t2393={5:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=0] [L830] 0 pthread_t t2394; [L831] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2394, ((void *)0), P1, ((void *)0))=0, t2393={5:0}, t2394={6:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=0] [L832] 0 pthread_t t2395; [L833] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2395, ((void *)0), P2, ((void *)0))=1, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=0] [L773] 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) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 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 [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 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_p2_EAX=0, __unbuffered_p2_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=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L787] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0: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=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=0] [L756] 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) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 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 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=1] [L806] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L837] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L837] RET 0 assume_abort_if_not(main$tmp_guard0) [L839] 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) [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] 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 [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=1] [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y=1] - 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: 829]: 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: 833]: 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: 831]: 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 7 procedures, 132 locations, 6 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: 7.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 339 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1008 IncrementalHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 8 mSDtfsCounter, 1008 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=8, InterpolantAutomatonStates: 57, 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.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 00:49:04,293 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...