./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c --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/weaver/parallel-parallel-sum-1-dsl.wvr.c -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 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 --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 12:45:02,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 12:45:02,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 12:45:02,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 12:45:02,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 12:45:02,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 12:45:03,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 12:45:03,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 12:45:03,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 12:45:03,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 12:45:03,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 12:45:03,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 12:45:03,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 12:45:03,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 12:45:03,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 12:45:03,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 12:45:03,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 12:45:03,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 12:45:03,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 12:45:03,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 12:45:03,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 12:45:03,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 12:45:03,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 12:45:03,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 12:45:03,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 12:45:03,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 12:45:03,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 12:45:03,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 12:45:03,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 12:45:03,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 12:45:03,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 12:45:03,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 12:45:03,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 12:45:03,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 12:45:03,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 12:45:03,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 12:45:03,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 12:45:03,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 12:45:03,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 12:45:03,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 12:45:03,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 12:45:03,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 12:45:03,086 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 12:45:03,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 12:45:03,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 12:45:03,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 12:45:03,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 12:45:03,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 12:45:03,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 12:45:03,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 12:45:03,090 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 12:45:03,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 12:45:03,091 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 12:45:03,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 12:45:03,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 12:45:03,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 12:45:03,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 12:45:03,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 12:45:03,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 12:45:03,092 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 12:45:03,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 12:45:03,092 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 12:45:03,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 12:45:03,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 12:45:03,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 12:45:03,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 12:45:03,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 12:45:03,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 12:45:03,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 12:45:03,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 12:45:03,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 12:45:03,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 12:45:03,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 12:45:03,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 12:45:03,095 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 12:45:03,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 12:45:03,095 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 12:45:03,095 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 -> 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 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 12:45:03,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 12:45:03,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 12:45:03,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 12:45:03,425 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 12:45:03,425 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 12:45:03,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-09-01 12:45:04,630 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 12:45:04,818 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 12:45:04,818 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-09-01 12:45:04,826 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8028ca49a/7ada7cfe6ff94d269e5410a67d82da1e/FLAGb1360c2c2 [2023-09-01 12:45:04,844 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8028ca49a/7ada7cfe6ff94d269e5410a67d82da1e [2023-09-01 12:45:04,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 12:45:04,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 12:45:04,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 12:45:04,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 12:45:04,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 12:45:04,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:45:04" (1/1) ... [2023-09-01 12:45:04,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f74fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:04, skipping insertion in model container [2023-09-01 12:45:04,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:45:04" (1/1) ... [2023-09-01 12:45:04,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 12:45:04,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 12:45:05,088 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-09-01 12:45:05,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 12:45:05,115 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 12:45:05,156 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-09-01 12:45:05,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 12:45:05,173 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 12:45:05,173 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 12:45:05,180 INFO L208 MainTranslator]: Completed translation [2023-09-01 12:45:05,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05 WrapperNode [2023-09-01 12:45:05,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 12:45:05,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 12:45:05,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 12:45:05,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 12:45:05,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,272 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 303 [2023-09-01 12:45:05,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 12:45:05,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 12:45:05,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 12:45:05,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 12:45:05,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,311 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 12:45:05,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 12:45:05,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 12:45:05,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 12:45:05,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (1/1) ... [2023-09-01 12:45:05,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 12:45:05,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:45:05,349 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 12:45:05,368 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 12:45:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 12:45:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 12:45:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 12:45:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 12:45:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 12:45:05,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 12:45:05,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 12:45:05,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 12:45:05,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 12:45:05,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 12:45:05,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-01 12:45:05,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-01 12:45:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 12:45:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-09-01 12:45:05,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-09-01 12:45:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-09-01 12:45:05,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-09-01 12:45:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 12:45:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 12:45:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 12:45:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 12:45:05,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 12:45:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 12:45:05,386 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 12:45:05,577 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 12:45:05,579 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 12:45:06,113 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 12:45:06,290 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 12:45:06,290 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-09-01 12:45:06,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:45:06 BoogieIcfgContainer [2023-09-01 12:45:06,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 12:45:06,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 12:45:06,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 12:45:06,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 12:45:06,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 12:45:04" (1/3) ... [2023-09-01 12:45:06,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b0b6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:45:06, skipping insertion in model container [2023-09-01 12:45:06,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:45:05" (2/3) ... [2023-09-01 12:45:06,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b0b6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:45:06, skipping insertion in model container [2023-09-01 12:45:06,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:45:06" (3/3) ... [2023-09-01 12:45:06,300 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2023-09-01 12:45:06,309 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 12:45:06,317 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 12:45:06,317 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 12:45:06,317 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 12:45:06,420 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-09-01 12:45:06,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 596 flow [2023-09-01 12:45:06,568 INFO L130 PetriNetUnfolder]: 18/234 cut-off events. [2023-09-01 12:45:06,568 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-09-01 12:45:06,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 234 events. 18/234 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 313 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 203. Up to 3 conditions per place. [2023-09-01 12:45:06,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 596 flow [2023-09-01 12:45:06,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 226 transitions, 500 flow [2023-09-01 12:45:06,583 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 12:45:06,602 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 226 transitions, 500 flow [2023-09-01 12:45:06,604 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 226 transitions, 500 flow [2023-09-01 12:45:06,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 226 transitions, 500 flow [2023-09-01 12:45:06,669 INFO L130 PetriNetUnfolder]: 18/226 cut-off events. [2023-09-01 12:45:06,669 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-09-01 12:45:06,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 226 events. 18/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 312 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 203. Up to 3 conditions per place. [2023-09-01 12:45:06,679 INFO L119 LiptonReduction]: Number of co-enabled transitions 7920 [2023-09-01 12:45:12,584 INFO L134 LiptonReduction]: Checked pairs total: 33320 [2023-09-01 12:45:12,585 INFO L136 LiptonReduction]: Total number of compositions: 192 [2023-09-01 12:45:12,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 12:45:12,602 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;@608befc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 12:45:12,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-09-01 12:45:12,614 INFO L130 PetriNetUnfolder]: 9/64 cut-off events. [2023-09-01 12:45:12,614 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-09-01 12:45:12,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:45:12,615 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, 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 12:45:12,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:45:12,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:45:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash -266416520, now seen corresponding path program 1 times [2023-09-01 12:45:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:45:12,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781839399] [2023-09-01 12:45:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:45:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:13,279 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 12:45:13,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:45:13,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781839399] [2023-09-01 12:45:13,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781839399] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:45:13,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:45:13,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 12:45:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558054865] [2023-09-01 12:45:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:45:13,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 12:45:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:45:13,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 12:45:13,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 12:45:13,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 458 [2023-09-01 12:45:13,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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 12:45:13,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:45:13,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 458 [2023-09-01 12:45:13,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:45:16,706 INFO L130 PetriNetUnfolder]: 24447/32779 cut-off events. [2023-09-01 12:45:16,707 INFO L131 PetriNetUnfolder]: For 5201/5216 co-relation queries the response was YES. [2023-09-01 12:45:16,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69555 conditions, 32779 events. 24447/32779 cut-off events. For 5201/5216 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 171485 event pairs, 10465 based on Foata normal form. 4/25142 useless extension candidates. Maximal degree in co-relation 68091. Up to 12303 conditions per place. [2023-09-01 12:45:16,903 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 109 selfloop transitions, 8 changer transitions 1/138 dead transitions. [2023-09-01 12:45:16,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 641 flow [2023-09-01 12:45:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 12:45:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 12:45:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 975 transitions. [2023-09-01 12:45:16,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5322052401746725 [2023-09-01 12:45:16,924 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 975 transitions. [2023-09-01 12:45:16,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 975 transitions. [2023-09-01 12:45:16,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:45:16,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 975 transitions. [2023-09-01 12:45:17,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.75) internal successors, (975), 4 states have internal predecessors, (975), 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 12:45:17,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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 12:45:17,031 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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 12:45:17,033 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 178 flow. Second operand 4 states and 975 transitions. [2023-09-01 12:45:17,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 641 flow [2023-09-01 12:45:17,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 138 transitions, 555 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-09-01 12:45:17,296 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 199 flow [2023-09-01 12:45:17,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2023-09-01 12:45:17,317 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-09-01 12:45:17,318 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 199 flow [2023-09-01 12:45:17,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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 12:45:17,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:45:17,319 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, 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 12:45:17,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 12:45:17,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:45:17,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:45:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash -549139452, now seen corresponding path program 2 times [2023-09-01 12:45:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:45:17,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070861758] [2023-09-01 12:45:17,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:45:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:17,638 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 12:45:17,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:45:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070861758] [2023-09-01 12:45:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070861758] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:45:17,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:45:17,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 12:45:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207856338] [2023-09-01 12:45:17,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:45:17,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 12:45:17,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:45:17,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 12:45:17,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 12:45:17,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 458 [2023-09-01 12:45:17,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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 12:45:17,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:45:17,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 458 [2023-09-01 12:45:17,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:45:21,234 INFO L130 PetriNetUnfolder]: 40211/54287 cut-off events. [2023-09-01 12:45:21,234 INFO L131 PetriNetUnfolder]: For 11968/11968 co-relation queries the response was YES. [2023-09-01 12:45:21,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120541 conditions, 54287 events. 40211/54287 cut-off events. For 11968/11968 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 304734 event pairs, 15979 based on Foata normal form. 1/41699 useless extension candidates. Maximal degree in co-relation 43207. Up to 22845 conditions per place. [2023-09-01 12:45:21,496 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 115 selfloop transitions, 11 changer transitions 1/147 dead transitions. [2023-09-01 12:45:21,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 654 flow [2023-09-01 12:45:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 12:45:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 12:45:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 977 transitions. [2023-09-01 12:45:21,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5332969432314411 [2023-09-01 12:45:21,500 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 977 transitions. [2023-09-01 12:45:21,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 977 transitions. [2023-09-01 12:45:21,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:45:21,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 977 transitions. [2023-09-01 12:45:21,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 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 12:45:21,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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 12:45:21,509 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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 12:45:21,509 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 199 flow. Second operand 4 states and 977 transitions. [2023-09-01 12:45:21,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 654 flow [2023-09-01 12:45:21,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 147 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 12:45:21,517 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 278 flow [2023-09-01 12:45:21,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2023-09-01 12:45:21,518 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2023-09-01 12:45:21,518 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 278 flow [2023-09-01 12:45:21,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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 12:45:21,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:45:21,520 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, 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 12:45:21,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 12:45:21,520 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:45:21,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:45:21,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1731748126, now seen corresponding path program 1 times [2023-09-01 12:45:21,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:45:21,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95267670] [2023-09-01 12:45:21,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:21,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:45:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:45:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95267670] [2023-09-01 12:45:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95267670] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:45:21,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:45:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 12:45:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873416293] [2023-09-01 12:45:21,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:45:21,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 12:45:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:45:21,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 12:45:21,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 12:45:21,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 458 [2023-09-01 12:45:21,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 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 12:45:21,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:45:21,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 458 [2023-09-01 12:45:21,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:45:26,610 INFO L130 PetriNetUnfolder]: 52244/70746 cut-off events. [2023-09-01 12:45:26,611 INFO L131 PetriNetUnfolder]: For 34959/34959 co-relation queries the response was YES. [2023-09-01 12:45:26,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169029 conditions, 70746 events. 52244/70746 cut-off events. For 34959/34959 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 414211 event pairs, 34723 based on Foata normal form. 0/54996 useless extension candidates. Maximal degree in co-relation 71207. Up to 50266 conditions per place. [2023-09-01 12:45:26,911 INFO L137 encePairwiseOnDemand]: 452/458 looper letters, 121 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2023-09-01 12:45:26,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 146 transitions, 753 flow [2023-09-01 12:45:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 12:45:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 12:45:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1157 transitions. [2023-09-01 12:45:26,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505240174672489 [2023-09-01 12:45:26,916 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1157 transitions. [2023-09-01 12:45:26,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1157 transitions. [2023-09-01 12:45:26,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:45:26,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1157 transitions. [2023-09-01 12:45:26,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 231.4) internal successors, (1157), 5 states have internal predecessors, (1157), 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 12:45:26,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 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 12:45:26,924 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 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 12:45:26,924 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 278 flow. Second operand 5 states and 1157 transitions. [2023-09-01 12:45:26,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 146 transitions, 753 flow [2023-09-01 12:45:26,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 146 transitions, 749 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-09-01 12:45:26,950 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 324 flow [2023-09-01 12:45:26,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2023-09-01 12:45:26,951 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2023-09-01 12:45:26,951 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 324 flow [2023-09-01 12:45:26,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 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 12:45:26,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:45:26,952 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, 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 12:45:26,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 12:45:26,952 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:45:26,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:45:26,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1011656969, now seen corresponding path program 1 times [2023-09-01 12:45:26,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:45:26,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599532358] [2023-09-01 12:45:26,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:45:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:45:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599532358] [2023-09-01 12:45:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599532358] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:45:27,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:45:27,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 12:45:27,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263100555] [2023-09-01 12:45:27,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:45:27,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 12:45:27,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:45:27,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 12:45:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 12:45:27,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 458 [2023-09-01 12:45:27,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 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 12:45:27,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:45:27,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 458 [2023-09-01 12:45:27,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:45:31,333 INFO L130 PetriNetUnfolder]: 43919/59576 cut-off events. [2023-09-01 12:45:31,333 INFO L131 PetriNetUnfolder]: For 33750/33750 co-relation queries the response was YES. [2023-09-01 12:45:31,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146471 conditions, 59576 events. 43919/59576 cut-off events. For 33750/33750 co-relation queries the response was YES. Maximal size of possible extension queue 1587. Compared 341974 event pairs, 30832 based on Foata normal form. 0/50903 useless extension candidates. Maximal degree in co-relation 134447. Up to 50266 conditions per place. [2023-09-01 12:45:31,724 INFO L137 encePairwiseOnDemand]: 452/458 looper letters, 58 selfloop transitions, 2 changer transitions 51/131 dead transitions. [2023-09-01 12:45:31,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 677 flow [2023-09-01 12:45:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 12:45:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 12:45:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1148 transitions. [2023-09-01 12:45:31,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013100436681223 [2023-09-01 12:45:31,728 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1148 transitions. [2023-09-01 12:45:31,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1148 transitions. [2023-09-01 12:45:31,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:45:31,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1148 transitions. [2023-09-01 12:45:31,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 229.6) internal successors, (1148), 5 states have internal predecessors, (1148), 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 12:45:31,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 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 12:45:31,737 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 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 12:45:31,737 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 324 flow. Second operand 5 states and 1148 transitions. [2023-09-01 12:45:31,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 677 flow [2023-09-01 12:45:31,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 673 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 12:45:31,757 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 302 flow [2023-09-01 12:45:31,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2023-09-01 12:45:31,758 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2023-09-01 12:45:31,758 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 302 flow [2023-09-01 12:45:31,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 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 12:45:31,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:45:31,759 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, 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, 1] [2023-09-01 12:45:31,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 12:45:31,759 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:45:31,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:45:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1272608977, now seen corresponding path program 1 times [2023-09-01 12:45:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:45:31,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772834269] [2023-09-01 12:45:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:45:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:45:32,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772834269] [2023-09-01 12:45:32,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772834269] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:45:32,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849464622] [2023-09-01 12:45:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:32,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:45:32,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:45:32,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:45:32,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 12:45:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:32,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2023-09-01 12:45:32,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:45:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:32,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:45:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849464622] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:45:32,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:45:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 12:45:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862987487] [2023-09-01 12:45:32,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:45:32,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-01 12:45:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:45:32,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-01 12:45:32,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-09-01 12:45:32,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-09-01 12:45:32,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 302 flow. Second operand has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 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 12:45:32,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:45:32,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-09-01 12:45:32,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:45:38,648 INFO L130 PetriNetUnfolder]: 50674/69621 cut-off events. [2023-09-01 12:45:38,648 INFO L131 PetriNetUnfolder]: For 48114/48114 co-relation queries the response was YES. [2023-09-01 12:45:38,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175548 conditions, 69621 events. 50674/69621 cut-off events. For 48114/48114 co-relation queries the response was YES. Maximal size of possible extension queue 1807. Compared 428541 event pairs, 15551 based on Foata normal form. 3638/69221 useless extension candidates. Maximal degree in co-relation 175527. Up to 28288 conditions per place. [2023-09-01 12:45:38,972 INFO L137 encePairwiseOnDemand]: 450/458 looper letters, 159 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-09-01 12:45:38,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 187 transitions, 1059 flow [2023-09-01 12:45:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:45:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:45:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1593 transitions. [2023-09-01 12:45:38,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968808484092327 [2023-09-01 12:45:38,976 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1593 transitions. [2023-09-01 12:45:38,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1593 transitions. [2023-09-01 12:45:38,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:45:38,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1593 transitions. [2023-09-01 12:45:38,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 227.57142857142858) internal successors, (1593), 7 states have internal predecessors, (1593), 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 12:45:38,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 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 12:45:38,985 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 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 12:45:38,985 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 302 flow. Second operand 7 states and 1593 transitions. [2023-09-01 12:45:38,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 187 transitions, 1059 flow [2023-09-01 12:45:39,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 187 transitions, 1035 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-09-01 12:45:39,016 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 368 flow [2023-09-01 12:45:39,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-09-01 12:45:39,017 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2023-09-01 12:45:39,017 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 368 flow [2023-09-01 12:45:39,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 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 12:45:39,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:45:39,018 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, 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, 1] [2023-09-01 12:45:39,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 12:45:39,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:45:39,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:45:39,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:45:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2079067074, now seen corresponding path program 1 times [2023-09-01 12:45:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:45:39,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133485696] [2023-09-01 12:45:39,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:39,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:45:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:45:39,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133485696] [2023-09-01 12:45:39,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133485696] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:45:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242826387] [2023-09-01 12:45:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:39,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:45:39,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:45:39,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:45:39,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 12:45:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:39,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2023-09-01 12:45:39,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:45:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:39,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:45:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:39,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242826387] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:45:39,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:45:39,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-01 12:45:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577039822] [2023-09-01 12:45:39,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:45:39,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-01 12:45:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:45:39,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-01 12:45:39,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-09-01 12:45:39,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-09-01 12:45:39,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 368 flow. Second operand has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 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 12:45:39,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:45:39,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-09-01 12:45:39,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:45:44,254 INFO L130 PetriNetUnfolder]: 40749/56313 cut-off events. [2023-09-01 12:45:44,255 INFO L131 PetriNetUnfolder]: For 64677/64677 co-relation queries the response was YES. [2023-09-01 12:45:44,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156646 conditions, 56313 events. 40749/56313 cut-off events. For 64677/64677 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 339564 event pairs, 12668 based on Foata normal form. 2458/55154 useless extension candidates. Maximal degree in co-relation 143767. Up to 26698 conditions per place. [2023-09-01 12:45:44,497 INFO L137 encePairwiseOnDemand]: 450/458 looper letters, 100 selfloop transitions, 5 changer transitions 51/176 dead transitions. [2023-09-01 12:45:44,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 176 transitions, 1023 flow [2023-09-01 12:45:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:45:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:45:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1584 transitions. [2023-09-01 12:45:44,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940736119775421 [2023-09-01 12:45:44,501 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1584 transitions. [2023-09-01 12:45:44,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1584 transitions. [2023-09-01 12:45:44,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:45:44,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1584 transitions. [2023-09-01 12:45:44,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 226.28571428571428) internal successors, (1584), 7 states have internal predecessors, (1584), 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 12:45:44,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 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 12:45:44,510 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 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 12:45:44,510 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 368 flow. Second operand 7 states and 1584 transitions. [2023-09-01 12:45:44,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 176 transitions, 1023 flow [2023-09-01 12:45:44,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 176 transitions, 1007 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-09-01 12:45:44,531 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 362 flow [2023-09-01 12:45:44,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2023-09-01 12:45:44,532 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 21 predicate places. [2023-09-01 12:45:44,532 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 362 flow [2023-09-01 12:45:44,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 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 12:45:44,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:45:44,533 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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, 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 12:45:44,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-01 12:45:44,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-09-01 12:45:44,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:45:44,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:45:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash -982059132, now seen corresponding path program 1 times [2023-09-01 12:45:44,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:45:44,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334149993] [2023-09-01 12:45:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:45:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:45,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:45:45,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334149993] [2023-09-01 12:45:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334149993] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:45:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421346361] [2023-09-01 12:45:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:45,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:45:45,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:45:45,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:45:45,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 12:45:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:45,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2023-09-01 12:45:45,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:45:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:45,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:45:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:45,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421346361] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:45:45,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:45:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-09-01 12:45:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836928255] [2023-09-01 12:45:45,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:45:45,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 12:45:45,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:45:45,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 12:45:45,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-09-01 12:45:45,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-09-01 12:45:45,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 362 flow. Second operand has 13 states, 13 states have (on average 213.6153846153846) internal successors, (2777), 13 states have internal predecessors, (2777), 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 12:45:45,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:45:45,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-09-01 12:45:45,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:45:48,556 INFO L130 PetriNetUnfolder]: 28494/38831 cut-off events. [2023-09-01 12:45:48,556 INFO L131 PetriNetUnfolder]: For 64304/64304 co-relation queries the response was YES. [2023-09-01 12:45:48,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122203 conditions, 38831 events. 28494/38831 cut-off events. For 64304/64304 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 213410 event pairs, 15424 based on Foata normal form. 1152/38010 useless extension candidates. Maximal degree in co-relation 122162. Up to 32677 conditions per place. [2023-09-01 12:45:48,752 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 89 selfloop transitions, 7 changer transitions 0/116 dead transitions. [2023-09-01 12:45:48,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 116 transitions, 693 flow [2023-09-01 12:45:48,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 12:45:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 12:45:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1322 transitions. [2023-09-01 12:45:48,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810771470160116 [2023-09-01 12:45:48,755 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1322 transitions. [2023-09-01 12:45:48,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1322 transitions. [2023-09-01 12:45:48,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:45:48,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1322 transitions. [2023-09-01 12:45:48,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.33333333333334) internal successors, (1322), 6 states have internal predecessors, (1322), 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 12:45:48,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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 12:45:48,762 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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 12:45:48,762 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 362 flow. Second operand 6 states and 1322 transitions. [2023-09-01 12:45:48,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 116 transitions, 693 flow [2023-09-01 12:45:48,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 651 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-09-01 12:45:48,785 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 368 flow [2023-09-01 12:45:48,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2023-09-01 12:45:48,785 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 16 predicate places. [2023-09-01 12:45:48,786 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 368 flow [2023-09-01 12:45:48,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 213.6153846153846) internal successors, (2777), 13 states have internal predecessors, (2777), 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 12:45:48,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:45:48,787 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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, 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 12:45:48,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 12:45:48,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:45:48,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:45:48,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:45:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash -140044149, now seen corresponding path program 1 times [2023-09-01 12:45:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:45:48,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257714836] [2023-09-01 12:45:48,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:48,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:45:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:49,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:49,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:45:49,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257714836] [2023-09-01 12:45:49,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257714836] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:45:49,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475669407] [2023-09-01 12:45:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:49,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:45:49,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:45:49,221 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:45:49,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 12:45:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:49,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2023-09-01 12:45:49,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:45:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:49,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:45:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:45:49,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475669407] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 12:45:49,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 12:45:49,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2023-09-01 12:45:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166266377] [2023-09-01 12:45:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:45:49,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 12:45:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:45:49,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 12:45:49,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-09-01 12:45:49,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-09-01 12:45:49,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 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 12:45:49,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:45:49,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-09-01 12:45:49,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:45:52,025 INFO L130 PetriNetUnfolder]: 21901/29265 cut-off events. [2023-09-01 12:45:52,025 INFO L131 PetriNetUnfolder]: For 41498/41498 co-relation queries the response was YES. [2023-09-01 12:45:52,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92241 conditions, 29265 events. 21901/29265 cut-off events. For 41498/41498 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 147207 event pairs, 10095 based on Foata normal form. 816/28638 useless extension candidates. Maximal degree in co-relation 92202. Up to 25062 conditions per place. [2023-09-01 12:45:52,178 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 93 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2023-09-01 12:45:52,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 714 flow [2023-09-01 12:45:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 12:45:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 12:45:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1322 transitions. [2023-09-01 12:45:52,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810771470160116 [2023-09-01 12:45:52,181 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1322 transitions. [2023-09-01 12:45:52,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1322 transitions. [2023-09-01 12:45:52,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:45:52,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1322 transitions. [2023-09-01 12:45:52,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.33333333333334) internal successors, (1322), 6 states have internal predecessors, (1322), 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 12:45:52,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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 12:45:52,188 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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 12:45:52,189 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 368 flow. Second operand 6 states and 1322 transitions. [2023-09-01 12:45:52,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 714 flow [2023-09-01 12:45:52,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 120 transitions, 689 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-09-01 12:45:52,215 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 384 flow [2023-09-01 12:45:52,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2023-09-01 12:45:52,215 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 18 predicate places. [2023-09-01 12:45:52,215 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 384 flow [2023-09-01 12:45:52,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 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 12:45:52,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:45:52,216 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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, 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, 1, 1] [2023-09-01 12:45:52,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-01 12:45:52,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:45:52,423 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:45:52,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:45:52,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1310477910, now seen corresponding path program 1 times [2023-09-01 12:45:52,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:45:52,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228306174] [2023-09-01 12:45:52,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:52,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:45:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 12:45:53,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:45:53,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228306174] [2023-09-01 12:45:53,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228306174] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:45:53,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742377041] [2023-09-01 12:45:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:45:53,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:45:53,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:45:53,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:45:53,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 12:45:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:45:53,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 62 conjunts are in the unsatisfiable core [2023-09-01 12:45:53,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:45:54,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 12:45:54,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 12:45:54,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 12:45:54,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 12:45:54,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 12:45:54,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 12:45:54,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-01 12:45:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 12:45:54,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:45:56,294 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))))) is different from false [2023-09-01 12:45:57,803 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-09-01 12:45:57,899 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-09-01 12:45:58,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 12:45:58,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 146 [2023-09-01 12:45:58,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 122 [2023-09-01 12:45:58,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2023-09-01 12:45:58,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-09-01 12:45:58,260 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 12:45:58,261 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 12:45:58,261 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 12:45:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 12:45:58,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742377041] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:45:58,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:45:58,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2023-09-01 12:45:58,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904234726] [2023-09-01 12:45:58,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:45:58,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-09-01 12:45:58,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:45:58,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-09-01 12:45:58,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=746, Unknown=25, NotChecked=174, Total=1056 [2023-09-01 12:45:58,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 458 [2023-09-01 12:45:58,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 384 flow. Second operand has 33 states, 33 states have (on average 171.15151515151516) internal successors, (5648), 33 states have internal predecessors, (5648), 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 12:45:58,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:45:58,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 458 [2023-09-01 12:45:58,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:46:09,498 INFO L130 PetriNetUnfolder]: 80622/105027 cut-off events. [2023-09-01 12:46:09,499 INFO L131 PetriNetUnfolder]: For 135851/135851 co-relation queries the response was YES. [2023-09-01 12:46:09,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327904 conditions, 105027 events. 80622/105027 cut-off events. For 135851/135851 co-relation queries the response was YES. Maximal size of possible extension queue 2137. Compared 573223 event pairs, 17446 based on Foata normal form. 1/101225 useless extension candidates. Maximal degree in co-relation 327864. Up to 45218 conditions per place. [2023-09-01 12:46:10,041 INFO L137 encePairwiseOnDemand]: 441/458 looper letters, 527 selfloop transitions, 117 changer transitions 1/655 dead transitions. [2023-09-01 12:46:10,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 655 transitions, 3884 flow [2023-09-01 12:46:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-09-01 12:46:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-09-01 12:46:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4427 transitions. [2023-09-01 12:46:10,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4202582115056009 [2023-09-01 12:46:10,051 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4427 transitions. [2023-09-01 12:46:10,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4427 transitions. [2023-09-01 12:46:10,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:46:10,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4427 transitions. [2023-09-01 12:46:10,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 192.47826086956522) internal successors, (4427), 23 states have internal predecessors, (4427), 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 12:46:10,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 458.0) internal successors, (10992), 24 states have internal predecessors, (10992), 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 12:46:10,073 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 458.0) internal successors, (10992), 24 states have internal predecessors, (10992), 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 12:46:10,074 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 384 flow. Second operand 23 states and 4427 transitions. [2023-09-01 12:46:10,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 655 transitions, 3884 flow [2023-09-01 12:46:10,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 655 transitions, 3864 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-09-01 12:46:10,179 INFO L231 Difference]: Finished difference. Result has 125 places, 217 transitions, 1483 flow [2023-09-01 12:46:10,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1483, PETRI_PLACES=125, PETRI_TRANSITIONS=217} [2023-09-01 12:46:10,180 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 50 predicate places. [2023-09-01 12:46:10,180 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 217 transitions, 1483 flow [2023-09-01 12:46:10,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 171.15151515151516) internal successors, (5648), 33 states have internal predecessors, (5648), 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 12:46:10,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:46:10,182 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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, 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, 1, 1] [2023-09-01 12:46:10,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-01 12:46:10,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:46:10,388 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:46:10,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:46:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash 906209572, now seen corresponding path program 2 times [2023-09-01 12:46:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:46:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868617053] [2023-09-01 12:46:10,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:46:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:46:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:46:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 12:46:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:46:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868617053] [2023-09-01 12:46:11,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868617053] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:46:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415394143] [2023-09-01 12:46:11,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 12:46:11,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:46:11,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:46:11,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:46:11,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 12:46:11,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 12:46:11,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:46:11,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 80 conjunts are in the unsatisfiable core [2023-09-01 12:46:11,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:46:11,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-01 12:46:11,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-01 12:46:11,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-01 12:46:11,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-01 12:46:12,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-01 12:46:12,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 12:46:12,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-09-01 12:46:12,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 12:46:12,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-09-01 12:46:12,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 12:46:12,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 12:46:12,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2023-09-01 12:46:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:46:12,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:46:12,869 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse0)) (+ 1 c_~s_2~0))))) is different from false [2023-09-01 12:46:25,170 WARN L222 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:46:40,644 WARN L222 SmtUtils]: Spent 7.30s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:48:40,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 12:48:40,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2023-09-01 12:48:40,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 12:48:40,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 758774 treesize of output 739326 [2023-09-01 12:48:41,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1434 treesize of output 1306 [2023-09-01 12:48:41,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 12:48:41,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1306 treesize of output 1202 [2023-09-01 12:48:41,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1194 treesize of output 1130 [2023-09-01 12:48:41,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 12:48:41,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1130 treesize of output 914 [2023-09-01 12:48:41,160 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 12:48:41,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 439 treesize of output 420 [2023-09-01 12:48:41,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 12:48:41,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 466 treesize of output 419 [2023-09-01 12:48:43,068 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-01 12:48:43,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 1 [2023-09-01 12:48:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:48:47,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415394143] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:48:47,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:48:47,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 19] total 45 [2023-09-01 12:48:47,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459027962] [2023-09-01 12:48:47,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:48:47,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-09-01 12:48:47,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:48:47,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-09-01 12:48:47,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1746, Unknown=108, NotChecked=88, Total=2162 [2023-09-01 12:48:47,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 458 [2023-09-01 12:48:47,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 217 transitions, 1483 flow. Second operand has 47 states, 47 states have (on average 152.2127659574468) internal successors, (7154), 47 states have internal predecessors, (7154), 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 12:48:47,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:48:47,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 458 [2023-09-01 12:48:47,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:49:12,744 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:49:14,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:16,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:18,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:20,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:22,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:24,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:26,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:45,266 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:49:47,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:49,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:51,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:53,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:49:55,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:22,204 WARN L222 SmtUtils]: Spent 20.14s on a formula simplification. DAG size of input: 68 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:50:24,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:26,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:28,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:30,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:32,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:34,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:36,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:38,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:40,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:42,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:44,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:50:56,111 WARN L222 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 93 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:51:04,926 WARN L222 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 96 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:51:20,758 WARN L222 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:51:39,222 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:52:01,623 WARN L222 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:52:04,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:52:06,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:52:08,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:52:10,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:52:13,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:52:15,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:52:17,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:52:19,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:52:34,326 WARN L222 SmtUtils]: Spent 13.46s on a formula simplification. DAG size of input: 73 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:52:47,166 WARN L222 SmtUtils]: Spent 12.30s on a formula simplification. DAG size of input: 104 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:52:55,754 WARN L222 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 93 DAG size of output: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:53:08,620 WARN L222 SmtUtils]: Spent 10.22s on a formula simplification. DAG size of input: 83 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:53:25,759 WARN L222 SmtUtils]: Spent 12.50s on a formula simplification. DAG size of input: 71 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:53:44,436 WARN L222 SmtUtils]: Spent 10.76s on a formula simplification. DAG size of input: 83 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:53:46,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:53:48,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:53:51,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:54:01,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 12:54:01,209 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1 c_~s_2~0)) (.cse5 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (let ((.cse0 (< c_~i_3~0 c_~n_1~0)) (.cse3 (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5))))) (.cse4 (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5)) .cse2)))) (and (<= 1 c_~n_1~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (or .cse0 (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|)))))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t3~0.base|) .cse3 (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (or .cse0 (and .cse3 .cse4)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse4 (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-09-01 12:54:03,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:54:35,202 WARN L222 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:54:38,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:54:41,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:54:43,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:54:45,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:54:47,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:54:49,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:54:51,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:25,351 WARN L222 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 12:55:28,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:30,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:32,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:34,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:36,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:38,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:40,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:42,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:44,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:46,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:48,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:50,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:54,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:55:58,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:02,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:04,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:06,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:08,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:10,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:12,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:16,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:18,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:20,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:22,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:24,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:26,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:28,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:32,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:34,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:38,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:40,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:45,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:49,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:51,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:53,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:56,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:56:59,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:57:01,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:57:02,516 INFO L130 PetriNetUnfolder]: 148995/194169 cut-off events. [2023-09-01 12:57:02,516 INFO L131 PetriNetUnfolder]: For 578569/578867 co-relation queries the response was YES. [2023-09-01 12:57:03,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734582 conditions, 194169 events. 148995/194169 cut-off events. For 578569/578867 co-relation queries the response was YES. Maximal size of possible extension queue 4055. Compared 1147435 event pairs, 18373 based on Foata normal form. 292/186740 useless extension candidates. Maximal degree in co-relation 734530. Up to 94078 conditions per place. [2023-09-01 12:57:04,032 INFO L137 encePairwiseOnDemand]: 423/458 looper letters, 1042 selfloop transitions, 374 changer transitions 31/1457 dead transitions. [2023-09-01 12:57:04,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1457 transitions, 10761 flow [2023-09-01 12:57:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-09-01 12:57:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2023-09-01 12:57:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 9821 transitions. [2023-09-01 12:57:04,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3697108869146213 [2023-09-01 12:57:04,045 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 9821 transitions. [2023-09-01 12:57:04,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 9821 transitions. [2023-09-01 12:57:04,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:57:04,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 9821 transitions. [2023-09-01 12:57:04,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 169.32758620689654) internal successors, (9821), 58 states have internal predecessors, (9821), 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 12:57:04,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 458.0) internal successors, (27022), 59 states have internal predecessors, (27022), 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 12:57:04,097 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 458.0) internal successors, (27022), 59 states have internal predecessors, (27022), 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 12:57:04,098 INFO L175 Difference]: Start difference. First operand has 125 places, 217 transitions, 1483 flow. Second operand 58 states and 9821 transitions. [2023-09-01 12:57:04,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1457 transitions, 10761 flow [2023-09-01 12:57:20,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 1457 transitions, 10668 flow, removed 43 selfloop flow, removed 2 redundant places. [2023-09-01 12:57:20,319 INFO L231 Difference]: Finished difference. Result has 226 places, 576 transitions, 5746 flow [2023-09-01 12:57:20,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=5746, PETRI_PLACES=226, PETRI_TRANSITIONS=576} [2023-09-01 12:57:20,319 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 151 predicate places. [2023-09-01 12:57:20,320 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 576 transitions, 5746 flow [2023-09-01 12:57:20,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 152.2127659574468) internal successors, (7154), 47 states have internal predecessors, (7154), 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 12:57:20,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:57:20,322 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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, 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, 1, 1] [2023-09-01 12:57:20,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-09-01 12:57:20,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:57:20,528 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-09-01 12:57:20,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:57:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash 35489382, now seen corresponding path program 3 times [2023-09-01 12:57:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:57:20,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354756060] [2023-09-01 12:57:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:57:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:57:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:57:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 12:57:22,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:57:22,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354756060] [2023-09-01 12:57:22,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354756060] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:57:22,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291574618] [2023-09-01 12:57:22,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 12:57:22,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:57:22,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:57:22,330 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:57:22,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-01 12:57:22,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 12:57:22,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:57:22,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 68 conjunts are in the unsatisfiable core [2023-09-01 12:57:22,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:57:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 12:57:23,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 12:57:23,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 12:57:23,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 12:57:23,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 12:57:23,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2023-09-01 12:57:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:57:23,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... Killed by 15