/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:29:22,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:29:22,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:29:22,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:29:22,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:29:22,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:29:22,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:29:22,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:29:22,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:29:22,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:29:22,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:29:22,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:29:22,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:29:22,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:29:22,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:29:22,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:29:22,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:29:22,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:29:22,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:29:22,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:29:22,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:29:22,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:29:22,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:29:22,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:29:22,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:29:22,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:29:22,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:29:22,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:29:22,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:29:22,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:29:22,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:29:22,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:29:22,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:29:22,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:29:22,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:29:22,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:29:22,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:29:22,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:29:22,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:29:22,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:29:22,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:29:22,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 10:29:22,453 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:29:22,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:29:22,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:29:22,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:29:22,455 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:29:22,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:29:22,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:29:22,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:29:22,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:29:22,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:29:22,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:29:22,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:29:22,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:29:22,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:29:22,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:29:22,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:29:22,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:29:22,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:29:22,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:29:22,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:29:22,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:29:22,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:29:22,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:29:22,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:29:22,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:29:22,458 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:29:22,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:29:22,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:29:22,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:29:22,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-13 10:29:22,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:29:22,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:29:22,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:29:22,773 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:29:22,775 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:29:22,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2022-12-13 10:29:23,696 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:29:23,717 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-13 10:29:23,900 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:29:23,900 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2022-12-13 10:29:23,909 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7acf9493f/98c16659613843dfa864dcd104225f23/FLAG55aa051af [2022-12-13 10:29:23,919 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7acf9493f/98c16659613843dfa864dcd104225f23 [2022-12-13 10:29:23,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:29:23,921 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:29:23,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:29:23,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:29:23,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:29:23,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:29:23" (1/1) ... [2022-12-13 10:29:23,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b993c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:23, skipping insertion in model container [2022-12-13 10:29:23,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:29:23" (1/1) ... [2022-12-13 10:29:23,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:29:23,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:29:24,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,055 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c[3057,3070] [2022-12-13 10:29:24,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:29:24,080 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:29:24,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:24,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:24,113 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c[3057,3070] [2022-12-13 10:29:24,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:29:24,125 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:29:24,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24 WrapperNode [2022-12-13 10:29:24,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:29:24,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:29:24,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:29:24,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:29:24,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,169 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2022-12-13 10:29:24,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:29:24,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:29:24,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:29:24,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:29:24,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,201 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:29:24,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:29:24,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:29:24,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:29:24,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (1/1) ... [2022-12-13 10:29:24,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:29:24,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:29:24,265 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) [2022-12-13 10:29:24,281 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 [2022-12-13 10:29:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:29:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:29:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:29:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:29:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:29:24,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:29:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:29:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:29:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 10:29:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 10:29:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:29:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:29:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:29:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 10:29:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:29:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:29:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:29:24,308 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:29:24,413 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:29:24,414 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:29:24,691 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:29:24,756 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:29:24,756 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 10:29:24,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:29:24 BoogieIcfgContainer [2022-12-13 10:29:24,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:29:24,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:29:24,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:29:24,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:29:24,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:29:23" (1/3) ... [2022-12-13 10:29:24,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e680f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:29:24, skipping insertion in model container [2022-12-13 10:29:24,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:24" (2/3) ... [2022-12-13 10:29:24,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e680f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:29:24, skipping insertion in model container [2022-12-13 10:29:24,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:29:24" (3/3) ... [2022-12-13 10:29:24,763 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2022-12-13 10:29:24,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:29:24,777 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:29:24,778 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:29:24,846 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 10:29:24,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 162 transitions, 348 flow [2022-12-13 10:29:24,952 INFO L130 PetriNetUnfolder]: 12/159 cut-off events. [2022-12-13 10:29:24,953 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:29:24,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 12/159 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2022-12-13 10:29:24,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 162 transitions, 348 flow [2022-12-13 10:29:24,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 316 flow [2022-12-13 10:29:24,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:24,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 149 transitions, 316 flow [2022-12-13 10:29:24,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 316 flow [2022-12-13 10:29:25,028 INFO L130 PetriNetUnfolder]: 12/149 cut-off events. [2022-12-13 10:29:25,029 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:29:25,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 12/149 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2022-12-13 10:29:25,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 149 transitions, 316 flow [2022-12-13 10:29:25,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 1134 [2022-12-13 10:29:29,676 INFO L241 LiptonReduction]: Total number of compositions: 125 [2022-12-13 10:29:29,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:29:29,708 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@2ccdd89c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:29:29,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 10:29:29,712 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2022-12-13 10:29:29,713 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:29:29,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:29,713 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:29:29,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:29:29,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:29,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1666952016, now seen corresponding path program 1 times [2022-12-13 10:29:29,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:29,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206147649] [2022-12-13 10:29:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:29,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:29:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:30,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206147649] [2022-12-13 10:29:30,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206147649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:30,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:30,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:29:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231247175] [2022-12-13 10:29:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:30,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:29:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:30,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:29:30,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:29:30,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:29:30,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-12-13 10:29:30,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:30,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:29:30,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:30,190 INFO L130 PetriNetUnfolder]: 282/438 cut-off events. [2022-12-13 10:29:30,190 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 10:29:30,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 438 events. 282/438 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1302 event pairs, 173 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 800. Up to 356 conditions per place. [2022-12-13 10:29:30,197 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-13 10:29:30,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 164 flow [2022-12-13 10:29:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:29:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:29:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 10:29:30,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 10:29:30,209 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 4 states and 36 transitions. [2022-12-13 10:29:30,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 164 flow [2022-12-13 10:29:30,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 10:29:30,216 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 68 flow [2022-12-13 10:29:30,217 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2022-12-13 10:29:30,222 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2022-12-13 10:29:30,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:30,225 INFO L89 Accepts]: Start accepts. Operand has 29 places, 25 transitions, 68 flow [2022-12-13 10:29:30,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:30,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:30,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 68 flow [2022-12-13 10:29:30,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 68 flow [2022-12-13 10:29:30,233 INFO L130 PetriNetUnfolder]: 3/25 cut-off events. [2022-12-13 10:29:30,233 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:29:30,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 3/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2022-12-13 10:29:30,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 68 flow [2022-12-13 10:29:30,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-13 10:29:30,258 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:30,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 10:29:30,260 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 68 flow [2022-12-13 10:29:30,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-12-13 10:29:30,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:30,261 INFO L214 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] [2022-12-13 10:29:30,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:29:30,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:29:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash -525137310, now seen corresponding path program 1 times [2022-12-13 10:29:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:30,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469480942] [2022-12-13 10:29:30,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:29:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:30,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469480942] [2022-12-13 10:29:30,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469480942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:30,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:30,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:29:30,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811612447] [2022-12-13 10:29:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:30,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:29:30,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:29:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:29:30,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:29:30,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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) [2022-12-13 10:29:30,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:30,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:29:30,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:30,457 INFO L130 PetriNetUnfolder]: 344/532 cut-off events. [2022-12-13 10:29:30,458 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2022-12-13 10:29:30,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 532 events. 344/532 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1701 event pairs, 221 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 397. Up to 438 conditions per place. [2022-12-13 10:29:30,461 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 34 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-13 10:29:30,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 178 flow [2022-12-13 10:29:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:29:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:29:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 10:29:30,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 10:29:30,462 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 68 flow. Second operand 4 states and 36 transitions. [2022-12-13 10:29:30,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 178 flow [2022-12-13 10:29:30,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 168 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 10:29:30,463 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 76 flow [2022-12-13 10:29:30,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2022-12-13 10:29:30,463 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2022-12-13 10:29:30,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:30,464 INFO L89 Accepts]: Start accepts. Operand has 31 places, 26 transitions, 76 flow [2022-12-13 10:29:30,465 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:30,465 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:30,465 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 26 transitions, 76 flow [2022-12-13 10:29:30,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 26 transitions, 76 flow [2022-12-13 10:29:30,468 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-13 10:29:30,468 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:29:30,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 26 events. 3/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 27. Up to 4 conditions per place. [2022-12-13 10:29:30,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 26 transitions, 76 flow [2022-12-13 10:29:30,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-13 10:29:30,487 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:30,488 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 10:29:30,488 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 76 flow [2022-12-13 10:29:30,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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) [2022-12-13 10:29:30,488 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:30,488 INFO L214 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] [2022-12-13 10:29:30,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:29:30,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:29:30,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash -876665139, now seen corresponding path program 1 times [2022-12-13 10:29:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:30,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101323424] [2022-12-13 10:29:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:29:30,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:30,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101323424] [2022-12-13 10:29:30,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101323424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:30,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:30,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:29:30,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525699741] [2022-12-13 10:29:30,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:30,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:29:30,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:30,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:29:30,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:29:30,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:29:30,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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) [2022-12-13 10:29:30,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:30,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:29:30,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:30,632 INFO L130 PetriNetUnfolder]: 344/533 cut-off events. [2022-12-13 10:29:30,632 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2022-12-13 10:29:30,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 533 events. 344/533 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1616 event pairs, 277 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 469. Up to 533 conditions per place. [2022-12-13 10:29:30,635 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-12-13 10:29:30,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 132 flow [2022-12-13 10:29:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:29:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:29:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 10:29:30,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 10:29:30,636 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 76 flow. Second operand 3 states and 26 transitions. [2022-12-13 10:29:30,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 132 flow [2022-12-13 10:29:30,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 126 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 10:29:30,637 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 82 flow [2022-12-13 10:29:30,637 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2022-12-13 10:29:30,638 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2022-12-13 10:29:30,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:30,638 INFO L89 Accepts]: Start accepts. Operand has 32 places, 27 transitions, 82 flow [2022-12-13 10:29:30,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:30,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:30,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 27 transitions, 82 flow [2022-12-13 10:29:30,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 82 flow [2022-12-13 10:29:30,643 INFO L130 PetriNetUnfolder]: 3/27 cut-off events. [2022-12-13 10:29:30,643 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:29:30,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-12-13 10:29:30,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 82 flow [2022-12-13 10:29:30,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-13 10:29:31,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:29:31,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 936 [2022-12-13 10:29:31,574 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 78 flow [2022-12-13 10:29:31,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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) [2022-12-13 10:29:31,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:31,574 INFO L214 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] [2022-12-13 10:29:31,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:29:31,575 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:29:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash 693898068, now seen corresponding path program 1 times [2022-12-13 10:29:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:31,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839415458] [2022-12-13 10:29:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:29:31,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:31,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839415458] [2022-12-13 10:29:31,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839415458] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:29:31,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038088107] [2022-12-13 10:29:31,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:31,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:29:31,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:29:31,936 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) [2022-12-13 10:29:32,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 10:29:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:32,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 10:29:32,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:29:32,276 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 [2022-12-13 10:29:32,312 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 [2022-12-13 10:29:32,348 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 [2022-12-13 10:29:32,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:29:32,436 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 21 treesize of output 21 [2022-12-13 10:29:32,516 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 [2022-12-13 10:29:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:29:32,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:29:39,094 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:29:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:29:39,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038088107] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:29:39,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:29:39,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 21 [2022-12-13 10:29:39,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482891093] [2022-12-13 10:29:39,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:29:39,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 10:29:39,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:39,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 10:29:39,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=350, Unknown=2, NotChecked=0, Total=462 [2022-12-13 10:29:39,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:29:39,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 78 flow. Second operand has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 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) [2022-12-13 10:29:39,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:39,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:29:39,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:41,266 INFO L130 PetriNetUnfolder]: 996/1577 cut-off events. [2022-12-13 10:29:41,267 INFO L131 PetriNetUnfolder]: For 320/320 co-relation queries the response was YES. [2022-12-13 10:29:41,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 1577 events. 996/1577 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6900 event pairs, 117 based on Foata normal form. 5/1295 useless extension candidates. Maximal degree in co-relation 3935. Up to 385 conditions per place. [2022-12-13 10:29:41,273 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 66 selfloop transitions, 9 changer transitions 146/221 dead transitions. [2022-12-13 10:29:41,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 221 transitions, 1082 flow [2022-12-13 10:29:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 10:29:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 10:29:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 220 transitions. [2022-12-13 10:29:41,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39855072463768115 [2022-12-13 10:29:41,276 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 78 flow. Second operand 23 states and 220 transitions. [2022-12-13 10:29:41,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 221 transitions, 1082 flow [2022-12-13 10:29:41,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 221 transitions, 1074 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 10:29:41,279 INFO L231 Difference]: Finished difference. Result has 70 places, 30 transitions, 189 flow [2022-12-13 10:29:41,280 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=189, PETRI_PLACES=70, PETRI_TRANSITIONS=30} [2022-12-13 10:29:41,280 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2022-12-13 10:29:41,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:41,280 INFO L89 Accepts]: Start accepts. Operand has 70 places, 30 transitions, 189 flow [2022-12-13 10:29:41,281 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:41,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:41,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 30 transitions, 189 flow [2022-12-13 10:29:41,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 30 transitions, 189 flow [2022-12-13 10:29:41,292 INFO L130 PetriNetUnfolder]: 21/86 cut-off events. [2022-12-13 10:29:41,292 INFO L131 PetriNetUnfolder]: For 482/516 co-relation queries the response was YES. [2022-12-13 10:29:41,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 86 events. 21/86 cut-off events. For 482/516 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 267 event pairs, 4 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 315. Up to 27 conditions per place. [2022-12-13 10:29:41,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 30 transitions, 189 flow [2022-12-13 10:29:41,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-13 10:29:41,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] L74-4-->L74-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_113| v_~A~0.base_62) (+ v_~A~0.offset_62 (* 4 v_thread2Thread1of1ForFork2_~i~1_38))))) (let ((.cse0 (< .cse1 v_~max~0_77))) (or (and (= v_~max~0_77 v_~max~0_76) .cse0 (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork2_#t~mem9_22|)) (and (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_76) (not .cse0))))) (< v_thread2Thread1of1ForFork2_~i~1_38 v_~N~0_49) (= (+ v_thread2Thread1of1ForFork2_~i~1_38 1) v_thread2Thread1of1ForFork2_~i~1_37)) InVars {~A~0.base=v_~A~0.base_62, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_38, ~A~0.offset=v_~A~0.offset_62, thread2Thread1of1ForFork2_#t~mem9=|v_thread2Thread1of1ForFork2_#t~mem9_22|, #memory_int=|v_#memory_int_113|, ~max~0=v_~max~0_77, ~N~0=v_~N~0_49} OutVars{~A~0.base=v_~A~0.base_62, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_37, ~A~0.offset=v_~A~0.offset_62, thread2Thread1of1ForFork2_#t~ite10=|v_thread2Thread1of1ForFork2_#t~ite10_13|, thread2Thread1of1ForFork2_#t~post7=|v_thread2Thread1of1ForFork2_#t~post7_19|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_13|, #memory_int=|v_#memory_int_113|, ~max~0=v_~max~0_76, ~N~0=v_~N~0_49} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~ite10, thread2Thread1of1ForFork2_#t~post7, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~mem9, ~max~0] and [436] $Ultimate##0-->L68: Formula: (= (select (select |v_#memory_int_31| v_~A~0.base_20) v_~A~0.offset_20) v_~max~0_18) InVars {#memory_int=|v_#memory_int_31|, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, #memory_int=|v_#memory_int_31|, ~A~0.base=v_~A~0.base_20, ~max~0=v_~max~0_18, ~A~0.offset=v_~A~0.offset_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, ~max~0] [2022-12-13 10:29:41,500 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:29:41,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-13 10:29:41,501 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 28 transitions, 185 flow [2022-12-13 10:29:41,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 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) [2022-12-13 10:29:41,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:41,502 INFO L214 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] [2022-12-13 10:29:41,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 10:29:41,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:29:41,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:29:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2058719388, now seen corresponding path program 1 times [2022-12-13 10:29:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:41,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332242247] [2022-12-13 10:29:41,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:29:41,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:41,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332242247] [2022-12-13 10:29:41,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332242247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:41,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:41,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:29:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218209971] [2022-12-13 10:29:41,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:41,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:29:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:29:41,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:29:41,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:29:41,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 28 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-13 10:29:41,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:41,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:29:41,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:41,925 INFO L130 PetriNetUnfolder]: 305/519 cut-off events. [2022-12-13 10:29:41,925 INFO L131 PetriNetUnfolder]: For 4198/4198 co-relation queries the response was YES. [2022-12-13 10:29:41,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 519 events. 305/519 cut-off events. For 4198/4198 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1762 event pairs, 226 based on Foata normal form. 6/525 useless extension candidates. Maximal degree in co-relation 2565. Up to 488 conditions per place. [2022-12-13 10:29:41,929 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 25 selfloop transitions, 2 changer transitions 17/44 dead transitions. [2022-12-13 10:29:41,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 314 flow [2022-12-13 10:29:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:29:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:29:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-13 10:29:41,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2022-12-13 10:29:41,930 INFO L175 Difference]: Start difference. First operand has 53 places, 28 transitions, 185 flow. Second operand 5 states and 41 transitions. [2022-12-13 10:29:41,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 314 flow [2022-12-13 10:29:41,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 244 flow, removed 33 selfloop flow, removed 15 redundant places. [2022-12-13 10:29:41,936 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 122 flow [2022-12-13 10:29:41,937 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2022-12-13 10:29:41,937 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2022-12-13 10:29:41,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:41,937 INFO L89 Accepts]: Start accepts. Operand has 45 places, 27 transitions, 122 flow [2022-12-13 10:29:41,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:41,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:41,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 27 transitions, 122 flow [2022-12-13 10:29:41,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 122 flow [2022-12-13 10:29:41,944 INFO L130 PetriNetUnfolder]: 17/78 cut-off events. [2022-12-13 10:29:41,944 INFO L131 PetriNetUnfolder]: For 71/77 co-relation queries the response was YES. [2022-12-13 10:29:41,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 78 events. 17/78 cut-off events. For 71/77 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 237 event pairs, 3 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 172. Up to 22 conditions per place. [2022-12-13 10:29:41,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 122 flow [2022-12-13 10:29:41,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 10:29:43,186 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:29:43,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1249 [2022-12-13 10:29:43,186 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 118 flow [2022-12-13 10:29:43,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-13 10:29:43,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:43,187 INFO L214 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] [2022-12-13 10:29:43,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:29:43,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:29:43,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:43,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1250957130, now seen corresponding path program 1 times [2022-12-13 10:29:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:43,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467065120] [2022-12-13 10:29:43,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:43,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:29:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:43,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467065120] [2022-12-13 10:29:43,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467065120] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:29:43,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802143458] [2022-12-13 10:29:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:43,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:29:43,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:29:43,322 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) [2022-12-13 10:29:43,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 10:29:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:43,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 10:29:43,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:29:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:29:43,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:29:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:29:43,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802143458] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:29:43,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:29:43,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:29:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269295115] [2022-12-13 10:29:43,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:29:43,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:29:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:29:43,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:29:43,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:29:43,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 118 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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) [2022-12-13 10:29:43,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:43,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:29:43,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:43,594 INFO L130 PetriNetUnfolder]: 325/533 cut-off events. [2022-12-13 10:29:43,594 INFO L131 PetriNetUnfolder]: For 1065/1065 co-relation queries the response was YES. [2022-12-13 10:29:43,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 533 events. 325/533 cut-off events. For 1065/1065 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1814 event pairs, 148 based on Foata normal form. 32/565 useless extension candidates. Maximal degree in co-relation 1890. Up to 365 conditions per place. [2022-12-13 10:29:43,597 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 41 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2022-12-13 10:29:43,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 292 flow [2022-12-13 10:29:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:29:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:29:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-13 10:29:43,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3652173913043478 [2022-12-13 10:29:43,600 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 118 flow. Second operand 5 states and 42 transitions. [2022-12-13 10:29:43,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 292 flow [2022-12-13 10:29:43,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 266 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 10:29:43,603 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 118 flow [2022-12-13 10:29:43,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-13 10:29:43,605 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2022-12-13 10:29:43,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:43,605 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 118 flow [2022-12-13 10:29:43,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:43,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:43,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 118 flow [2022-12-13 10:29:43,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 118 flow [2022-12-13 10:29:43,614 INFO L130 PetriNetUnfolder]: 23/89 cut-off events. [2022-12-13 10:29:43,615 INFO L131 PetriNetUnfolder]: For 68/74 co-relation queries the response was YES. [2022-12-13 10:29:43,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 89 events. 23/89 cut-off events. For 68/74 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 303 event pairs, 7 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 168. Up to 32 conditions per place. [2022-12-13 10:29:43,615 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 118 flow [2022-12-13 10:29:43,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 10:29:43,623 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:43,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 10:29:43,624 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 118 flow [2022-12-13 10:29:43,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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) [2022-12-13 10:29:43,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:43,624 INFO L214 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] [2022-12-13 10:29:43,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 10:29:43,830 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 [2022-12-13 10:29:43,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:29:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1948877798, now seen corresponding path program 2 times [2022-12-13 10:29:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:43,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215754902] [2022-12-13 10:29:43,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:29:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:44,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215754902] [2022-12-13 10:29:44,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215754902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:29:44,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695979288] [2022-12-13 10:29:44,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:29:44,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:29:44,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:29:44,563 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) [2022-12-13 10:29:44,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 10:29:44,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:29:44,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:29:44,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 10:29:44,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:29:44,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:29:44,796 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 53 treesize of output 45 [2022-12-13 10:29:44,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:29:44,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 33 [2022-12-13 10:29:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:29:45,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:29:49,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:29:49,578 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 136 treesize of output 84 [2022-12-13 10:29:49,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:29:49,585 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 64 treesize of output 56 [2022-12-13 10:29:49,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:29:49,590 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 56 treesize of output 46 [2022-12-13 10:29:49,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 10:29:49,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:29:49,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 1 [2022-12-13 10:29:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:29:49,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695979288] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:29:49,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:29:49,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 24 [2022-12-13 10:29:49,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315612436] [2022-12-13 10:29:49,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:29:49,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 10:29:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:49,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 10:29:49,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=532, Unknown=10, NotChecked=0, Total=650 [2022-12-13 10:29:49,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:29:49,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 118 flow. Second operand has 26 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 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) [2022-12-13 10:29:49,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:49,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:29:49,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:50,835 INFO L130 PetriNetUnfolder]: 497/802 cut-off events. [2022-12-13 10:29:50,835 INFO L131 PetriNetUnfolder]: For 1314/1314 co-relation queries the response was YES. [2022-12-13 10:29:50,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 802 events. 497/802 cut-off events. For 1314/1314 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3099 event pairs, 78 based on Foata normal form. 3/805 useless extension candidates. Maximal degree in co-relation 1075. Up to 291 conditions per place. [2022-12-13 10:29:50,838 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 0 selfloop transitions, 0 changer transitions 133/133 dead transitions. [2022-12-13 10:29:50,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 133 transitions, 794 flow [2022-12-13 10:29:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 10:29:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 10:29:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-12-13 10:29:50,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35054347826086957 [2022-12-13 10:29:50,839 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 118 flow. Second operand 16 states and 129 transitions. [2022-12-13 10:29:50,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 133 transitions, 794 flow [2022-12-13 10:29:50,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 133 transitions, 760 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 10:29:50,842 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2022-12-13 10:29:50,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2022-12-13 10:29:50,842 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2022-12-13 10:29:50,842 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:50,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 0 transitions, 0 flow [2022-12-13 10:29:50,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 10:29:50,843 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 10:29:50,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:29:50,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 10:29:50,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 10:29:50,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 10:29:50,843 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:50,844 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 10:29:50,844 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 10:29:50,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 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) [2022-12-13 10:29:50,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 10:29:50,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 10:29:50,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 10:29:50,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 10:29:50,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 10:29:51,067 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 [2022-12-13 10:29:51,068 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-12-13 10:29:51,071 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:29:51,071 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:29:51,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:29:51 BasicIcfg [2022-12-13 10:29:51,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:29:51,076 INFO L158 Benchmark]: Toolchain (without parser) took 27154.75ms. Allocated memory was 185.6MB in the beginning and 331.4MB in the end (delta: 145.8MB). Free memory was 161.6MB in the beginning and 233.4MB in the end (delta: -71.8MB). Peak memory consumption was 74.5MB. Max. memory is 8.0GB. [2022-12-13 10:29:51,076 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory was 162.2MB in the beginning and 162.2MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 10:29:51,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.74ms. Allocated memory is still 185.6MB. Free memory was 161.1MB in the beginning and 148.0MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 10:29:51,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.38ms. Allocated memory is still 185.6MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:29:51,077 INFO L158 Benchmark]: Boogie Preprocessor took 33.36ms. Allocated memory is still 185.6MB. Free memory was 145.9MB in the beginning and 144.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 10:29:51,077 INFO L158 Benchmark]: RCFGBuilder took 553.49ms. Allocated memory is still 185.6MB. Free memory was 144.3MB in the beginning and 122.8MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-13 10:29:51,077 INFO L158 Benchmark]: TraceAbstraction took 26316.42ms. Allocated memory was 185.6MB in the beginning and 331.4MB in the end (delta: 145.8MB). Free memory was 121.8MB in the beginning and 233.4MB in the end (delta: -111.6MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. [2022-12-13 10:29:51,079 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory was 162.2MB in the beginning and 162.2MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.74ms. Allocated memory is still 185.6MB. Free memory was 161.1MB in the beginning and 148.0MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.38ms. Allocated memory is still 185.6MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.36ms. Allocated memory is still 185.6MB. Free memory was 145.9MB in the beginning and 144.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 553.49ms. Allocated memory is still 185.6MB. Free memory was 144.3MB in the beginning and 122.8MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 26316.42ms. Allocated memory was 185.6MB in the beginning and 331.4MB in the end (delta: 145.8MB). Free memory was 121.8MB in the beginning and 233.4MB in the end (delta: -111.6MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 147 PlacesBefore, 31 PlacesAfterwards, 149 TransitionsBefore, 24 TransitionsAfterwards, 1134 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 88 TrivialYvCompositions, 28 ConcurrentYvCompositions, 9 ChoiceCompositions, 125 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 688, independent: 669, independent conditional: 669, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 639, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 639, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 639, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 688, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 639, unknown conditional: 639, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 665, Positive cache size: 652, Positive conditional cache size: 652, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 14, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 7, Positive conditional cache size: 7, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 15, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 32 PlacesBefore, 31 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 21, Positive conditional cache size: 21, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 56 PlacesBefore, 53 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 42 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 44, Positive conditional cache size: 44, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 44, Positive conditional cache size: 44, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 180 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.2s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 893 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 893 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1440 IncrementalHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 0 mSDtfsCounter, 1440 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=4, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 279 ConstructedInterpolants, 6 QuantifiedInterpolants, 3081 SizeOfPredicates, 38 NumberOfNonLiveVariables, 689 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 12/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 10:29:51,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...