/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/mix000.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:32:41,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:32:41,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:32:41,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:32:41,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:32:41,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:32:41,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:32:41,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:32:41,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:32:41,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:32:41,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:32:41,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:32:41,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:32:41,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:32:41,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:32:41,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:32:41,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:32:41,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:32:41,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:32:41,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:32:41,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:32:41,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:32:41,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:32:41,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:32:41,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:32:41,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:32:41,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:32:41,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:32:41,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:32:41,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:32:41,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:32:41,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:32:41,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:32:41,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:32:41,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:32:41,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:32:41,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:32:41,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:32:41,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:32:41,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:32:41,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:32:41,932 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:32:41,952 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:32:41,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:32:41,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:32:41,953 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:32:41,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:32:41,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:32:41,954 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:32:41,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:32:41,955 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:32:41,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:32:41,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:32:41,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:32:41,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:32:41,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:32:41,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:32:41,956 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:32:41,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:32:41,956 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:32:41,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:32:41,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:32:41,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:32:41,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:32:41,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:32:41,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:32:41,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:32:41,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:32:41,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:32:41,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:32:41,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:32:41,957 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:32:41,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:32:41,958 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:32:42,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:32:42,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:32:42,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:32:42,170 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:32:42,170 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:32:42,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2023-01-28 00:32:43,091 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:32:43,319 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:32:43,319 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2023-01-28 00:32:43,327 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2058d5d60/aacb1114d2c04db6a7604146129e05c3/FLAG52ea151ba [2023-01-28 00:32:43,341 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2058d5d60/aacb1114d2c04db6a7604146129e05c3 [2023-01-28 00:32:43,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:32:43,343 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:32:43,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:32:43,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:32:43,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:32:43,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1143dcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43, skipping insertion in model container [2023-01-28 00:32:43,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:32:43,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:32:43,483 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/mix000.oepc.i[988,1001] [2023-01-28 00:32:43,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:32:43,619 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:32:43,626 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/mix000.oepc.i[988,1001] [2023-01-28 00:32:43,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:32:43,692 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:32:43,693 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:32:43,697 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:32:43,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43 WrapperNode [2023-01-28 00:32:43,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:32:43,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:32:43,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:32:43,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:32:43,703 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:32:43" (1/1) ... [2023-01-28 00:32:43,729 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:32:43" (1/1) ... [2023-01-28 00:32:43,757 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-01-28 00:32:43,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:32:43,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:32:43,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:32:43,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:32:43,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,781 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:32:43,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:32:43,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:32:43,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:32:43,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43" (1/1) ... [2023-01-28 00:32:43,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:32:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:32:43,818 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:32:43,835 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:32:43,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:32:43,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:32:43,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:32:43,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:32:43,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:32:43,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:32:43,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:32:43,848 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:32:43,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:32:43,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:32:43,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:32:43,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:32:43,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:32:43,850 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:32:43,951 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:32:43,952 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:32:44,225 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:32:44,331 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:32:44,331 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:32:44,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:32:44 BoogieIcfgContainer [2023-01-28 00:32:44,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:32:44,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:32:44,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:32:44,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:32:44,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:32:43" (1/3) ... [2023-01-28 00:32:44,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52860020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:32:44, skipping insertion in model container [2023-01-28 00:32:44,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:32:43" (2/3) ... [2023-01-28 00:32:44,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52860020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:32:44, skipping insertion in model container [2023-01-28 00:32:44,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:32:44" (3/3) ... [2023-01-28 00:32:44,338 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2023-01-28 00:32:44,348 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:32:44,348 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:32:44,349 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:32:44,393 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:32:44,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2023-01-28 00:32:44,449 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2023-01-28 00:32:44,449 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:32:44,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-01-28 00:32:44,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2023-01-28 00:32:44,458 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2023-01-28 00:32:44,460 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:32:44,469 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2023-01-28 00:32:44,470 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2023-01-28 00:32:44,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2023-01-28 00:32:44,485 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2023-01-28 00:32:44,485 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:32:44,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-01-28 00:32:44,486 INFO L119 LiptonReduction]: Number of co-enabled transitions 1188 [2023-01-28 00:32:46,964 INFO L134 LiptonReduction]: Checked pairs total: 3692 [2023-01-28 00:32:46,965 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-01-28 00:32:46,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:32:46,978 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;@1c236bed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:32:46,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 00:32:46,995 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:32:46,995 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:32:46,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:32:46,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:32:46,997 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:32:47,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:32:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash 447143, now seen corresponding path program 1 times [2023-01-28 00:32:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:32:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061723664] [2023-01-28 00:32:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:32:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:32:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:32:47,270 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:32:47,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:32:47,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061723664] [2023-01-28 00:32:47,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061723664] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:32:47,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:32:47,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:32:47,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328152539] [2023-01-28 00:32:47,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:32:47,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:32:47,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:32:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:32:47,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:32:47,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 175 [2023-01-28 00:32:47,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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:32:47,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:32:47,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 175 [2023-01-28 00:32:47,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:32:47,420 INFO L130 PetriNetUnfolder]: 184/348 cut-off events. [2023-01-28 00:32:47,420 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 00:32:47,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 348 events. 184/348 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1558 event pairs, 16 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 674. Up to 277 conditions per place. [2023-01-28 00:32:47,425 INFO L137 encePairwiseOnDemand]: 171/175 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-01-28 00:32:47,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 117 flow [2023-01-28 00:32:47,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:32:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:32:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2023-01-28 00:32:47,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2023-01-28 00:32:47,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 266 transitions. [2023-01-28 00:32:47,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 266 transitions. [2023-01-28 00:32:47,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:32:47,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 266 transitions. [2023-01-28 00:32:47,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:32:47,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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:32:47,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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:32:47,454 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 266 transitions. [2023-01-28 00:32:47,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 117 flow [2023-01-28 00:32:47,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:32:47,457 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-01-28 00:32:47,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-01-28 00:32:47,462 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-01-28 00:32:47,463 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-01-28 00:32:47,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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:32:47,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:32:47,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:32:47,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:32:47,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:32:47,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:32:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash 669167239, now seen corresponding path program 1 times [2023-01-28 00:32:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:32:47,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626226200] [2023-01-28 00:32:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:32:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:32:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:32:47,748 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:32:47,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:32:47,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626226200] [2023-01-28 00:32:47,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626226200] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:32:47,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:32:47,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:32:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920927893] [2023-01-28 00:32:47,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:32:47,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:32:47,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:32:47,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:32:47,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:32:47,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 175 [2023-01-28 00:32:47,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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:32:47,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:32:47,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 175 [2023-01-28 00:32:47,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:32:47,827 INFO L130 PetriNetUnfolder]: 207/360 cut-off events. [2023-01-28 00:32:47,828 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-01-28 00:32:47,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 360 events. 207/360 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1252 event pairs, 87 based on Foata normal form. 4/364 useless extension candidates. Maximal degree in co-relation 752. Up to 333 conditions per place. [2023-01-28 00:32:47,832 INFO L137 encePairwiseOnDemand]: 171/175 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-01-28 00:32:47,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 112 flow [2023-01-28 00:32:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:32:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:32:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2023-01-28 00:32:47,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-01-28 00:32:47,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 245 transitions. [2023-01-28 00:32:47,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 245 transitions. [2023-01-28 00:32:47,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:32:47,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 245 transitions. [2023-01-28 00:32:47,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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:32:47,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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:32:47,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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:32:47,836 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 3 states and 245 transitions. [2023-01-28 00:32:47,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 112 flow [2023-01-28 00:32:47,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:32:47,837 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 57 flow [2023-01-28 00:32:47,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-01-28 00:32:47,838 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-01-28 00:32:47,838 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 57 flow [2023-01-28 00:32:47,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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:32:47,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:32:47,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:32:47,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:32:47,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:32:47,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:32:47,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1168409010, now seen corresponding path program 1 times [2023-01-28 00:32:47,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:32:47,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907283808] [2023-01-28 00:32:47,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:32:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:32:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:32:48,080 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:32:48,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:32:48,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907283808] [2023-01-28 00:32:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907283808] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:32:48,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:32:48,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:32:48,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527875055] [2023-01-28 00:32:48,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:32:48,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:32:48,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:32:48,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:32:48,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:32:48,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 175 [2023-01-28 00:32:48,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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:32:48,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:32:48,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 175 [2023-01-28 00:32:48,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:32:48,149 INFO L130 PetriNetUnfolder]: 193/338 cut-off events. [2023-01-28 00:32:48,150 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2023-01-28 00:32:48,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 338 events. 193/338 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1120 event pairs, 65 based on Foata normal form. 8/346 useless extension candidates. Maximal degree in co-relation 764. Up to 243 conditions per place. [2023-01-28 00:32:48,153 INFO L137 encePairwiseOnDemand]: 172/175 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-01-28 00:32:48,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 119 flow [2023-01-28 00:32:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:32:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:32:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2023-01-28 00:32:48,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46476190476190476 [2023-01-28 00:32:48,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 244 transitions. [2023-01-28 00:32:48,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 244 transitions. [2023-01-28 00:32:48,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:32:48,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 244 transitions. [2023-01-28 00:32:48,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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:32:48,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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:32:48,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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:32:48,157 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 57 flow. Second operand 3 states and 244 transitions. [2023-01-28 00:32:48,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 25 transitions, 119 flow [2023-01-28 00:32:48,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:32:48,158 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 65 flow [2023-01-28 00:32:48,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-01-28 00:32:48,159 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2023-01-28 00:32:48,161 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 65 flow [2023-01-28 00:32:48,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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:32:48,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:32:48,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:32:48,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:32:48,162 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:32:48,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:32:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1219999730, now seen corresponding path program 1 times [2023-01-28 00:32:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:32:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915386796] [2023-01-28 00:32:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:32:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:32:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:32:48,313 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:32:48,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:32:48,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915386796] [2023-01-28 00:32:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915386796] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:32:48,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:32:48,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:32:48,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541936245] [2023-01-28 00:32:48,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:32:48,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:32:48,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:32:48,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:32:48,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:32:48,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 175 [2023-01-28 00:32:48,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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:32:48,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:32:48,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 175 [2023-01-28 00:32:48,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:32:48,368 INFO L130 PetriNetUnfolder]: 124/235 cut-off events. [2023-01-28 00:32:48,369 INFO L131 PetriNetUnfolder]: For 76/78 co-relation queries the response was YES. [2023-01-28 00:32:48,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 235 events. 124/235 cut-off events. For 76/78 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 812 event pairs, 67 based on Foata normal form. 8/240 useless extension candidates. Maximal degree in co-relation 522. Up to 156 conditions per place. [2023-01-28 00:32:48,370 INFO L137 encePairwiseOnDemand]: 172/175 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-01-28 00:32:48,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 131 flow [2023-01-28 00:32:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:32:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:32:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2023-01-28 00:32:48,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2023-01-28 00:32:48,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 258 transitions. [2023-01-28 00:32:48,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 258 transitions. [2023-01-28 00:32:48,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:32:48,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 258 transitions. [2023-01-28 00:32:48,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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:32:48,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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:32:48,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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:32:48,373 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 65 flow. Second operand 3 states and 258 transitions. [2023-01-28 00:32:48,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 131 flow [2023-01-28 00:32:48,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 125 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:32:48,374 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 70 flow [2023-01-28 00:32:48,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-01-28 00:32:48,374 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-01-28 00:32:48,374 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 70 flow [2023-01-28 00:32:48,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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:32:48,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:32:48,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:32:48,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:32:48,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:32:48,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:32:48,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1059393943, now seen corresponding path program 1 times [2023-01-28 00:32:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:32:48,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654439395] [2023-01-28 00:32:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:32:48,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:32:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:32:48,506 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:32:48,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:32:48,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654439395] [2023-01-28 00:32:48,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654439395] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:32:48,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:32:48,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:32:48,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872831464] [2023-01-28 00:32:48,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:32:48,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:32:48,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:32:48,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:32:48,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:32:48,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 175 [2023-01-28 00:32:48,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 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:32:48,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:32:48,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 175 [2023-01-28 00:32:48,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:32:48,582 INFO L130 PetriNetUnfolder]: 80/175 cut-off events. [2023-01-28 00:32:48,582 INFO L131 PetriNetUnfolder]: For 68/69 co-relation queries the response was YES. [2023-01-28 00:32:48,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 175 events. 80/175 cut-off events. For 68/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 639 event pairs, 16 based on Foata normal form. 28/202 useless extension candidates. Maximal degree in co-relation 423. Up to 66 conditions per place. [2023-01-28 00:32:48,583 INFO L137 encePairwiseOnDemand]: 170/175 looper letters, 23 selfloop transitions, 3 changer transitions 18/47 dead transitions. [2023-01-28 00:32:48,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 236 flow [2023-01-28 00:32:48,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:32:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:32:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2023-01-28 00:32:48,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4617142857142857 [2023-01-28 00:32:48,584 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 404 transitions. [2023-01-28 00:32:48,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 404 transitions. [2023-01-28 00:32:48,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:32:48,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 404 transitions. [2023-01-28 00:32:48,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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:32:48,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 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:32:48,586 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 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:32:48,587 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 70 flow. Second operand 5 states and 404 transitions. [2023-01-28 00:32:48,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 236 flow [2023-01-28 00:32:48,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:32:48,588 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 91 flow [2023-01-28 00:32:48,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2023-01-28 00:32:48,588 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2023-01-28 00:32:48,588 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 91 flow [2023-01-28 00:32:48,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 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:32:48,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:32:48,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:32:48,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:32:48,589 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:32:48,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:32:48,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2007989597, now seen corresponding path program 1 times [2023-01-28 00:32:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:32:48,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704130575] [2023-01-28 00:32:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:32:48,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:32:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:32:48,807 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:32:48,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:32:48,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704130575] [2023-01-28 00:32:48,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704130575] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:32:48,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:32:48,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:32:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031377415] [2023-01-28 00:32:48,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:32:48,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:32:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:32:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:32:48,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:32:48,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 175 [2023-01-28 00:32:48,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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:32:48,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:32:48,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 175 [2023-01-28 00:32:48,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:32:48,881 INFO L130 PetriNetUnfolder]: 32/86 cut-off events. [2023-01-28 00:32:48,881 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-01-28 00:32:48,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 86 events. 32/86 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 237 event pairs, 13 based on Foata normal form. 9/94 useless extension candidates. Maximal degree in co-relation 240. Up to 41 conditions per place. [2023-01-28 00:32:48,882 INFO L137 encePairwiseOnDemand]: 170/175 looper letters, 21 selfloop transitions, 5 changer transitions 9/38 dead transitions. [2023-01-28 00:32:48,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 213 flow [2023-01-28 00:32:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:32:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:32:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions. [2023-01-28 00:32:48,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44571428571428573 [2023-01-28 00:32:48,883 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 468 transitions. [2023-01-28 00:32:48,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 468 transitions. [2023-01-28 00:32:48,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:32:48,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 468 transitions. [2023-01-28 00:32:48,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 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:32:48,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 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:32:48,886 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 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:32:48,886 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 91 flow. Second operand 6 states and 468 transitions. [2023-01-28 00:32:48,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 213 flow [2023-01-28 00:32:48,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 186 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-01-28 00:32:48,889 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 90 flow [2023-01-28 00:32:48,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2023-01-28 00:32:48,890 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2023-01-28 00:32:48,891 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 90 flow [2023-01-28 00:32:48,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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:32:48,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:32:48,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:32:48,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:32:48,891 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:32:48,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:32:48,892 INFO L85 PathProgramCache]: Analyzing trace with hash 358607700, now seen corresponding path program 1 times [2023-01-28 00:32:48,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:32:48,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315985632] [2023-01-28 00:32:48,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:32:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:32:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:32:49,878 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:32:49,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:32:49,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315985632] [2023-01-28 00:32:49,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315985632] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:32:49,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:32:49,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:32:49,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239080495] [2023-01-28 00:32:49,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:32:49,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:32:49,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:32:49,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:32:49,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:32:49,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 175 [2023-01-28 00:32:49,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 72.14285714285714) internal successors, (505), 7 states have internal predecessors, (505), 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:32:49,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:32:49,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 175 [2023-01-28 00:32:49,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:32:50,043 INFO L130 PetriNetUnfolder]: 26/79 cut-off events. [2023-01-28 00:32:50,043 INFO L131 PetriNetUnfolder]: For 60/61 co-relation queries the response was YES. [2023-01-28 00:32:50,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 79 events. 26/79 cut-off events. For 60/61 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 215 event pairs, 0 based on Foata normal form. 2/81 useless extension candidates. Maximal degree in co-relation 216. Up to 25 conditions per place. [2023-01-28 00:32:50,043 INFO L137 encePairwiseOnDemand]: 168/175 looper letters, 26 selfloop transitions, 6 changer transitions 11/46 dead transitions. [2023-01-28 00:32:50,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 277 flow [2023-01-28 00:32:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:32:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:32:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 599 transitions. [2023-01-28 00:32:50,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4278571428571429 [2023-01-28 00:32:50,045 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 599 transitions. [2023-01-28 00:32:50,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 599 transitions. [2023-01-28 00:32:50,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:32:50,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 599 transitions. [2023-01-28 00:32:50,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 74.875) internal successors, (599), 8 states have internal predecessors, (599), 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:32:50,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 175.0) internal successors, (1575), 9 states have internal predecessors, (1575), 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:32:50,049 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 175.0) internal successors, (1575), 9 states have internal predecessors, (1575), 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:32:50,049 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 90 flow. Second operand 8 states and 599 transitions. [2023-01-28 00:32:50,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 277 flow [2023-01-28 00:32:50,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 244 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-01-28 00:32:50,051 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 92 flow [2023-01-28 00:32:50,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-01-28 00:32:50,052 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-01-28 00:32:50,052 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 92 flow [2023-01-28 00:32:50,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.14285714285714) internal successors, (505), 7 states have internal predecessors, (505), 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:32:50,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:32:50,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:32:50,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:32:50,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:32:50,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:32:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash 438946592, now seen corresponding path program 2 times [2023-01-28 00:32:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:32:50,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924883448] [2023-01-28 00:32:50,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:32:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:32:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:32:50,292 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:32:50,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:32:50,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924883448] [2023-01-28 00:32:50,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924883448] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:32:50,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:32:50,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:32:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430846546] [2023-01-28 00:32:50,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:32:50,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:32:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:32:50,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:32:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:32:50,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 175 [2023-01-28 00:32:50,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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:32:50,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:32:50,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 175 [2023-01-28 00:32:50,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:32:50,366 INFO L130 PetriNetUnfolder]: 38/107 cut-off events. [2023-01-28 00:32:50,366 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2023-01-28 00:32:50,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 107 events. 38/107 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 312 event pairs, 5 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 328. Up to 48 conditions per place. [2023-01-28 00:32:50,366 INFO L137 encePairwiseOnDemand]: 169/175 looper letters, 18 selfloop transitions, 3 changer transitions 19/40 dead transitions. [2023-01-28 00:32:50,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 253 flow [2023-01-28 00:32:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:32:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:32:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 463 transitions. [2023-01-28 00:32:50,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44095238095238093 [2023-01-28 00:32:50,368 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 463 transitions. [2023-01-28 00:32:50,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 463 transitions. [2023-01-28 00:32:50,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:32:50,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 463 transitions. [2023-01-28 00:32:50,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 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:32:50,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 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:32:50,387 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 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:32:50,387 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 92 flow. Second operand 6 states and 463 transitions. [2023-01-28 00:32:50,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 253 flow [2023-01-28 00:32:50,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 227 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-01-28 00:32:50,389 INFO L231 Difference]: Finished difference. Result has 36 places, 19 transitions, 81 flow [2023-01-28 00:32:50,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=19} [2023-01-28 00:32:50,389 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2023-01-28 00:32:50,389 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 19 transitions, 81 flow [2023-01-28 00:32:50,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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:32:50,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:32:50,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:32:50,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:32:50,390 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:32:50,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:32:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1743591134, now seen corresponding path program 3 times [2023-01-28 00:32:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:32:50,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036439737] [2023-01-28 00:32:50,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:32:50,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:32:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:32:50,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:32:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:32:50,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:32:50,494 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:32:50,495 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 00:32:50,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 00:32:50,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 00:32:50,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 00:32:50,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 00:32:50,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:32:50,498 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-01-28 00:32:50,502 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:32:50,502 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:32:50,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:32:50 BasicIcfg [2023-01-28 00:32:50,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:32:50,561 INFO L158 Benchmark]: Toolchain (without parser) took 7218.55ms. Allocated memory was 354.4MB in the beginning and 511.7MB in the end (delta: 157.3MB). Free memory was 322.6MB in the beginning and 441.9MB in the end (delta: -119.3MB). Peak memory consumption was 40.3MB. Max. memory is 16.0GB. [2023-01-28 00:32:50,562 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:32:50,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.12ms. Allocated memory is still 354.4MB. Free memory was 322.1MB in the beginning and 298.2MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 00:32:50,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.44ms. Allocated memory is still 354.4MB. Free memory was 298.2MB in the beginning and 295.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:32:50,562 INFO L158 Benchmark]: Boogie Preprocessor took 25.69ms. Allocated memory is still 354.4MB. Free memory was 295.6MB in the beginning and 294.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:32:50,562 INFO L158 Benchmark]: RCFGBuilder took 548.00ms. Allocated memory is still 354.4MB. Free memory was 294.0MB in the beginning and 255.3MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-01-28 00:32:50,562 INFO L158 Benchmark]: TraceAbstraction took 6227.13ms. Allocated memory was 354.4MB in the beginning and 511.7MB in the end (delta: 157.3MB). Free memory was 254.8MB in the beginning and 441.9MB in the end (delta: -187.1MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:32:50,563 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.08ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 354.12ms. Allocated memory is still 354.4MB. Free memory was 322.1MB in the beginning and 298.2MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.44ms. Allocated memory is still 354.4MB. Free memory was 298.2MB in the beginning and 295.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.69ms. Allocated memory is still 354.4MB. Free memory was 295.6MB in the beginning and 294.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 548.00ms. Allocated memory is still 354.4MB. Free memory was 294.0MB in the beginning and 255.3MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 6227.13ms. Allocated memory was 354.4MB in the beginning and 511.7MB in the end (delta: 157.3MB). Free memory was 254.8MB in the beginning and 441.9MB in the end (delta: -187.1MB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 95 PlacesBefore, 26 PlacesAfterwards, 90 TransitionsBefore, 20 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, 3692 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1382, independent: 1209, independent conditional: 0, independent unconditional: 1209, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 694, independent: 651, independent conditional: 0, independent unconditional: 651, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1382, independent: 558, independent conditional: 0, independent unconditional: 558, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 694, unknown conditional: 0, unknown unconditional: 694] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t0; [L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-2, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L833] 0 pthread_t t1; [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=-1, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L787] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 y$flush_delayed = weak$$choice2 [L796] 2 y$mem_tmp = y [L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = y [L805] 2 y = y$flush_delayed ? y$mem_tmp : y [L806] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 405 IncrementalHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 5 mSDtfsCounter, 405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=7, InterpolantAutomatonStates: 37, 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.1s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:32:50,579 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...