/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/mix016.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:37:20,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:37:20,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:37:20,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:37:20,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:37:20,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:37:20,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:37:20,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:37:20,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:37:20,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:37:20,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:37:20,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:37:20,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:37:20,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:37:20,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:37:20,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:37:20,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:37:20,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:37:20,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:37:20,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:37:20,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:37:20,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:37:20,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:37:20,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:37:20,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:37:20,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:37:20,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:37:20,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:37:20,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:37:20,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:37:20,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:37:20,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:37:20,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:37:20,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:37:20,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:37:20,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:37:20,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:37:20,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:37:20,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:37:20,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:37:20,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:37:20,896 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:37:20,919 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:37:20,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:37:20,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:37:20,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:37:20,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:37:20,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:37:20,921 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:37:20,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:37:20,921 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:37:20,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:37:20,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:37:20,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:37:20,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:37:20,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:37:20,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:37:20,922 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:37:20,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:37:20,922 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:37:20,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:37:20,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:37:20,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:37:20,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:37:20,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:37:20,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:37:20,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:37:20,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:37:20,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:37:20,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:37:20,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:37:20,924 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:37:20,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:37:20,924 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:37:21,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:37:21,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:37:21,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:37:21,141 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:37:21,141 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:37:21,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016.oepc.i [2023-01-28 00:37:22,107 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:37:22,281 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:37:22,281 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016.oepc.i [2023-01-28 00:37:22,290 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f0a4f0d/6d5a21c3a7f34edd88e610f5056a4324/FLAGd902dad8f [2023-01-28 00:37:22,301 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f0a4f0d/6d5a21c3a7f34edd88e610f5056a4324 [2023-01-28 00:37:22,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:37:22,304 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:37:22,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:37:22,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:37:22,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:37:22,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c42ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22, skipping insertion in model container [2023-01-28 00:37:22,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:37:22,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:37:22,471 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/mix016.oepc.i[945,958] [2023-01-28 00:37:22,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:37:22,625 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:37:22,635 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/mix016.oepc.i[945,958] [2023-01-28 00:37:22,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:37:22,700 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:37:22,700 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:37:22,704 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:37:22,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22 WrapperNode [2023-01-28 00:37:22,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:37:22,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:37:22,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:37:22,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:37:22,710 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:37:22" (1/1) ... [2023-01-28 00:37:22,723 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:37:22" (1/1) ... [2023-01-28 00:37:22,738 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-01-28 00:37:22,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:37:22,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:37:22,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:37:22,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:37:22,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,756 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:37:22,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:37:22,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:37:22,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:37:22,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22" (1/1) ... [2023-01-28 00:37:22,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:37:22,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:37:22,782 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:37:22,783 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:37:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:37:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:37:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:37:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:37:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:37:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:37:22,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:37:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:37:22,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:37:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:37:22,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:37:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:37:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:37:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:37:22,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:37:22,806 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:37:22,893 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:37:22,894 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:37:23,164 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:37:23,262 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:37:23,262 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:37:23,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:37:23 BoogieIcfgContainer [2023-01-28 00:37:23,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:37:23,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:37:23,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:37:23,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:37:23,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:37:22" (1/3) ... [2023-01-28 00:37:23,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d475c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:37:23, skipping insertion in model container [2023-01-28 00:37:23,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:37:22" (2/3) ... [2023-01-28 00:37:23,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d475c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:37:23, skipping insertion in model container [2023-01-28 00:37:23,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:37:23" (3/3) ... [2023-01-28 00:37:23,268 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016.oepc.i [2023-01-28 00:37:23,279 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:37:23,279 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:37:23,279 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:37:23,322 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:37:23,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2023-01-28 00:37:23,392 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2023-01-28 00:37:23,392 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:37:23,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-28 00:37:23,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2023-01-28 00:37:23,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2023-01-28 00:37:23,404 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:37:23,420 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2023-01-28 00:37:23,422 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2023-01-28 00:37:23,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2023-01-28 00:37:23,448 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2023-01-28 00:37:23,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:37:23,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-28 00:37:23,450 INFO L119 LiptonReduction]: Number of co-enabled transitions 2008 [2023-01-28 00:37:25,955 INFO L134 LiptonReduction]: Checked pairs total: 6087 [2023-01-28 00:37:25,955 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-01-28 00:37:25,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:37:25,973 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;@6ece483a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:37:25,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:37:25,974 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-28 00:37:25,975 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:37:25,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:25,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:37:25,975 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:37:25,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash 478562, now seen corresponding path program 1 times [2023-01-28 00:37:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:25,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134309039] [2023-01-28 00:37:25,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:26,191 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:37:26,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:26,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134309039] [2023-01-28 00:37:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134309039] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:26,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:26,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:37:26,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931676785] [2023-01-28 00:37:26,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:26,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:37:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:26,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:37:26,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:37:26,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 205 [2023-01-28 00:37:26,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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:37:26,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:26,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 205 [2023-01-28 00:37:26,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:26,434 INFO L130 PetriNetUnfolder]: 1263/2018 cut-off events. [2023-01-28 00:37:26,434 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 00:37:26,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3929 conditions, 2018 events. 1263/2018 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11220 event pairs, 204 based on Foata normal form. 80/1930 useless extension candidates. Maximal degree in co-relation 3918. Up to 1510 conditions per place. [2023-01-28 00:37:26,446 INFO L137 encePairwiseOnDemand]: 201/205 looper letters, 33 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-01-28 00:37:26,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 177 flow [2023-01-28 00:37:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:37:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:37:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-01-28 00:37:26,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2023-01-28 00:37:26,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-01-28 00:37:26,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-01-28 00:37:26,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:26,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-01-28 00:37:26,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:37:26,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:37:26,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:37:26,472 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 333 transitions. [2023-01-28 00:37:26,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 177 flow [2023-01-28 00:37:26,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:37:26,475 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-01-28 00:37:26,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-01-28 00:37:26,479 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-01-28 00:37:26,479 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-01-28 00:37:26,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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:37:26,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:26,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:26,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:37:26,480 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:37:26,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash 168078869, now seen corresponding path program 1 times [2023-01-28 00:37:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039225702] [2023-01-28 00:37:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:26,792 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:37:26,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:26,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039225702] [2023-01-28 00:37:26,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039225702] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:26,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:37:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373469872] [2023-01-28 00:37:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:26,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:37:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:26,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:37:26,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:37:26,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 205 [2023-01-28 00:37:26,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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:37:26,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:26,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 205 [2023-01-28 00:37:26,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:27,112 INFO L130 PetriNetUnfolder]: 1939/2884 cut-off events. [2023-01-28 00:37:27,113 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2023-01-28 00:37:27,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6018 conditions, 2884 events. 1939/2884 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12872 event pairs, 935 based on Foata normal form. 150/3034 useless extension candidates. Maximal degree in co-relation 6008. Up to 2436 conditions per place. [2023-01-28 00:37:27,123 INFO L137 encePairwiseOnDemand]: 199/205 looper letters, 31 selfloop transitions, 4 changer transitions 20/55 dead transitions. [2023-01-28 00:37:27,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 55 transitions, 240 flow [2023-01-28 00:37:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:37:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:37:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-01-28 00:37:27,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4848780487804878 [2023-01-28 00:37:27,125 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-01-28 00:37:27,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-01-28 00:37:27,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:27,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-01-28 00:37:27,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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:37:27,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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:37:27,128 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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:37:27,128 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 497 transitions. [2023-01-28 00:37:27,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 55 transitions, 240 flow [2023-01-28 00:37:27,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 55 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:37:27,130 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 88 flow [2023-01-28 00:37:27,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-01-28 00:37:27,130 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-01-28 00:37:27,131 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 88 flow [2023-01-28 00:37:27,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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:37:27,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:27,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:27,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:37:27,131 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:37:27,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1638374111, now seen corresponding path program 1 times [2023-01-28 00:37:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604326862] [2023-01-28 00:37:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:27,250 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:37:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604326862] [2023-01-28 00:37:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604326862] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:27,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:27,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:37:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479057304] [2023-01-28 00:37:27,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:27,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:37:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:37:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:37:27,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 205 [2023-01-28 00:37:27,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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:37:27,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:27,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 205 [2023-01-28 00:37:27,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:27,491 INFO L130 PetriNetUnfolder]: 1717/2554 cut-off events. [2023-01-28 00:37:27,491 INFO L131 PetriNetUnfolder]: For 1273/1273 co-relation queries the response was YES. [2023-01-28 00:37:27,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6347 conditions, 2554 events. 1717/2554 cut-off events. For 1273/1273 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10931 event pairs, 480 based on Foata normal form. 126/2680 useless extension candidates. Maximal degree in co-relation 6334. Up to 1651 conditions per place. [2023-01-28 00:37:27,500 INFO L137 encePairwiseOnDemand]: 201/205 looper letters, 33 selfloop transitions, 3 changer transitions 22/58 dead transitions. [2023-01-28 00:37:27,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 298 flow [2023-01-28 00:37:27,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:37:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:37:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-01-28 00:37:27,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4848780487804878 [2023-01-28 00:37:27,502 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-01-28 00:37:27,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-01-28 00:37:27,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:27,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-01-28 00:37:27,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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:37:27,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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:37:27,505 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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:37:27,506 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 88 flow. Second operand 5 states and 497 transitions. [2023-01-28 00:37:27,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 298 flow [2023-01-28 00:37:27,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 292 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:37:27,513 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 97 flow [2023-01-28 00:37:27,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-01-28 00:37:27,514 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-01-28 00:37:27,516 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 97 flow [2023-01-28 00:37:27,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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:37:27,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:27,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:27,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:37:27,517 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:37:27,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1150127307, now seen corresponding path program 1 times [2023-01-28 00:37:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:27,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861153356] [2023-01-28 00:37:27,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:27,664 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:37:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:27,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861153356] [2023-01-28 00:37:27,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861153356] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:27,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:37:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568634741] [2023-01-28 00:37:27,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:27,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:37:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:27,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:37:27,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:37:27,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 205 [2023-01-28 00:37:27,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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:37:27,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:27,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 205 [2023-01-28 00:37:27,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:27,769 INFO L130 PetriNetUnfolder]: 545/938 cut-off events. [2023-01-28 00:37:27,769 INFO L131 PetriNetUnfolder]: For 352/362 co-relation queries the response was YES. [2023-01-28 00:37:27,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2280 conditions, 938 events. 545/938 cut-off events. For 352/362 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4240 event pairs, 148 based on Foata normal form. 50/969 useless extension candidates. Maximal degree in co-relation 2264. Up to 723 conditions per place. [2023-01-28 00:37:27,773 INFO L137 encePairwiseOnDemand]: 200/205 looper letters, 30 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-01-28 00:37:27,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 197 flow [2023-01-28 00:37:27,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:37:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:37:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-01-28 00:37:27,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510569105691057 [2023-01-28 00:37:27,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-01-28 00:37:27,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-01-28 00:37:27,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:27,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-01-28 00:37:27,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:37:27,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:37:27,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:37:27,782 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 97 flow. Second operand 3 states and 314 transitions. [2023-01-28 00:37:27,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 197 flow [2023-01-28 00:37:27,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 187 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:37:27,784 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 113 flow [2023-01-28 00:37:27,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-01-28 00:37:27,785 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-01-28 00:37:27,785 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 113 flow [2023-01-28 00:37:27,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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:37:27,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:27,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:27,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:37:27,786 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:37:27,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash -568341882, now seen corresponding path program 1 times [2023-01-28 00:37:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:27,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739295926] [2023-01-28 00:37:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:27,929 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:37:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739295926] [2023-01-28 00:37:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739295926] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:37:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603630938] [2023-01-28 00:37:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:27,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:37:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:37:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:37:27,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 205 [2023-01-28 00:37:27,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 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:37:27,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:27,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 205 [2023-01-28 00:37:27,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:28,008 INFO L130 PetriNetUnfolder]: 234/457 cut-off events. [2023-01-28 00:37:28,008 INFO L131 PetriNetUnfolder]: For 87/92 co-relation queries the response was YES. [2023-01-28 00:37:28,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 457 events. 234/457 cut-off events. For 87/92 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1903 event pairs, 88 based on Foata normal form. 45/491 useless extension candidates. Maximal degree in co-relation 1211. Up to 155 conditions per place. [2023-01-28 00:37:28,010 INFO L137 encePairwiseOnDemand]: 200/205 looper letters, 39 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2023-01-28 00:37:28,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 52 transitions, 263 flow [2023-01-28 00:37:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:37:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:37:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-01-28 00:37:28,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5109756097560976 [2023-01-28 00:37:28,011 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-01-28 00:37:28,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-01-28 00:37:28,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:28,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-01-28 00:37:28,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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:37:28,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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:37:28,014 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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:37:28,014 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 113 flow. Second operand 4 states and 419 transitions. [2023-01-28 00:37:28,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 52 transitions, 263 flow [2023-01-28 00:37:28,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:37:28,015 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 149 flow [2023-01-28 00:37:28,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-01-28 00:37:28,015 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-01-28 00:37:28,016 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 149 flow [2023-01-28 00:37:28,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 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:37:28,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:28,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:28,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:37:28,016 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:37:28,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1478197350, now seen corresponding path program 1 times [2023-01-28 00:37:28,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:28,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385637706] [2023-01-28 00:37:28,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:28,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:28,407 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:37:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385637706] [2023-01-28 00:37:28,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385637706] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:28,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:28,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:37:28,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817218865] [2023-01-28 00:37:28,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:28,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:37:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:28,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:37:28,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:37:28,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 205 [2023-01-28 00:37:28,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 83.71428571428571) internal successors, (586), 7 states have internal predecessors, (586), 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:37:28,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:28,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 205 [2023-01-28 00:37:28,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:28,719 INFO L130 PetriNetUnfolder]: 514/937 cut-off events. [2023-01-28 00:37:28,719 INFO L131 PetriNetUnfolder]: For 1022/1022 co-relation queries the response was YES. [2023-01-28 00:37:28,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 937 events. 514/937 cut-off events. For 1022/1022 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4284 event pairs, 22 based on Foata normal form. 11/948 useless extension candidates. Maximal degree in co-relation 2964. Up to 279 conditions per place. [2023-01-28 00:37:28,723 INFO L137 encePairwiseOnDemand]: 194/205 looper letters, 101 selfloop transitions, 17 changer transitions 29/147 dead transitions. [2023-01-28 00:37:28,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 147 transitions, 961 flow [2023-01-28 00:37:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 00:37:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 00:37:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1012 transitions. [2023-01-28 00:37:28,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2023-01-28 00:37:28,726 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1012 transitions. [2023-01-28 00:37:28,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1012 transitions. [2023-01-28 00:37:28,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:28,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1012 transitions. [2023-01-28 00:37:28,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 92.0) internal successors, (1012), 11 states have internal predecessors, (1012), 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:37:28,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 205.0) internal successors, (2460), 12 states have internal predecessors, (2460), 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:37:28,730 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 205.0) internal successors, (2460), 12 states have internal predecessors, (2460), 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:37:28,730 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 149 flow. Second operand 11 states and 1012 transitions. [2023-01-28 00:37:28,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 147 transitions, 961 flow [2023-01-28 00:37:28,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 147 transitions, 895 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-01-28 00:37:28,733 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 251 flow [2023-01-28 00:37:28,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=251, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-01-28 00:37:28,734 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-01-28 00:37:28,734 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 251 flow [2023-01-28 00:37:28,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.71428571428571) internal successors, (586), 7 states have internal predecessors, (586), 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:37:28,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:28,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:37:28,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:37:28,734 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:37:28,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:28,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1303478318, now seen corresponding path program 2 times [2023-01-28 00:37:28,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:28,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685833579] [2023-01-28 00:37:28,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:28,917 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:37:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685833579] [2023-01-28 00:37:28,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685833579] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:28,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:28,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:37:28,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799244472] [2023-01-28 00:37:28,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:28,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:37:28,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:28,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:37:28,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:37:28,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 205 [2023-01-28 00:37:28,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 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:37:28,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:28,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 205 [2023-01-28 00:37:28,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:29,053 INFO L130 PetriNetUnfolder]: 286/559 cut-off events. [2023-01-28 00:37:29,053 INFO L131 PetriNetUnfolder]: For 700/727 co-relation queries the response was YES. [2023-01-28 00:37:29,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 559 events. 286/559 cut-off events. For 700/727 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2661 event pairs, 78 based on Foata normal form. 39/584 useless extension candidates. Maximal degree in co-relation 1841. Up to 218 conditions per place. [2023-01-28 00:37:29,056 INFO L137 encePairwiseOnDemand]: 200/205 looper letters, 47 selfloop transitions, 10 changer transitions 2/68 dead transitions. [2023-01-28 00:37:29,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 454 flow [2023-01-28 00:37:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:37:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:37:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-01-28 00:37:29,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4995121951219512 [2023-01-28 00:37:29,058 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-01-28 00:37:29,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-01-28 00:37:29,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:29,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-01-28 00:37:29,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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:37:29,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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:37:29,060 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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:37:29,060 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 251 flow. Second operand 5 states and 512 transitions. [2023-01-28 00:37:29,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 454 flow [2023-01-28 00:37:29,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 426 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-01-28 00:37:29,062 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 227 flow [2023-01-28 00:37:29,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-01-28 00:37:29,063 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2023-01-28 00:37:29,063 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 227 flow [2023-01-28 00:37:29,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 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:37:29,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:29,063 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, 1, 1] [2023-01-28 00:37:29,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:37:29,064 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:37:29,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash 111926891, now seen corresponding path program 1 times [2023-01-28 00:37:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:29,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721874476] [2023-01-28 00:37:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:29,242 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:37:29,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721874476] [2023-01-28 00:37:29,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721874476] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:29,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:29,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:37:29,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106109331] [2023-01-28 00:37:29,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:29,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:37:29,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:29,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:37:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:37:29,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 205 [2023-01-28 00:37:29,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 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:37:29,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:29,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 205 [2023-01-28 00:37:29,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:29,407 INFO L130 PetriNetUnfolder]: 532/954 cut-off events. [2023-01-28 00:37:29,407 INFO L131 PetriNetUnfolder]: For 1855/1855 co-relation queries the response was YES. [2023-01-28 00:37:29,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3577 conditions, 954 events. 532/954 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4488 event pairs, 107 based on Foata normal form. 1/955 useless extension candidates. Maximal degree in co-relation 3556. Up to 430 conditions per place. [2023-01-28 00:37:29,410 INFO L137 encePairwiseOnDemand]: 198/205 looper letters, 49 selfloop transitions, 5 changer transitions 39/93 dead transitions. [2023-01-28 00:37:29,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 679 flow [2023-01-28 00:37:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:37:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:37:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2023-01-28 00:37:29,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46550522648083625 [2023-01-28 00:37:29,412 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2023-01-28 00:37:29,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2023-01-28 00:37:29,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:29,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2023-01-28 00:37:29,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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:37:29,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 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:37:29,415 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 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:37:29,415 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 227 flow. Second operand 7 states and 668 transitions. [2023-01-28 00:37:29,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 679 flow [2023-01-28 00:37:29,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 93 transitions, 605 flow, removed 21 selfloop flow, removed 5 redundant places. [2023-01-28 00:37:29,419 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 186 flow [2023-01-28 00:37:29,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2023-01-28 00:37:29,420 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2023-01-28 00:37:29,420 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 186 flow [2023-01-28 00:37:29,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 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:37:29,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:29,420 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, 1, 1] [2023-01-28 00:37:29,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:37:29,420 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:37:29,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:29,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2078110583, now seen corresponding path program 2 times [2023-01-28 00:37:29,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:29,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346789188] [2023-01-28 00:37:29,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:29,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:29,626 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:37:29,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346789188] [2023-01-28 00:37:29,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346789188] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:29,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:29,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:37:29,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754064729] [2023-01-28 00:37:29,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:29,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:37:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:29,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:37:29,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:37:29,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 205 [2023-01-28 00:37:29,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 186 flow. Second operand has 5 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:37:29,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:29,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 205 [2023-01-28 00:37:29,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:29,759 INFO L130 PetriNetUnfolder]: 269/512 cut-off events. [2023-01-28 00:37:29,759 INFO L131 PetriNetUnfolder]: For 673/677 co-relation queries the response was YES. [2023-01-28 00:37:29,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 512 events. 269/512 cut-off events. For 673/677 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2129 event pairs, 70 based on Foata normal form. 4/515 useless extension candidates. Maximal degree in co-relation 1756. Up to 233 conditions per place. [2023-01-28 00:37:29,761 INFO L137 encePairwiseOnDemand]: 201/205 looper letters, 37 selfloop transitions, 1 changer transitions 30/69 dead transitions. [2023-01-28 00:37:29,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 484 flow [2023-01-28 00:37:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:37:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:37:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-01-28 00:37:29,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-01-28 00:37:29,763 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-01-28 00:37:29,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-01-28 00:37:29,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:29,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-01-28 00:37:29,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 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:37:29,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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:37:29,766 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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:37:29,766 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 186 flow. Second operand 5 states and 492 transitions. [2023-01-28 00:37:29,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 484 flow [2023-01-28 00:37:29,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 463 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-01-28 00:37:29,768 INFO L231 Difference]: Finished difference. Result has 56 places, 31 transitions, 146 flow [2023-01-28 00:37:29,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=31} [2023-01-28 00:37:29,769 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2023-01-28 00:37:29,769 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 31 transitions, 146 flow [2023-01-28 00:37:29,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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:37:29,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:29,769 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, 1, 1] [2023-01-28 00:37:29,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:37:29,770 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:37:29,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:29,770 INFO L85 PathProgramCache]: Analyzing trace with hash 656429419, now seen corresponding path program 3 times [2023-01-28 00:37:29,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:29,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410038001] [2023-01-28 00:37:29,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:29,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:37:30,319 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:37:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:37:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410038001] [2023-01-28 00:37:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410038001] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:37:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:37:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:37:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067350656] [2023-01-28 00:37:30,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:37:30,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:37:30,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:37:30,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:37:30,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:37:30,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 205 [2023-01-28 00:37:30,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 31 transitions, 146 flow. Second operand has 8 states, 8 states have (on average 81.875) internal successors, (655), 8 states have internal predecessors, (655), 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:37:30,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:37:30,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 205 [2023-01-28 00:37:30,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:37:30,533 INFO L130 PetriNetUnfolder]: 192/383 cut-off events. [2023-01-28 00:37:30,533 INFO L131 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2023-01-28 00:37:30,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 383 events. 192/383 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1524 event pairs, 20 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1308. Up to 187 conditions per place. [2023-01-28 00:37:30,536 INFO L137 encePairwiseOnDemand]: 196/205 looper letters, 52 selfloop transitions, 6 changer transitions 24/82 dead transitions. [2023-01-28 00:37:30,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 533 flow [2023-01-28 00:37:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:37:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:37:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 776 transitions. [2023-01-28 00:37:30,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4205962059620596 [2023-01-28 00:37:30,538 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 776 transitions. [2023-01-28 00:37:30,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 776 transitions. [2023-01-28 00:37:30,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:37:30,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 776 transitions. [2023-01-28 00:37:30,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 86.22222222222223) internal successors, (776), 9 states have internal predecessors, (776), 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:37:30,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 205.0) internal successors, (2050), 10 states have internal predecessors, (2050), 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:37:30,541 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 205.0) internal successors, (2050), 10 states have internal predecessors, (2050), 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:37:30,541 INFO L175 Difference]: Start difference. First operand has 56 places, 31 transitions, 146 flow. Second operand 9 states and 776 transitions. [2023-01-28 00:37:30,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 533 flow [2023-01-28 00:37:30,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 512 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-01-28 00:37:30,544 INFO L231 Difference]: Finished difference. Result has 57 places, 32 transitions, 160 flow [2023-01-28 00:37:30,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=160, PETRI_PLACES=57, PETRI_TRANSITIONS=32} [2023-01-28 00:37:30,544 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-01-28 00:37:30,545 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 32 transitions, 160 flow [2023-01-28 00:37:30,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.875) internal successors, (655), 8 states have internal predecessors, (655), 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:37:30,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:37:30,545 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, 1, 1] [2023-01-28 00:37:30,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:37:30,545 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:37:30,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:37:30,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1403709043, now seen corresponding path program 4 times [2023-01-28 00:37:30,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:37:30,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555689698] [2023-01-28 00:37:30,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:37:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:37:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:37:30,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:37:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:37:30,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:37:30,647 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:37:30,647 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:37:30,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:37:30,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:37:30,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:37:30,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:37:30,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:37:30,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:37:30,649 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2023-01-28 00:37:30,652 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:37:30,652 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:37:30,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:37:30 BasicIcfg [2023-01-28 00:37:30,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:37:30,689 INFO L158 Benchmark]: Toolchain (without parser) took 8384.52ms. Allocated memory was 480.2MB in the beginning and 692.1MB in the end (delta: 211.8MB). Free memory was 430.5MB in the beginning and 643.1MB in the end (delta: -212.6MB). Peak memory consumption was 397.4MB. Max. memory is 16.0GB. [2023-01-28 00:37:30,689 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 350.2MB. Free memory was 299.1MB in the beginning and 299.0MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:37:30,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.20ms. Allocated memory is still 480.2MB. Free memory was 430.1MB in the beginning and 407.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:37:30,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.30ms. Allocated memory is still 480.2MB. Free memory was 407.1MB in the beginning and 404.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:37:30,689 INFO L158 Benchmark]: Boogie Preprocessor took 19.79ms. Allocated memory is still 480.2MB. Free memory was 404.4MB in the beginning and 402.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:37:30,689 INFO L158 Benchmark]: RCFGBuilder took 504.17ms. Allocated memory is still 480.2MB. Free memory was 402.5MB in the beginning and 440.9MB in the end (delta: -38.5MB). Peak memory consumption was 40.7MB. Max. memory is 16.0GB. [2023-01-28 00:37:30,690 INFO L158 Benchmark]: TraceAbstraction took 7423.36ms. Allocated memory was 480.2MB in the beginning and 692.1MB in the end (delta: 211.8MB). Free memory was 440.9MB in the beginning and 643.1MB in the end (delta: -202.2MB). Peak memory consumption was 407.1MB. Max. memory is 16.0GB. [2023-01-28 00:37:30,690 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 350.2MB. Free memory was 299.1MB in the beginning and 299.0MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 400.20ms. Allocated memory is still 480.2MB. Free memory was 430.1MB in the beginning and 407.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.30ms. Allocated memory is still 480.2MB. Free memory was 407.1MB in the beginning and 404.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.79ms. Allocated memory is still 480.2MB. Free memory was 404.4MB in the beginning and 402.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 504.17ms. Allocated memory is still 480.2MB. Free memory was 402.5MB in the beginning and 440.9MB in the end (delta: -38.5MB). Peak memory consumption was 40.7MB. Max. memory is 16.0GB. * TraceAbstraction took 7423.36ms. Allocated memory was 480.2MB in the beginning and 692.1MB in the end (delta: 211.8MB). Free memory was 440.9MB in the beginning and 643.1MB in the end (delta: -202.2MB). Peak memory consumption was 407.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 116 PlacesBefore, 36 PlacesAfterwards, 108 TransitionsBefore, 27 TransitionsAfterwards, 2008 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 6087 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2780, independent: 2575, independent conditional: 0, independent unconditional: 2575, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1063, independent: 1030, independent conditional: 0, independent unconditional: 1030, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2780, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 1063, unknown conditional: 0, unknown unconditional: 1063] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t409; [L841] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t409, ((void *)0), P0, ((void *)0))=-3, t409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t410; [L843] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t410, ((void *)0), P1, ((void *)0))=-2, t409={5:0}, t410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 0 pthread_t t411; [L845] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t411, ((void *)0), P2, ((void *)0))=-1, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L807] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L808] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L809] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L810] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L812] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EBX = z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L782] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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: 845]: 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: 841]: 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: 843]: 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, 139 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.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1235 IncrementalHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 33 mSDtfsCounter, 1235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=6, 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, 2.0s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 1177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:37:30,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...