./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:52:32,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:52:32,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:52:32,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:52:32,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:52:32,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:52:32,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:52:32,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:52:32,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:52:32,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:52:32,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:52:32,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:52:32,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:52:32,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:52:32,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:52:32,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:52:32,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:52:32,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:52:32,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:52:32,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:52:32,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:52:32,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:52:32,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:52:32,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:52:32,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:52:32,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:52:32,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:52:32,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:52:32,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:52:32,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:52:32,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:52:32,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:52:32,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:52:32,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:52:32,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:52:32,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:52:32,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:52:32,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:52:32,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:52:32,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:52:32,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:52:32,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:52:32,165 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:52:32,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:52:32,165 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:52:32,166 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:52:32,166 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:52:32,166 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:52:32,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:52:32,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:52:32,167 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:52:32,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:52:32,167 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:52:32,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:52:32,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:52:32,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:52:32,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:52:32,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:52:32,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:52:32,169 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:52:32,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:52:32,169 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:52:32,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:52:32,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:52:32,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:52:32,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:52:32,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:52:32,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:52:32,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:52:32,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:52:32,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:52:32,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:52:32,172 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:52:32,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:52:32,172 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:52:32,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:52:32,173 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:52:32,173 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 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-09-01 09:52:32,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:52:32,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:52:32,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:52:32,588 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:52:32,588 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:52:32,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:52:33,850 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:52:34,124 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:52:34,127 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:52:34,150 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a4b24a4/fbf064f179c24c47926e40b11fa080e2/FLAG42f6e662b [2023-09-01 09:52:34,170 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a4b24a4/fbf064f179c24c47926e40b11fa080e2 [2023-09-01 09:52:34,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:52:34,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:52:34,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:52:34,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:52:34,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:52:34,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34, skipping insertion in model container [2023-09-01 09:52:34,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:52:34,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:52:34,398 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-09-01 09:52:34,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:52:34,620 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:52:34,629 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-09-01 09:52:34,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:52:34,691 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:52:34,691 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:52:34,697 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:52:34,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34 WrapperNode [2023-09-01 09:52:34,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:52:34,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:52:34,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:52:34,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:52:34,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,740 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-09-01 09:52:34,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:52:34,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:52:34,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:52:34,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:52:34,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,771 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:52:34,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:52:34,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:52:34,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:52:34,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (1/1) ... [2023-09-01 09:52:34,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:52:34,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:52:34,819 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-09-01 09:52:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:52:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:52:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:52:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:52:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:52:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:52:34,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:52:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:52:34,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:52:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:52:34,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:52:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:52:34,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:52:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:52:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:52:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:52:34,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:52:34,857 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:52:34,843 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-09-01 09:52:35,024 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:52:35,026 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:52:35,314 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:52:35,587 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:52:35,588 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:52:35,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:35 BoogieIcfgContainer [2023-09-01 09:52:35,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:52:35,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:52:35,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:52:35,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:52:35,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:52:34" (1/3) ... [2023-09-01 09:52:35,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174e2389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:52:35, skipping insertion in model container [2023-09-01 09:52:35,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:34" (2/3) ... [2023-09-01 09:52:35,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174e2389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:52:35, skipping insertion in model container [2023-09-01 09:52:35,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:35" (3/3) ... [2023-09-01 09:52:35,615 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:52:35,622 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:52:35,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:52:35,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:52:35,629 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:52:35,692 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:52:35,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-09-01 09:52:35,767 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-09-01 09:52:35,768 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:35,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:52:35,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-09-01 09:52:35,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-09-01 09:52:35,780 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:52:35,787 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-09-01 09:52:35,790 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-09-01 09:52:35,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-09-01 09:52:35,815 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-09-01 09:52:35,815 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:35,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:52:35,818 INFO L119 LiptonReduction]: Number of co-enabled transitions 3058 [2023-09-01 09:52:39,520 INFO L134 LiptonReduction]: Checked pairs total: 8550 [2023-09-01 09:52:39,520 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-09-01 09:52:39,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:52:39,545 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=true, 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;@196b2f53, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:52:39,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:52:39,549 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-09-01 09:52:39,549 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:39,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:39,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 09:52:39,551 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:39,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash 539820, now seen corresponding path program 1 times [2023-09-01 09:52:39,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:39,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333621823] [2023-09-01 09:52:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:40,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:40,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333621823] [2023-09-01 09:52:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333621823] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:40,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:52:40,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848729929] [2023-09-01 09:52:40,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:40,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:40,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 234 [2023-09-01 09:52:40,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-09-01 09:52:40,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:40,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 234 [2023-09-01 09:52:40,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:41,122 INFO L130 PetriNetUnfolder]: 4903/7118 cut-off events. [2023-09-01 09:52:41,122 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-09-01 09:52:41,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13966 conditions, 7118 events. 4903/7118 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 41812 event pairs, 895 based on Foata normal form. 0/6793 useless extension candidates. Maximal degree in co-relation 13954. Up to 5335 conditions per place. [2023-09-01 09:52:41,175 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-09-01 09:52:41,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 207 flow [2023-09-01 09:52:41,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-09-01 09:52:41,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5470085470085471 [2023-09-01 09:52:41,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-09-01 09:52:41,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-09-01 09:52:41,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:41,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-09-01 09:52:41,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-09-01 09:52:41,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 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-09-01 09:52:41,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 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-09-01 09:52:41,200 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 384 transitions. [2023-09-01 09:52:41,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 207 flow [2023-09-01 09:52:41,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:52:41,206 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-09-01 09:52:41,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-09-01 09:52:41,210 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-09-01 09:52:41,211 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-09-01 09:52:41,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-09-01 09:52:41,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:41,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:41,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:52:41,212 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:41,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1961823611, now seen corresponding path program 1 times [2023-09-01 09:52:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:41,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930775424] [2023-09-01 09:52:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:41,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930775424] [2023-09-01 09:52:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930775424] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:52:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986060905] [2023-09-01 09:52:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:41,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:41,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:41,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:41,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 234 [2023-09-01 09:52:41,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-09-01 09:52:41,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:41,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 234 [2023-09-01 09:52:41,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:43,472 INFO L130 PetriNetUnfolder]: 13646/18640 cut-off events. [2023-09-01 09:52:43,472 INFO L131 PetriNetUnfolder]: For 868/868 co-relation queries the response was YES. [2023-09-01 09:52:43,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38657 conditions, 18640 events. 13646/18640 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 98015 event pairs, 4702 based on Foata normal form. 529/19169 useless extension candidates. Maximal degree in co-relation 38647. Up to 10935 conditions per place. [2023-09-01 09:52:43,581 INFO L137 encePairwiseOnDemand]: 226/234 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-09-01 09:52:43,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2023-09-01 09:52:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-09-01 09:52:43,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5156695156695157 [2023-09-01 09:52:43,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-09-01 09:52:43,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-09-01 09:52:43,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:43,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-09-01 09:52:43,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:43,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 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-09-01 09:52:43,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 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-09-01 09:52:43,589 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 362 transitions. [2023-09-01 09:52:43,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2023-09-01 09:52:43,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:43,591 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2023-09-01 09:52:43,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-09-01 09:52:43,591 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-09-01 09:52:43,592 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2023-09-01 09:52:43,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-09-01 09:52:43,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:43,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:43,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:52:43,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:43,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -686991959, now seen corresponding path program 1 times [2023-09-01 09:52:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:43,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019417601] [2023-09-01 09:52:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:43,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:43,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019417601] [2023-09-01 09:52:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019417601] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:43,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:43,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:52:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252574542] [2023-09-01 09:52:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:43,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:43,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:43,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 234 [2023-09-01 09:52:43,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-09-01 09:52:43,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:43,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 234 [2023-09-01 09:52:43,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:45,445 INFO L130 PetriNetUnfolder]: 11779/16439 cut-off events. [2023-09-01 09:52:45,445 INFO L131 PetriNetUnfolder]: For 5609/5624 co-relation queries the response was YES. [2023-09-01 09:52:45,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39556 conditions, 16439 events. 11779/16439 cut-off events. For 5609/5624 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 90815 event pairs, 2934 based on Foata normal form. 30/16185 useless extension candidates. Maximal degree in co-relation 39544. Up to 14814 conditions per place. [2023-09-01 09:52:45,559 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 39 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-09-01 09:52:45,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 252 flow [2023-09-01 09:52:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-09-01 09:52:45,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2023-09-01 09:52:45,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-09-01 09:52:45,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-09-01 09:52:45,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:45,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-09-01 09:52:45,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-09-01 09:52:45,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 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-09-01 09:52:45,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 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-09-01 09:52:45,566 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 3 states and 369 transitions. [2023-09-01 09:52:45,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 252 flow [2023-09-01 09:52:45,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:45,589 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 143 flow [2023-09-01 09:52:45,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-09-01 09:52:45,590 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2023-09-01 09:52:45,590 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 143 flow [2023-09-01 09:52:45,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-09-01 09:52:45,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:45,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:45,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:52:45,591 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:45,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash -686991339, now seen corresponding path program 1 times [2023-09-01 09:52:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773734457] [2023-09-01 09:52:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:45,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773734457] [2023-09-01 09:52:45,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773734457] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:45,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:45,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:52:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319549538] [2023-09-01 09:52:45,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:45,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:45,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:45,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:45,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:45,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 234 [2023-09-01 09:52:45,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-09-01 09:52:45,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:45,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 234 [2023-09-01 09:52:45,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:47,202 INFO L130 PetriNetUnfolder]: 11428/16131 cut-off events. [2023-09-01 09:52:47,203 INFO L131 PetriNetUnfolder]: For 4620/4719 co-relation queries the response was YES. [2023-09-01 09:52:47,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38360 conditions, 16131 events. 11428/16131 cut-off events. For 4620/4719 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 90559 event pairs, 4472 based on Foata normal form. 75/16104 useless extension candidates. Maximal degree in co-relation 38347. Up to 14758 conditions per place. [2023-09-01 09:52:47,282 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 48 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-09-01 09:52:47,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 320 flow [2023-09-01 09:52:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-09-01 09:52:47,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327635327635327 [2023-09-01 09:52:47,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-09-01 09:52:47,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-09-01 09:52:47,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:47,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-09-01 09:52:47,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-09-01 09:52:47,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 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-09-01 09:52:47,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 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-09-01 09:52:47,293 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 143 flow. Second operand 3 states and 374 transitions. [2023-09-01 09:52:47,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 320 flow [2023-09-01 09:52:47,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:47,297 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 179 flow [2023-09-01 09:52:47,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2023-09-01 09:52:47,298 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-09-01 09:52:47,299 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 179 flow [2023-09-01 09:52:47,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-09-01 09:52:47,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:47,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:47,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:52:47,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:47,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash 178084209, now seen corresponding path program 1 times [2023-09-01 09:52:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:47,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940990374] [2023-09-01 09:52:47,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:47,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940990374] [2023-09-01 09:52:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940990374] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:47,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7868690] [2023-09-01 09:52:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:47,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:47,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:47,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 234 [2023-09-01 09:52:47,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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-09-01 09:52:47,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:47,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 234 [2023-09-01 09:52:47,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:48,596 INFO L130 PetriNetUnfolder]: 8671/12753 cut-off events. [2023-09-01 09:52:48,596 INFO L131 PetriNetUnfolder]: For 6086/6552 co-relation queries the response was YES. [2023-09-01 09:52:48,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31179 conditions, 12753 events. 8671/12753 cut-off events. For 6086/6552 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 77836 event pairs, 1441 based on Foata normal form. 1085/13581 useless extension candidates. Maximal degree in co-relation 31164. Up to 8036 conditions per place. [2023-09-01 09:52:48,649 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 88 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2023-09-01 09:52:48,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 108 transitions, 629 flow [2023-09-01 09:52:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:52:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:52:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-09-01 09:52:48,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188034188034188 [2023-09-01 09:52:48,656 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-09-01 09:52:48,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-09-01 09:52:48,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:48,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-09-01 09:52:48,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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-09-01 09:52:48,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 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-09-01 09:52:48,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 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-09-01 09:52:48,662 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 179 flow. Second operand 5 states and 607 transitions. [2023-09-01 09:52:48,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 108 transitions, 629 flow [2023-09-01 09:52:48,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 108 transitions, 618 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:48,668 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 249 flow [2023-09-01 09:52:48,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2023-09-01 09:52:48,671 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-09-01 09:52:48,672 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 249 flow [2023-09-01 09:52:48,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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-09-01 09:52:48,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:48,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:48,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:52:48,673 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:48,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1719906742, now seen corresponding path program 1 times [2023-09-01 09:52:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:48,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608311951] [2023-09-01 09:52:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:48,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:48,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608311951] [2023-09-01 09:52:48,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608311951] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:48,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:48,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:52:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494357641] [2023-09-01 09:52:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:48,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:48,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:48,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:48,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:48,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 234 [2023-09-01 09:52:48,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-09-01 09:52:48,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:48,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 234 [2023-09-01 09:52:48,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:50,499 INFO L130 PetriNetUnfolder]: 12932/19054 cut-off events. [2023-09-01 09:52:50,499 INFO L131 PetriNetUnfolder]: For 18456/18692 co-relation queries the response was YES. [2023-09-01 09:52:50,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59634 conditions, 19054 events. 12932/19054 cut-off events. For 18456/18692 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 122029 event pairs, 5593 based on Foata normal form. 306/19073 useless extension candidates. Maximal degree in co-relation 59615. Up to 9828 conditions per place. [2023-09-01 09:52:50,606 INFO L137 encePairwiseOnDemand]: 231/234 looper letters, 63 selfloop transitions, 6 changer transitions 7/82 dead transitions. [2023-09-01 09:52:50,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 545 flow [2023-09-01 09:52:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-09-01 09:52:50,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356125356125356 [2023-09-01 09:52:50,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-09-01 09:52:50,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-09-01 09:52:50,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:50,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-09-01 09:52:50,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:50,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 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-09-01 09:52:50,616 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 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-09-01 09:52:50,616 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 249 flow. Second operand 3 states and 376 transitions. [2023-09-01 09:52:50,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 545 flow [2023-09-01 09:52:50,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:50,647 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 252 flow [2023-09-01 09:52:50,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-09-01 09:52:50,650 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-09-01 09:52:50,651 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 252 flow [2023-09-01 09:52:50,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-09-01 09:52:50,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:50,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:50,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:52:50,652 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:50,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:50,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1711837889, now seen corresponding path program 1 times [2023-09-01 09:52:50,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:50,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524548799] [2023-09-01 09:52:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:50,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:50,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:50,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524548799] [2023-09-01 09:52:50,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524548799] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:50,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:50,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:52:50,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999931029] [2023-09-01 09:52:50,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:50,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:52:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:50,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:52:50,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:52:50,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 234 [2023-09-01 09:52:50,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 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-09-01 09:52:50,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:50,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 234 [2023-09-01 09:52:50,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:52,397 INFO L130 PetriNetUnfolder]: 8852/13521 cut-off events. [2023-09-01 09:52:52,398 INFO L131 PetriNetUnfolder]: For 12294/12794 co-relation queries the response was YES. [2023-09-01 09:52:52,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41619 conditions, 13521 events. 8852/13521 cut-off events. For 12294/12794 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 89684 event pairs, 1038 based on Foata normal form. 1026/14280 useless extension candidates. Maximal degree in co-relation 41599. Up to 4562 conditions per place. [2023-09-01 09:52:52,486 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 121 selfloop transitions, 17 changer transitions 3/151 dead transitions. [2023-09-01 09:52:52,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 151 transitions, 1010 flow [2023-09-01 09:52:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:52:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:52:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-09-01 09:52:52,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518925518925519 [2023-09-01 09:52:52,490 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-09-01 09:52:52,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-09-01 09:52:52,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:52,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-09-01 09:52:52,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 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-09-01 09:52:52,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 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-09-01 09:52:52,498 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 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-09-01 09:52:52,498 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 252 flow. Second operand 7 states and 850 transitions. [2023-09-01 09:52:52,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 151 transitions, 1010 flow [2023-09-01 09:52:52,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 151 transitions, 970 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:52,566 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 370 flow [2023-09-01 09:52:52,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2023-09-01 09:52:52,567 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-09-01 09:52:52,568 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 370 flow [2023-09-01 09:52:52,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 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-09-01 09:52:52,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:52,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:52,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:52:52,569 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:52,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:52,569 INFO L85 PathProgramCache]: Analyzing trace with hash -48452008, now seen corresponding path program 1 times [2023-09-01 09:52:52,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:52,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999828742] [2023-09-01 09:52:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:52,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:52,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999828742] [2023-09-01 09:52:52,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999828742] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:52,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:52,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344424425] [2023-09-01 09:52:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:52,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:52,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:52,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 234 [2023-09-01 09:52:52,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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-09-01 09:52:52,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:52,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 234 [2023-09-01 09:52:52,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:54,565 INFO L130 PetriNetUnfolder]: 14108/20836 cut-off events. [2023-09-01 09:52:54,565 INFO L131 PetriNetUnfolder]: For 48428/48428 co-relation queries the response was YES. [2023-09-01 09:52:54,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77307 conditions, 20836 events. 14108/20836 cut-off events. For 48428/48428 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 132367 event pairs, 1167 based on Foata normal form. 75/20911 useless extension candidates. Maximal degree in co-relation 77283. Up to 11625 conditions per place. [2023-09-01 09:52:54,652 INFO L137 encePairwiseOnDemand]: 225/234 looper letters, 99 selfloop transitions, 22 changer transitions 34/155 dead transitions. [2023-09-01 09:52:54,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 155 transitions, 1346 flow [2023-09-01 09:52:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:52:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:52:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-09-01 09:52:54,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068376068376068 [2023-09-01 09:52:54,654 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-09-01 09:52:54,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-09-01 09:52:54,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:54,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-09-01 09:52:54,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 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-09-01 09:52:54,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 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-09-01 09:52:54,659 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 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-09-01 09:52:54,659 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 370 flow. Second operand 5 states and 593 transitions. [2023-09-01 09:52:54,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 155 transitions, 1346 flow [2023-09-01 09:52:55,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 155 transitions, 1182 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-09-01 09:52:55,305 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 448 flow [2023-09-01 09:52:55,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=448, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2023-09-01 09:52:55,306 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-09-01 09:52:55,306 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 448 flow [2023-09-01 09:52:55,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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-09-01 09:52:55,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:55,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:55,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:52:55,307 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:55,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash -305823792, now seen corresponding path program 1 times [2023-09-01 09:52:55,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:55,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190319679] [2023-09-01 09:52:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:55,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:55,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190319679] [2023-09-01 09:52:55,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190319679] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:55,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:55,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:52:55,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097253417] [2023-09-01 09:52:55,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:55,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:52:55,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:55,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:52:55,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:52:55,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 234 [2023-09-01 09:52:55,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 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-09-01 09:52:55,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:55,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 234 [2023-09-01 09:52:55,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:56,379 INFO L130 PetriNetUnfolder]: 4951/7829 cut-off events. [2023-09-01 09:52:56,379 INFO L131 PetriNetUnfolder]: For 16287/16532 co-relation queries the response was YES. [2023-09-01 09:52:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27226 conditions, 7829 events. 4951/7829 cut-off events. For 16287/16532 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 49696 event pairs, 899 based on Foata normal form. 482/8170 useless extension candidates. Maximal degree in co-relation 27199. Up to 2641 conditions per place. [2023-09-01 09:52:56,415 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 114 selfloop transitions, 18 changer transitions 37/185 dead transitions. [2023-09-01 09:52:56,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 185 transitions, 1574 flow [2023-09-01 09:52:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:52:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:52:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-09-01 09:52:56,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207570207570208 [2023-09-01 09:52:56,418 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-09-01 09:52:56,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-09-01 09:52:56,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:56,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-09-01 09:52:56,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 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-09-01 09:52:56,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 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-09-01 09:52:56,423 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 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-09-01 09:52:56,423 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 448 flow. Second operand 7 states and 853 transitions. [2023-09-01 09:52:56,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 185 transitions, 1574 flow [2023-09-01 09:52:56,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 185 transitions, 1536 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-09-01 09:52:56,462 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 572 flow [2023-09-01 09:52:56,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=572, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2023-09-01 09:52:56,463 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-09-01 09:52:56,463 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 572 flow [2023-09-01 09:52:56,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 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-09-01 09:52:56,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:56,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:56,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:52:56,464 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:56,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1373579625, now seen corresponding path program 1 times [2023-09-01 09:52:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819840355] [2023-09-01 09:52:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:57,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:57,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819840355] [2023-09-01 09:52:57,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819840355] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:57,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:57,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:52:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486791565] [2023-09-01 09:52:57,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:57,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:52:57,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:57,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:52:57,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:52:57,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 234 [2023-09-01 09:52:57,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 572 flow. Second operand has 7 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 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-09-01 09:52:57,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:57,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 234 [2023-09-01 09:52:57,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:59,011 INFO L130 PetriNetUnfolder]: 10574/16212 cut-off events. [2023-09-01 09:52:59,011 INFO L131 PetriNetUnfolder]: For 48357/48357 co-relation queries the response was YES. [2023-09-01 09:52:59,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66255 conditions, 16212 events. 10574/16212 cut-off events. For 48357/48357 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 104674 event pairs, 1207 based on Foata normal form. 11/16223 useless extension candidates. Maximal degree in co-relation 66226. Up to 4873 conditions per place. [2023-09-01 09:52:59,091 INFO L137 encePairwiseOnDemand]: 220/234 looper letters, 212 selfloop transitions, 67 changer transitions 69/348 dead transitions. [2023-09-01 09:52:59,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 348 transitions, 3368 flow [2023-09-01 09:52:59,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:52:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:52:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2023-09-01 09:52:59,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085470085470085 [2023-09-01 09:52:59,094 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2023-09-01 09:52:59,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2023-09-01 09:52:59,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:59,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2023-09-01 09:52:59,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 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-09-01 09:52:59,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 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-09-01 09:52:59,100 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 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-09-01 09:52:59,101 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 572 flow. Second operand 9 states and 1071 transitions. [2023-09-01 09:52:59,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 348 transitions, 3368 flow [2023-09-01 09:52:59,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 348 transitions, 2915 flow, removed 184 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:59,675 INFO L231 Difference]: Finished difference. Result has 76 places, 115 transitions, 1100 flow [2023-09-01 09:52:59,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1100, PETRI_PLACES=76, PETRI_TRANSITIONS=115} [2023-09-01 09:52:59,675 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2023-09-01 09:52:59,676 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 115 transitions, 1100 flow [2023-09-01 09:52:59,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 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-09-01 09:52:59,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:59,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:59,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:52:59,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:59,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1167659281, now seen corresponding path program 2 times [2023-09-01 09:52:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:59,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651056046] [2023-09-01 09:52:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:00,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651056046] [2023-09-01 09:53:00,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651056046] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:00,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:00,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:53:00,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980362689] [2023-09-01 09:53:00,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:00,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:53:00,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:00,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:53:00,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:53:00,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 234 [2023-09-01 09:53:00,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 115 transitions, 1100 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 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-09-01 09:53:00,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:00,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 234 [2023-09-01 09:53:00,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:01,763 INFO L130 PetriNetUnfolder]: 9641/15131 cut-off events. [2023-09-01 09:53:01,763 INFO L131 PetriNetUnfolder]: For 52646/52646 co-relation queries the response was YES. [2023-09-01 09:53:01,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69025 conditions, 15131 events. 9641/15131 cut-off events. For 52646/52646 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 100934 event pairs, 1598 based on Foata normal form. 3/15134 useless extension candidates. Maximal degree in co-relation 68990. Up to 6648 conditions per place. [2023-09-01 09:53:01,849 INFO L137 encePairwiseOnDemand]: 220/234 looper letters, 149 selfloop transitions, 80 changer transitions 76/305 dead transitions. [2023-09-01 09:53:01,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 305 transitions, 3033 flow [2023-09-01 09:53:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:53:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:53:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions. [2023-09-01 09:53:01,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018993352326686 [2023-09-01 09:53:01,852 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions. [2023-09-01 09:53:01,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions. [2023-09-01 09:53:01,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:01,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions. [2023-09-01 09:53:01,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 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-09-01 09:53:01,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 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-09-01 09:53:01,858 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 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-09-01 09:53:01,858 INFO L175 Difference]: Start difference. First operand has 76 places, 115 transitions, 1100 flow. Second operand 9 states and 1057 transitions. [2023-09-01 09:53:01,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 305 transitions, 3033 flow [2023-09-01 09:53:02,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 305 transitions, 2972 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-09-01 09:53:02,419 INFO L231 Difference]: Finished difference. Result has 83 places, 127 transitions, 1392 flow [2023-09-01 09:53:02,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1392, PETRI_PLACES=83, PETRI_TRANSITIONS=127} [2023-09-01 09:53:02,421 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2023-09-01 09:53:02,421 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 127 transitions, 1392 flow [2023-09-01 09:53:02,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 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-09-01 09:53:02,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:02,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:02,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:53:02,422 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:53:02,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1773949601, now seen corresponding path program 3 times [2023-09-01 09:53:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:02,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913932671] [2023-09-01 09:53:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:02,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:02,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:02,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913932671] [2023-09-01 09:53:02,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913932671] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:02,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:02,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:53:02,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567930771] [2023-09-01 09:53:02,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:02,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:53:02,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:53:02,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:53:02,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 234 [2023-09-01 09:53:02,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 127 transitions, 1392 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 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-09-01 09:53:02,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:02,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 234 [2023-09-01 09:53:02,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:03,942 INFO L130 PetriNetUnfolder]: 6765/10886 cut-off events. [2023-09-01 09:53:03,942 INFO L131 PetriNetUnfolder]: For 64793/65552 co-relation queries the response was YES. [2023-09-01 09:53:03,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56122 conditions, 10886 events. 6765/10886 cut-off events. For 64793/65552 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 76013 event pairs, 651 based on Foata normal form. 384/11109 useless extension candidates. Maximal degree in co-relation 56088. Up to 4291 conditions per place. [2023-09-01 09:53:03,997 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 102 selfloop transitions, 17 changer transitions 165/303 dead transitions. [2023-09-01 09:53:03,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 303 transitions, 3790 flow [2023-09-01 09:53:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:53:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:53:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 947 transitions. [2023-09-01 09:53:04,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058760683760684 [2023-09-01 09:53:04,000 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 947 transitions. [2023-09-01 09:53:04,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 947 transitions. [2023-09-01 09:53:04,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:04,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 947 transitions. [2023-09-01 09:53:04,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 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-09-01 09:53:04,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 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-09-01 09:53:04,005 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 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-09-01 09:53:04,005 INFO L175 Difference]: Start difference. First operand has 83 places, 127 transitions, 1392 flow. Second operand 8 states and 947 transitions. [2023-09-01 09:53:04,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 303 transitions, 3790 flow [2023-09-01 09:53:04,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 303 transitions, 3498 flow, removed 81 selfloop flow, removed 5 redundant places. [2023-09-01 09:53:04,639 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 779 flow [2023-09-01 09:53:04,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=779, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2023-09-01 09:53:04,640 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2023-09-01 09:53:04,640 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 779 flow [2023-09-01 09:53:04,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 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-09-01 09:53:04,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:04,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:04,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:53:04,641 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:53:04,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1068648198, now seen corresponding path program 1 times [2023-09-01 09:53:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:04,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692340022] [2023-09-01 09:53:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:04,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:53:04,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:53:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:53:04,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:53:04,760 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:53:04,761 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:53:04,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:53:04,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:53:04,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:53:04,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:53:04,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:53:04,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:53:04,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:53:04,764 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:04,769 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:53:04,769 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:53:04,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:53:04 BasicIcfg [2023-09-01 09:53:04,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:53:04,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:53:04,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:53:04,833 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:53:04,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:35" (3/4) ... [2023-09-01 09:53:04,835 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:53:04,936 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:53:04,937 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:53:04,937 INFO L158 Benchmark]: Toolchain (without parser) took 30763.91ms. Allocated memory was 77.6MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 50.4MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-09-01 09:53:04,938 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:53:04,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.45ms. Allocated memory is still 77.6MB. Free memory was 50.2MB in the beginning and 45.3MB in the end (delta: 4.9MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2023-09-01 09:53:04,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.71ms. Allocated memory is still 77.6MB. Free memory was 45.3MB in the beginning and 42.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:53:04,938 INFO L158 Benchmark]: Boogie Preprocessor took 36.68ms. Allocated memory is still 77.6MB. Free memory was 42.8MB in the beginning and 40.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:53:04,939 INFO L158 Benchmark]: RCFGBuilder took 801.40ms. Allocated memory is still 77.6MB. Free memory was 40.7MB in the beginning and 27.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 09:53:04,939 INFO L158 Benchmark]: TraceAbstraction took 29221.30ms. Allocated memory was 77.6MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 54.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-09-01 09:53:04,939 INFO L158 Benchmark]: Witness Printer took 107.62ms. Allocated memory is still 4.1GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 09:53:04,943 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.45ms. Allocated memory is still 77.6MB. Free memory was 50.2MB in the beginning and 45.3MB in the end (delta: 4.9MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.71ms. Allocated memory is still 77.6MB. Free memory was 45.3MB in the beginning and 42.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.68ms. Allocated memory is still 77.6MB. Free memory was 42.8MB in the beginning and 40.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 801.40ms. Allocated memory is still 77.6MB. Free memory was 40.7MB in the beginning and 27.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29221.30ms. Allocated memory was 77.6MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 54.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 107.62ms. Allocated memory is still 4.1GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 135 PlacesBefore, 42 PlacesAfterwards, 124 TransitionsBefore, 30 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 8550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3117, independent: 2883, independent conditional: 0, independent unconditional: 2883, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1643, independent: 1595, independent conditional: 0, independent unconditional: 1595, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3117, independent: 1288, independent conditional: 0, independent unconditional: 1288, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 1643, unknown conditional: 0, unknown unconditional: 1643] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-2, t1457={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L861] 0 pthread_t t1458; [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=-1, t1457={5:0}, t1458={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L863] 0 pthread_t t1459; [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L865] 0 pthread_t t1460; [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=1, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 862]: 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: 866]: 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: 864]: 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 9 procedures, 164 locations, 7 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: 29.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 709 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1841 IncrementalHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 65 mSDtfsCounter, 1841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1392occurred in iteration=11, InterpolantAutomatonStates: 65, 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.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-09-01 09:53:04,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE