./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22a326532494b0b5126a81d8882f3e958ed0a5a46e6da0f77df1a4da18ba846 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 12:28:31,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 12:28:31,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 12:28:31,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 12:28:31,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 12:28:31,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 12:28:31,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 12:28:31,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 12:28:31,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 12:28:31,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 12:28:31,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 12:28:31,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 12:28:31,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 12:28:31,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 12:28:31,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 12:28:31,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 12:28:31,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 12:28:31,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 12:28:31,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 12:28:31,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 12:28:31,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 12:28:31,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 12:28:31,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 12:28:31,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 12:28:31,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 12:28:31,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 12:28:31,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 12:28:31,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 12:28:31,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 12:28:31,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 12:28:31,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 12:28:31,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 12:28:31,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 12:28:31,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 12:28:31,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 12:28:31,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 12:28:31,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 12:28:31,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 12:28:31,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 12:28:31,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 12:28:31,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 12:28:31,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 12:28:31,897 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 12:28:31,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 12:28:31,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 12:28:31,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 12:28:31,900 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 12:28:31,900 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 12:28:31,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 12:28:31,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 12:28:31,902 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 12:28:31,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 12:28:31,903 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 12:28:31,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 12:28:31,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 12:28:31,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 12:28:31,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 12:28:31,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 12:28:31,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 12:28:31,904 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 12:28:31,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 12:28:31,905 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 12:28:31,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 12:28:31,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 12:28:31,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 12:28:31,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 12:28:31,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 12:28:31,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 12:28:31,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 12:28:31,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 12:28:31,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 12:28:31,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 12:28:31,907 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 12:28:31,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 12:28:31,907 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 12:28:31,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 12:28:31,908 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 12:28:31,908 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c22a326532494b0b5126a81d8882f3e958ed0a5a46e6da0f77df1a4da18ba846 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 12:28:32,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 12:28:32,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 12:28:32,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 12:28:32,260 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 12:28:32,260 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 12:28:32,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-09-01 12:28:33,397 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 12:28:33,579 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 12:28:33,579 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-09-01 12:28:33,585 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789482c39/e1c86fec9e0045ea861dec64f66e5d7e/FLAG30e855360 [2023-09-01 12:28:33,595 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789482c39/e1c86fec9e0045ea861dec64f66e5d7e [2023-09-01 12:28:33,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 12:28:33,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 12:28:33,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 12:28:33,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 12:28:33,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 12:28:33,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac98d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33, skipping insertion in model container [2023-09-01 12:28:33,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 12:28:33,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 12:28:33,807 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2116,2129] [2023-09-01 12:28:33,818 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 12:28:33,829 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 12:28:33,865 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2116,2129] [2023-09-01 12:28:33,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 12:28:33,884 INFO L208 MainTranslator]: Completed translation [2023-09-01 12:28:33,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33 WrapperNode [2023-09-01 12:28:33,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 12:28:33,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 12:28:33,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 12:28:33,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 12:28:33,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,931 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2023-09-01 12:28:33,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 12:28:33,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 12:28:33,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 12:28:33,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 12:28:33,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,967 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 12:28:33,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 12:28:33,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 12:28:33,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 12:28:33,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (1/1) ... [2023-09-01 12:28:33,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 12:28:33,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:28:34,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 12:28:34,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 12:28:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 12:28:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 12:28:34,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 12:28:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 12:28:34,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 12:28:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 12:28:34,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 12:28:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 12:28:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 12:28:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 12:28:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 12:28:34,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 12:28:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 12:28:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 12:28:34,042 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 12:28:34,156 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 12:28:34,158 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 12:28:34,375 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 12:28:34,381 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 12:28:34,381 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-01 12:28:34,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:28:34 BoogieIcfgContainer [2023-09-01 12:28:34,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 12:28:34,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 12:28:34,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 12:28:34,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 12:28:34,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 12:28:33" (1/3) ... [2023-09-01 12:28:34,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be9dbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:28:34, skipping insertion in model container [2023-09-01 12:28:34,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:28:33" (2/3) ... [2023-09-01 12:28:34,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be9dbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:28:34, skipping insertion in model container [2023-09-01 12:28:34,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:28:34" (3/3) ... [2023-09-01 12:28:34,389 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2023-09-01 12:28:34,396 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 12:28:34,403 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 12:28:34,404 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 12:28:34,404 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 12:28:34,496 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-01 12:28:34,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 105 transitions, 234 flow [2023-09-01 12:28:34,574 INFO L130 PetriNetUnfolder]: 7/102 cut-off events. [2023-09-01 12:28:34,575 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 12:28:34,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 7/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-09-01 12:28:34,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 105 transitions, 234 flow [2023-09-01 12:28:34,583 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 92 transitions, 202 flow [2023-09-01 12:28:34,585 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 12:28:34,592 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 92 transitions, 202 flow [2023-09-01 12:28:34,594 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 92 transitions, 202 flow [2023-09-01 12:28:34,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 92 transitions, 202 flow [2023-09-01 12:28:34,636 INFO L130 PetriNetUnfolder]: 7/92 cut-off events. [2023-09-01 12:28:34,636 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 12:28:34,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 7/92 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-09-01 12:28:34,638 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2023-09-01 12:28:37,040 INFO L134 LiptonReduction]: Checked pairs total: 1314 [2023-09-01 12:28:37,040 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-09-01 12:28:37,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 12:28:37,067 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ef52b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 12:28:37,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-09-01 12:28:37,074 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2023-09-01 12:28:37,074 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 12:28:37,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:28:37,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:28:37,075 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)] === [2023-09-01 12:28:37,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:28:37,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1681500982, now seen corresponding path program 1 times [2023-09-01 12:28:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:28:37,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10560933] [2023-09-01 12:28:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:28:37,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:28:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:28:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:28:37,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:28:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10560933] [2023-09-01 12:28:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10560933] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:28:37,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:28:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 12:28:37,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021446306] [2023-09-01 12:28:37,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:28:37,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 12:28:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:28:37,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 12:28:37,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 12:28:37,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 183 [2023-09-01 12:28:37,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:37,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:28:37,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 183 [2023-09-01 12:28:37,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:28:37,874 INFO L130 PetriNetUnfolder]: 359/506 cut-off events. [2023-09-01 12:28:37,874 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2023-09-01 12:28:37,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 506 events. 359/506 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1611 event pairs, 39 based on Foata normal form. 1/308 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2023-09-01 12:28:37,882 INFO L137 encePairwiseOnDemand]: 178/183 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2023-09-01 12:28:37,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 179 flow [2023-09-01 12:28:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 12:28:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 12:28:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-09-01 12:28:37,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5628415300546448 [2023-09-01 12:28:37,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-09-01 12:28:37,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-09-01 12:28:37,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:28:37,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-09-01 12:28:37,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:37,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:37,911 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:37,912 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 309 transitions. [2023-09-01 12:28:37,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 179 flow [2023-09-01 12:28:37,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-09-01 12:28:37,916 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 76 flow [2023-09-01 12:28:37,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2023-09-01 12:28:37,922 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2023-09-01 12:28:37,922 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 76 flow [2023-09-01 12:28:37,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:37,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:28:37,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:28:37,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 12:28:37,924 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)] === [2023-09-01 12:28:37,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:28:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash -296399337, now seen corresponding path program 1 times [2023-09-01 12:28:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:28:37,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731432681] [2023-09-01 12:28:37,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:28:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:28:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:28:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:28:38,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:28:38,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731432681] [2023-09-01 12:28:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731432681] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:28:38,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:28:38,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 12:28:38,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948843183] [2023-09-01 12:28:38,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:28:38,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 12:28:38,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:28:38,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 12:28:38,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 12:28:38,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 183 [2023-09-01 12:28:38,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:38,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:28:38,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 183 [2023-09-01 12:28:38,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:28:38,603 INFO L130 PetriNetUnfolder]: 596/906 cut-off events. [2023-09-01 12:28:38,603 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2023-09-01 12:28:38,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 906 events. 596/906 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3355 event pairs, 166 based on Foata normal form. 6/912 useless extension candidates. Maximal degree in co-relation 616. Up to 420 conditions per place. [2023-09-01 12:28:38,611 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 69 selfloop transitions, 8 changer transitions 8/85 dead transitions. [2023-09-01 12:28:38,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 85 transitions, 416 flow [2023-09-01 12:28:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:28:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:28:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 638 transitions. [2023-09-01 12:28:38,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49804839968774395 [2023-09-01 12:28:38,615 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 638 transitions. [2023-09-01 12:28:38,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 638 transitions. [2023-09-01 12:28:38,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:28:38,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 638 transitions. [2023-09-01 12:28:38,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:38,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:38,624 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:38,624 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 76 flow. Second operand 7 states and 638 transitions. [2023-09-01 12:28:38,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 85 transitions, 416 flow [2023-09-01 12:28:38,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 85 transitions, 406 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 12:28:38,628 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 139 flow [2023-09-01 12:28:38,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-09-01 12:28:38,629 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-09-01 12:28:38,629 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 139 flow [2023-09-01 12:28:38,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:38,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:28:38,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:28:38,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 12:28:38,630 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)] === [2023-09-01 12:28:38,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:28:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash -748397025, now seen corresponding path program 2 times [2023-09-01 12:28:38,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:28:38,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238876348] [2023-09-01 12:28:38,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:28:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:28:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:28:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:28:38,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:28:38,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238876348] [2023-09-01 12:28:38,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238876348] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:28:38,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647586728] [2023-09-01 12:28:38,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 12:28:38,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:28:38,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:28:38,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:28:38,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 12:28:38,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 12:28:38,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:28:38,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 12:28:38,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:28:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:28:39,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:28:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:28:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647586728] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 12:28:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 12:28:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 14 [2023-09-01 12:28:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957933077] [2023-09-01 12:28:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:28:39,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 12:28:39,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:28:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 12:28:39,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-09-01 12:28:39,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 183 [2023-09-01 12:28:39,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:39,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:28:39,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 183 [2023-09-01 12:28:39,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:28:39,706 INFO L130 PetriNetUnfolder]: 832/1268 cut-off events. [2023-09-01 12:28:39,706 INFO L131 PetriNetUnfolder]: For 1476/1531 co-relation queries the response was YES. [2023-09-01 12:28:39,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 1268 events. 832/1268 cut-off events. For 1476/1531 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5353 event pairs, 172 based on Foata normal form. 6/1272 useless extension candidates. Maximal degree in co-relation 1710. Up to 409 conditions per place. [2023-09-01 12:28:39,714 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 99 selfloop transitions, 17 changer transitions 1/118 dead transitions. [2023-09-01 12:28:39,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 118 transitions, 705 flow [2023-09-01 12:28:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 12:28:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 12:28:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 761 transitions. [2023-09-01 12:28:39,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519808743169399 [2023-09-01 12:28:39,717 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 761 transitions. [2023-09-01 12:28:39,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 761 transitions. [2023-09-01 12:28:39,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:28:39,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 761 transitions. [2023-09-01 12:28:39,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:39,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:39,723 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:39,724 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 139 flow. Second operand 8 states and 761 transitions. [2023-09-01 12:28:39,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 118 transitions, 705 flow [2023-09-01 12:28:39,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 118 transitions, 675 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-09-01 12:28:39,729 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 294 flow [2023-09-01 12:28:39,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=294, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2023-09-01 12:28:39,730 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2023-09-01 12:28:39,730 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 294 flow [2023-09-01 12:28:39,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:39,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:28:39,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:28:39,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 12:28:39,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:28:39,937 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)] === [2023-09-01 12:28:39,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:28:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1550280123, now seen corresponding path program 3 times [2023-09-01 12:28:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:28:39,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129458664] [2023-09-01 12:28:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:28:39,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:28:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:28:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:28:40,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:28:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129458664] [2023-09-01 12:28:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129458664] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:28:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:28:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 12:28:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688490588] [2023-09-01 12:28:40,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:28:40,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 12:28:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:28:40,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 12:28:40,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-09-01 12:28:40,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-09-01 12:28:40,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 294 flow. Second operand has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:40,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:28:40,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-09-01 12:28:40,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:28:40,567 INFO L130 PetriNetUnfolder]: 1203/1834 cut-off events. [2023-09-01 12:28:40,568 INFO L131 PetriNetUnfolder]: For 5174/5174 co-relation queries the response was YES. [2023-09-01 12:28:40,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7019 conditions, 1834 events. 1203/1834 cut-off events. For 5174/5174 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8187 event pairs, 336 based on Foata normal form. 12/1846 useless extension candidates. Maximal degree in co-relation 5374. Up to 928 conditions per place. [2023-09-01 12:28:40,580 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 108 selfloop transitions, 29 changer transitions 18/155 dead transitions. [2023-09-01 12:28:40,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 155 transitions, 1178 flow [2023-09-01 12:28:40,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 12:28:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 12:28:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 900 transitions. [2023-09-01 12:28:40,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918032786885246 [2023-09-01 12:28:40,584 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 900 transitions. [2023-09-01 12:28:40,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 900 transitions. [2023-09-01 12:28:40,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:28:40,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 900 transitions. [2023-09-01 12:28:40,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.0) internal successors, (900), 10 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:40,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:40,590 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:40,590 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 294 flow. Second operand 10 states and 900 transitions. [2023-09-01 12:28:40,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 155 transitions, 1178 flow [2023-09-01 12:28:40,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 155 transitions, 1174 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-09-01 12:28:40,603 INFO L231 Difference]: Finished difference. Result has 62 places, 73 transitions, 620 flow [2023-09-01 12:28:40,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=620, PETRI_PLACES=62, PETRI_TRANSITIONS=73} [2023-09-01 12:28:40,604 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2023-09-01 12:28:40,604 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 73 transitions, 620 flow [2023-09-01 12:28:40,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:40,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:28:40,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:28:40,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 12:28:40,606 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)] === [2023-09-01 12:28:40,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:28:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash 382118611, now seen corresponding path program 4 times [2023-09-01 12:28:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:28:40,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129198429] [2023-09-01 12:28:40,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:28:40,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:28:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:28:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:28:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:28:40,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129198429] [2023-09-01 12:28:40,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129198429] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:28:40,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501934183] [2023-09-01 12:28:40,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 12:28:40,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:28:40,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:28:40,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:28:40,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 12:28:40,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 12:28:40,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:28:40,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-01 12:28:40,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:28:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:28:40,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:28:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:28:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501934183] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:28:51,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:28:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2023-09-01 12:28:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331950693] [2023-09-01 12:28:51,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:28:51,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 12:28:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:28:51,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 12:28:51,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=168, Unknown=4, NotChecked=0, Total=240 [2023-09-01 12:28:53,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:28:53,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 183 [2023-09-01 12:28:53,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 73 transitions, 620 flow. Second operand has 16 states, 16 states have (on average 79.125) internal successors, (1266), 16 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:28:53,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:28:53,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 183 [2023-09-01 12:28:53,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:28:56,197 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296)) (.cse3 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 0) (< 1 .cse0) (let ((.cse1 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse1 .cse2) 4294967296) 4294967296) .cse3) .cse1)) (< .cse0 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse4 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse4) (let ((.cse5 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse5 .cse2) 4294967296) 4294967296) .cse3) .cse5)) (< .cse4 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))))) is different from false [2023-09-01 12:28:59,112 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse2 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296)) (.cse3 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 0) (< 1 .cse0) (let ((.cse1 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse1 .cse2) 4294967296) 4294967296) .cse3) .cse1)) (< .cse0 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (or (< .cse4 (mod c_~a~0 4294967296)) (let ((.cse5 (* 4294967295 c_~a~0))) (< (+ (* (div (+ .cse5 .cse2) 4294967296) 4294967296) .cse3) .cse5))) (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse6 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 .cse4) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse6) (let ((.cse7 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse7 .cse2) 4294967296) 4294967296) .cse3) .cse7)) (< .cse6 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))))) is different from false [2023-09-01 12:29:13,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:15,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:17,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:19,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:21,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:23,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:25,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:27,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:30,329 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296)) (.cse3 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 0) (< 1 .cse0) (let ((.cse1 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse1 .cse2) 4294967296) 4294967296) .cse3) .cse1)) (< .cse0 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (let ((.cse4 (* 4294967295 c_~a~0))) (< (+ (* (div (+ .cse4 .cse2) 4294967296) 4294967296) .cse3) .cse4)) (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse5 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse5) (let ((.cse6 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse6 .cse2) 4294967296) 4294967296) .cse3) .cse6)) (< .cse5 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))))) is different from false [2023-09-01 12:29:34,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:36,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:38,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:40,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:42,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:45,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:47,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:49,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:51,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:53,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:55,496 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296)) (.cse2 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (< .cse0 (mod (+ c_~b~0 c_~a~0) 4294967296)) (= c_thread2Thread1of1ForFork2_~i~1 0) (let ((.cse1 (* 4294967295 c_~a~0))) (< (+ (* (div (+ .cse1 .cse0) 4294967296) 4294967296) .cse2) .cse1)) (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse3 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse3) (let ((.cse4 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse4 .cse0) 4294967296) 4294967296) .cse2) .cse4)) (< .cse3 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))))) is different from false [2023-09-01 12:29:57,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:29:59,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:01,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:03,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:05,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:07,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:09,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:12,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:14,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:16,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:18,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:20,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:22,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:24,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:26,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:28,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:30,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:32,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:34,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:36,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:38,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:40,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:42,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:44,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:46,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:48,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:51,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:53,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:55,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:30:55,047 INFO L130 PetriNetUnfolder]: 2448/3776 cut-off events. [2023-09-01 12:30:55,047 INFO L131 PetriNetUnfolder]: For 17276/17276 co-relation queries the response was YES. [2023-09-01 12:30:55,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16920 conditions, 3776 events. 2448/3776 cut-off events. For 17276/17276 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19601 event pairs, 311 based on Foata normal form. 46/3822 useless extension candidates. Maximal degree in co-relation 14989. Up to 1312 conditions per place. [2023-09-01 12:30:55,069 INFO L137 encePairwiseOnDemand]: 170/183 looper letters, 204 selfloop transitions, 129 changer transitions 3/336 dead transitions. [2023-09-01 12:30:55,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 336 transitions, 2821 flow [2023-09-01 12:30:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-09-01 12:30:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-09-01 12:30:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2182 transitions. [2023-09-01 12:30:55,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769398907103825 [2023-09-01 12:30:55,122 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2182 transitions. [2023-09-01 12:30:55,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2182 transitions. [2023-09-01 12:30:55,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:30:55,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2182 transitions. [2023-09-01 12:30:55,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 87.28) internal successors, (2182), 25 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:30:55,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 183.0) internal successors, (4758), 26 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:30:55,134 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 183.0) internal successors, (4758), 26 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:30:55,135 INFO L175 Difference]: Start difference. First operand has 62 places, 73 transitions, 620 flow. Second operand 25 states and 2182 transitions. [2023-09-01 12:30:55,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 336 transitions, 2821 flow [2023-09-01 12:30:55,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 336 transitions, 2763 flow, removed 29 selfloop flow, removed 1 redundant places. [2023-09-01 12:30:55,218 INFO L231 Difference]: Finished difference. Result has 106 places, 176 transitions, 1999 flow [2023-09-01 12:30:55,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1999, PETRI_PLACES=106, PETRI_TRANSITIONS=176} [2023-09-01 12:30:55,219 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2023-09-01 12:30:55,220 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 176 transitions, 1999 flow [2023-09-01 12:30:55,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.125) internal successors, (1266), 16 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:30:55,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:30:55,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:30:55,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-01 12:30:55,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:30:55,423 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)] === [2023-09-01 12:30:55,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:30:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2033487921, now seen corresponding path program 1 times [2023-09-01 12:30:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:30:55,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384067488] [2023-09-01 12:30:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:30:55,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:30:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:30:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:30:55,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:30:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384067488] [2023-09-01 12:30:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384067488] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:30:55,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926813732] [2023-09-01 12:30:55,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:30:55,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:30:55,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:30:55,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:30:55,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 12:30:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:30:55,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 12:30:55,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:30:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:30:55,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:30:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:30:55,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926813732] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:30:55,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:30:55,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-09-01 12:30:55,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562947731] [2023-09-01 12:30:55,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:30:55,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 12:30:55,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:30:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 12:30:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-09-01 12:30:55,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-09-01 12:30:55,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 176 transitions, 1999 flow. Second operand has 10 states, 10 states have (on average 81.8) internal successors, (818), 10 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:30:55,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:30:55,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-09-01 12:30:55,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:30:57,078 INFO L130 PetriNetUnfolder]: 2706/4233 cut-off events. [2023-09-01 12:30:57,078 INFO L131 PetriNetUnfolder]: For 74787/74787 co-relation queries the response was YES. [2023-09-01 12:30:57,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31085 conditions, 4233 events. 2706/4233 cut-off events. For 74787/74787 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23125 event pairs, 530 based on Foata normal form. 38/4271 useless extension candidates. Maximal degree in co-relation 25399. Up to 1554 conditions per place. [2023-09-01 12:30:57,186 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 231 selfloop transitions, 79 changer transitions 4/314 dead transitions. [2023-09-01 12:30:57,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 314 transitions, 4140 flow [2023-09-01 12:30:57,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 12:30:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 12:30:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 913 transitions. [2023-09-01 12:30:57,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989071038251366 [2023-09-01 12:30:57,199 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 913 transitions. [2023-09-01 12:30:57,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 913 transitions. [2023-09-01 12:30:57,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:30:57,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 913 transitions. [2023-09-01 12:30:57,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.3) internal successors, (913), 10 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:30:57,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:30:57,205 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:30:57,205 INFO L175 Difference]: Start difference. First operand has 106 places, 176 transitions, 1999 flow. Second operand 10 states and 913 transitions. [2023-09-01 12:30:57,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 314 transitions, 4140 flow [2023-09-01 12:30:57,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 314 transitions, 3816 flow, removed 162 selfloop flow, removed 0 redundant places. [2023-09-01 12:30:57,401 INFO L231 Difference]: Finished difference. Result has 120 places, 207 transitions, 2438 flow [2023-09-01 12:30:57,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1737, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2438, PETRI_PLACES=120, PETRI_TRANSITIONS=207} [2023-09-01 12:30:57,402 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 91 predicate places. [2023-09-01 12:30:57,402 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 207 transitions, 2438 flow [2023-09-01 12:30:57,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.8) internal successors, (818), 10 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:30:57,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:30:57,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:30:57,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 12:30:57,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:30:57,609 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)] === [2023-09-01 12:30:57,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:30:57,609 INFO L85 PathProgramCache]: Analyzing trace with hash -948140923, now seen corresponding path program 2 times [2023-09-01 12:30:57,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:30:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172426789] [2023-09-01 12:30:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:30:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:30:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:30:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:30:57,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:30:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172426789] [2023-09-01 12:30:57,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172426789] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:30:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946613789] [2023-09-01 12:30:57,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 12:30:57,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:30:57,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:30:57,759 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:30:57,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 12:30:57,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 12:30:57,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:30:57,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 12:30:57,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:30:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:30:58,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:30:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:30:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946613789] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:30:58,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:30:58,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 10 [2023-09-01 12:30:58,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901138942] [2023-09-01 12:30:58,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:30:58,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 12:30:58,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:30:58,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 12:30:58,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-09-01 12:30:58,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-09-01 12:30:58,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 207 transitions, 2438 flow. Second operand has 10 states, 10 states have (on average 81.7) internal successors, (817), 10 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:30:58,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:30:58,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-09-01 12:30:58,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:31:00,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:01,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:03,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:07,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:09,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:11,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:13,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:15,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:17,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:20,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:24,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:26,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:29,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:32,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:34,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:35,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:37,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:39,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:43,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:45,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:48,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:50,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:52,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:55,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:56,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:31:58,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:01,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:04,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:06,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:09,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:12,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:13,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:15,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:17,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:24,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:26,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:28,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:33,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:35,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:38,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:40,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:42,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:44,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:46,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:48,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:52,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:55,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:32:57,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:00,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:02,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:04,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:06,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:09,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:13,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:19,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:23,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:25,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:25,671 INFO L130 PetriNetUnfolder]: 3494/5459 cut-off events. [2023-09-01 12:33:25,672 INFO L131 PetriNetUnfolder]: For 115479/115479 co-relation queries the response was YES. [2023-09-01 12:33:25,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42638 conditions, 5459 events. 3494/5459 cut-off events. For 115479/115479 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 30856 event pairs, 562 based on Foata normal form. 20/5453 useless extension candidates. Maximal degree in co-relation 34948. Up to 2062 conditions per place. [2023-09-01 12:33:25,710 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 252 selfloop transitions, 162 changer transitions 2/416 dead transitions. [2023-09-01 12:33:25,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 416 transitions, 5806 flow [2023-09-01 12:33:25,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-01 12:33:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-09-01 12:33:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1277 transitions. [2023-09-01 12:33:25,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49843871975019516 [2023-09-01 12:33:25,717 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1277 transitions. [2023-09-01 12:33:25,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1277 transitions. [2023-09-01 12:33:25,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:33:25,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1277 transitions. [2023-09-01 12:33:25,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 91.21428571428571) internal successors, (1277), 14 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:25,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:25,724 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:25,724 INFO L175 Difference]: Start difference. First operand has 120 places, 207 transitions, 2438 flow. Second operand 14 states and 1277 transitions. [2023-09-01 12:33:25,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 416 transitions, 5806 flow [2023-09-01 12:33:26,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 416 transitions, 5683 flow, removed 40 selfloop flow, removed 1 redundant places. [2023-09-01 12:33:26,027 INFO L231 Difference]: Finished difference. Result has 142 places, 284 transitions, 4072 flow [2023-09-01 12:33:26,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2365, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4072, PETRI_PLACES=142, PETRI_TRANSITIONS=284} [2023-09-01 12:33:26,028 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 113 predicate places. [2023-09-01 12:33:26,029 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 284 transitions, 4072 flow [2023-09-01 12:33:26,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.7) internal successors, (817), 10 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:26,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:33:26,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:33:26,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-01 12:33:26,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:33:26,233 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:33:26,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:33:26,234 INFO L85 PathProgramCache]: Analyzing trace with hash -245491509, now seen corresponding path program 5 times [2023-09-01 12:33:26,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:33:26,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064433606] [2023-09-01 12:33:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:33:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:33:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:33:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:33:26,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064433606] [2023-09-01 12:33:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064433606] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:33:26,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692611219] [2023-09-01 12:33:26,402 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 12:33:26,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:33:26,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:33:26,404 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:33:26,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 12:33:26,504 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 12:33:26,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:33:26,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2023-09-01 12:33:26,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:33:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:26,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:33:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692611219] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:33:26,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:33:26,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-09-01 12:33:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252823245] [2023-09-01 12:33:26,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:33:26,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 12:33:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:33:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 12:33:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-09-01 12:33:26,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-09-01 12:33:26,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 284 transitions, 4072 flow. Second operand has 12 states, 12 states have (on average 81.91666666666667) internal successors, (983), 12 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:26,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:33:26,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-09-01 12:33:26,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:33:28,083 INFO L130 PetriNetUnfolder]: 3716/5913 cut-off events. [2023-09-01 12:33:28,083 INFO L131 PetriNetUnfolder]: For 145664/145664 co-relation queries the response was YES. [2023-09-01 12:33:28,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49874 conditions, 5913 events. 3716/5913 cut-off events. For 145664/145664 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 35006 event pairs, 682 based on Foata normal form. 28/5929 useless extension candidates. Maximal degree in co-relation 42026. Up to 2218 conditions per place. [2023-09-01 12:33:28,128 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 262 selfloop transitions, 189 changer transitions 3/454 dead transitions. [2023-09-01 12:33:28,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 454 transitions, 7185 flow [2023-09-01 12:33:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 12:33:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 12:33:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 913 transitions. [2023-09-01 12:33:28,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989071038251366 [2023-09-01 12:33:28,131 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 913 transitions. [2023-09-01 12:33:28,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 913 transitions. [2023-09-01 12:33:28,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:33:28,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 913 transitions. [2023-09-01 12:33:28,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.3) internal successors, (913), 10 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:28,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:28,136 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:28,137 INFO L175 Difference]: Start difference. First operand has 142 places, 284 transitions, 4072 flow. Second operand 10 states and 913 transitions. [2023-09-01 12:33:28,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 454 transitions, 7185 flow [2023-09-01 12:33:28,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 454 transitions, 6970 flow, removed 98 selfloop flow, removed 1 redundant places. [2023-09-01 12:33:28,691 INFO L231 Difference]: Finished difference. Result has 156 places, 337 transitions, 5457 flow [2023-09-01 12:33:28,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=3916, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5457, PETRI_PLACES=156, PETRI_TRANSITIONS=337} [2023-09-01 12:33:28,692 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 127 predicate places. [2023-09-01 12:33:28,692 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 337 transitions, 5457 flow [2023-09-01 12:33:28,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.91666666666667) internal successors, (983), 12 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:28,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:33:28,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:33:28,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-01 12:33:28,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:33:28,894 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:33:28,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:33:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1351540861, now seen corresponding path program 3 times [2023-09-01 12:33:28,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:33:28,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872952920] [2023-09-01 12:33:28,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:33:28,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:33:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:33:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:29,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:33:29,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872952920] [2023-09-01 12:33:29,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872952920] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:33:29,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:33:29,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 12:33:29,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694927619] [2023-09-01 12:33:29,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:33:29,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 12:33:29,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:33:29,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 12:33:29,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 12:33:29,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 183 [2023-09-01 12:33:29,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 337 transitions, 5457 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:29,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:33:29,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 183 [2023-09-01 12:33:29,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:33:30,290 INFO L130 PetriNetUnfolder]: 3856/6174 cut-off events. [2023-09-01 12:33:30,290 INFO L131 PetriNetUnfolder]: For 166477/166477 co-relation queries the response was YES. [2023-09-01 12:33:30,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53784 conditions, 6174 events. 3856/6174 cut-off events. For 166477/166477 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 37462 event pairs, 1098 based on Foata normal form. 36/6198 useless extension candidates. Maximal degree in co-relation 52934. Up to 3202 conditions per place. [2023-09-01 12:33:30,351 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 368 selfloop transitions, 68 changer transitions 14/450 dead transitions. [2023-09-01 12:33:30,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 450 transitions, 7986 flow [2023-09-01 12:33:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:33:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:33:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 640 transitions. [2023-09-01 12:33:30,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4996096799375488 [2023-09-01 12:33:30,354 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 640 transitions. [2023-09-01 12:33:30,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 640 transitions. [2023-09-01 12:33:30,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:33:30,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 640 transitions. [2023-09-01 12:33:30,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:30,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:30,358 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:30,358 INFO L175 Difference]: Start difference. First operand has 156 places, 337 transitions, 5457 flow. Second operand 7 states and 640 transitions. [2023-09-01 12:33:30,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 450 transitions, 7986 flow [2023-09-01 12:33:30,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 450 transitions, 7696 flow, removed 56 selfloop flow, removed 3 redundant places. [2023-09-01 12:33:30,900 INFO L231 Difference]: Finished difference. Result has 162 places, 345 transitions, 5605 flow [2023-09-01 12:33:30,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5228, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5605, PETRI_PLACES=162, PETRI_TRANSITIONS=345} [2023-09-01 12:33:30,900 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 133 predicate places. [2023-09-01 12:33:30,901 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 345 transitions, 5605 flow [2023-09-01 12:33:30,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:30,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:33:30,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:33:30,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 12:33:30,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:33:30,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:33:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1415412557, now seen corresponding path program 4 times [2023-09-01 12:33:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:33:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530227153] [2023-09-01 12:33:30,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:33:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:33:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:33:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:31,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:33:31,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530227153] [2023-09-01 12:33:31,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530227153] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:33:31,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877169648] [2023-09-01 12:33:31,047 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 12:33:31,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:33:31,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:33:31,049 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:33:31,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 12:33:31,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 12:33:31,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:33:31,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2023-09-01 12:33:31,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:33:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:31,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:33:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:45,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877169648] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:33:45,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:33:45,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-09-01 12:33:45,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282821198] [2023-09-01 12:33:45,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:33:45,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 12:33:45,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:33:45,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 12:33:45,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=92, Unknown=7, NotChecked=0, Total=132 [2023-09-01 12:33:47,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:49,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:51,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:53,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:33:53,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-09-01 12:33:53,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 345 transitions, 5605 flow. Second operand has 12 states, 12 states have (on average 77.33333333333333) internal successors, (928), 12 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:53,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:33:53,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-09-01 12:33:53,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:33:54,872 INFO L130 PetriNetUnfolder]: 3815/6091 cut-off events. [2023-09-01 12:33:54,872 INFO L131 PetriNetUnfolder]: For 153450/153450 co-relation queries the response was YES. [2023-09-01 12:33:54,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53190 conditions, 6091 events. 3815/6091 cut-off events. For 153450/153450 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 36379 event pairs, 994 based on Foata normal form. 8/6087 useless extension candidates. Maximal degree in co-relation 52805. Up to 2684 conditions per place. [2023-09-01 12:33:54,917 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 294 selfloop transitions, 134 changer transitions 3/431 dead transitions. [2023-09-01 12:33:54,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 431 transitions, 7624 flow [2023-09-01 12:33:54,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:33:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:33:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 615 transitions. [2023-09-01 12:33:54,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48009367681498827 [2023-09-01 12:33:54,919 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 615 transitions. [2023-09-01 12:33:54,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 615 transitions. [2023-09-01 12:33:54,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:33:54,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 615 transitions. [2023-09-01 12:33:54,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:54,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:54,923 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:54,923 INFO L175 Difference]: Start difference. First operand has 162 places, 345 transitions, 5605 flow. Second operand 7 states and 615 transitions. [2023-09-01 12:33:54,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 431 transitions, 7624 flow [2023-09-01 12:33:55,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 431 transitions, 7461 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-09-01 12:33:55,417 INFO L231 Difference]: Finished difference. Result has 168 places, 368 transitions, 6416 flow [2023-09-01 12:33:55,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5466, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6416, PETRI_PLACES=168, PETRI_TRANSITIONS=368} [2023-09-01 12:33:55,417 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 139 predicate places. [2023-09-01 12:33:55,418 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 368 transitions, 6416 flow [2023-09-01 12:33:55,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.33333333333333) internal successors, (928), 12 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:55,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:33:55,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:33:55,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-01 12:33:55,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:33:55,624 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:33:55,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:33:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1263392859, now seen corresponding path program 6 times [2023-09-01 12:33:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:33:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054332335] [2023-09-01 12:33:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:33:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:33:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:33:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:55,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:33:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054332335] [2023-09-01 12:33:55,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054332335] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:33:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66896216] [2023-09-01 12:33:55,772 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 12:33:55,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:33:55,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:33:55,774 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:33:55,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-01 12:33:55,872 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-09-01 12:33:55,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:33:55,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 12:33:55,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:33:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:56,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:33:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66896216] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 12:33:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 12:33:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 14 [2023-09-01 12:33:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120268993] [2023-09-01 12:33:56,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:33:56,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 12:33:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:33:56,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 12:33:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-09-01 12:33:56,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 183 [2023-09-01 12:33:56,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 368 transitions, 6416 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:56,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:33:56,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 183 [2023-09-01 12:33:56,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:33:57,401 INFO L130 PetriNetUnfolder]: 4183/6727 cut-off events. [2023-09-01 12:33:57,401 INFO L131 PetriNetUnfolder]: For 174395/174514 co-relation queries the response was YES. [2023-09-01 12:33:57,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59974 conditions, 6727 events. 4183/6727 cut-off events. For 174395/174514 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 41724 event pairs, 931 based on Foata normal form. 38/6725 useless extension candidates. Maximal degree in co-relation 59044. Up to 2427 conditions per place. [2023-09-01 12:33:57,460 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 317 selfloop transitions, 165 changer transitions 1/492 dead transitions. [2023-09-01 12:33:57,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 492 transitions, 8969 flow [2023-09-01 12:33:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 12:33:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 12:33:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 761 transitions. [2023-09-01 12:33:57,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519808743169399 [2023-09-01 12:33:57,466 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 761 transitions. [2023-09-01 12:33:57,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 761 transitions. [2023-09-01 12:33:57,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:33:57,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 761 transitions. [2023-09-01 12:33:57,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:57,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:57,471 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:57,471 INFO L175 Difference]: Start difference. First operand has 168 places, 368 transitions, 6416 flow. Second operand 8 states and 761 transitions. [2023-09-01 12:33:57,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 492 transitions, 8969 flow [2023-09-01 12:33:58,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 492 transitions, 8879 flow, removed 45 selfloop flow, removed 0 redundant places. [2023-09-01 12:33:58,149 INFO L231 Difference]: Finished difference. Result has 179 places, 399 transitions, 7404 flow [2023-09-01 12:33:58,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=6326, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7404, PETRI_PLACES=179, PETRI_TRANSITIONS=399} [2023-09-01 12:33:58,149 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 150 predicate places. [2023-09-01 12:33:58,150 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 399 transitions, 7404 flow [2023-09-01 12:33:58,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:58,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:33:58,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:33:58,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-01 12:33:58,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:33:58,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:33:58,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:33:58,351 INFO L85 PathProgramCache]: Analyzing trace with hash 27840999, now seen corresponding path program 5 times [2023-09-01 12:33:58,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:33:58,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044491693] [2023-09-01 12:33:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:33:58,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:33:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:33:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:58,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:33:58,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044491693] [2023-09-01 12:33:58,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044491693] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:33:58,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107180444] [2023-09-01 12:33:58,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 12:33:58,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:33:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:33:58,517 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:33:58,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-01 12:33:58,626 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 12:33:58,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:33:58,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 12:33:58,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:33:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:58,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:33:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:33:58,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107180444] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:33:58,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:33:58,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-09-01 12:33:58,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475250658] [2023-09-01 12:33:58,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:33:58,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-01 12:33:58,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:33:58,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-01 12:33:58,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-09-01 12:33:58,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-09-01 12:33:58,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 399 transitions, 7404 flow. Second operand has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:33:58,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:33:58,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-09-01 12:33:58,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:34:00,227 INFO L130 PetriNetUnfolder]: 4273/6821 cut-off events. [2023-09-01 12:34:00,228 INFO L131 PetriNetUnfolder]: For 186113/186113 co-relation queries the response was YES. [2023-09-01 12:34:00,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62393 conditions, 6821 events. 4273/6821 cut-off events. For 186113/186113 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 41795 event pairs, 1302 based on Foata normal form. 16/6825 useless extension candidates. Maximal degree in co-relation 61417. Up to 3966 conditions per place. [2023-09-01 12:34:00,306 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 418 selfloop transitions, 81 changer transitions 2/501 dead transitions. [2023-09-01 12:34:00,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 501 transitions, 9881 flow [2023-09-01 12:34:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:34:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:34:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 631 transitions. [2023-09-01 12:34:00,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492583918813427 [2023-09-01 12:34:00,308 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 631 transitions. [2023-09-01 12:34:00,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 631 transitions. [2023-09-01 12:34:00,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:34:00,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 631 transitions. [2023-09-01 12:34:00,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:00,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:00,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:00,313 INFO L175 Difference]: Start difference. First operand has 179 places, 399 transitions, 7404 flow. Second operand 7 states and 631 transitions. [2023-09-01 12:34:00,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 501 transitions, 9881 flow [2023-09-01 12:34:00,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 501 transitions, 9851 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-09-01 12:34:00,972 INFO L231 Difference]: Finished difference. Result has 188 places, 405 transitions, 7729 flow [2023-09-01 12:34:00,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=7368, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7729, PETRI_PLACES=188, PETRI_TRANSITIONS=405} [2023-09-01 12:34:00,973 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 159 predicate places. [2023-09-01 12:34:00,973 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 405 transitions, 7729 flow [2023-09-01 12:34:00,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:00,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:34:00,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:34:00,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-09-01 12:34:01,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-09-01 12:34:01,183 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:34:01,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:34:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash -461893579, now seen corresponding path program 6 times [2023-09-01 12:34:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:34:01,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397466169] [2023-09-01 12:34:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:34:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:34:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:01,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:34:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397466169] [2023-09-01 12:34:01,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397466169] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:34:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050932587] [2023-09-01 12:34:01,350 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 12:34:01,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:34:01,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:34:01,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:34:01,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-09-01 12:34:01,459 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-09-01 12:34:01,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:34:01,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-01 12:34:01,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:34:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:01,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:34:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050932587] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 12:34:01,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 12:34:01,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 10 [2023-09-01 12:34:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15644093] [2023-09-01 12:34:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:34:01,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 12:34:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:34:01,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 12:34:01,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-09-01 12:34:01,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 183 [2023-09-01 12:34:01,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 405 transitions, 7729 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:01,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:34:01,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 183 [2023-09-01 12:34:01,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:34:02,912 INFO L130 PetriNetUnfolder]: 4534/7279 cut-off events. [2023-09-01 12:34:02,912 INFO L131 PetriNetUnfolder]: For 222581/223134 co-relation queries the response was YES. [2023-09-01 12:34:02,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69224 conditions, 7279 events. 4534/7279 cut-off events. For 222581/223134 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 46299 event pairs, 990 based on Foata normal form. 273/7401 useless extension candidates. Maximal degree in co-relation 68527. Up to 3310 conditions per place. [2023-09-01 12:34:02,991 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 279 selfloop transitions, 174 changer transitions 2/495 dead transitions. [2023-09-01 12:34:02,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 495 transitions, 10220 flow [2023-09-01 12:34:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 12:34:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 12:34:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 557 transitions. [2023-09-01 12:34:02,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072859744990893 [2023-09-01 12:34:02,994 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 557 transitions. [2023-09-01 12:34:02,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 557 transitions. [2023-09-01 12:34:02,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:34:02,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 557 transitions. [2023-09-01 12:34:02,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:02,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:02,997 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:02,998 INFO L175 Difference]: Start difference. First operand has 188 places, 405 transitions, 7729 flow. Second operand 6 states and 557 transitions. [2023-09-01 12:34:02,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 495 transitions, 10220 flow [2023-09-01 12:34:04,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 495 transitions, 10008 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-09-01 12:34:04,010 INFO L231 Difference]: Finished difference. Result has 194 places, 436 transitions, 8881 flow [2023-09-01 12:34:04,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=7573, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8881, PETRI_PLACES=194, PETRI_TRANSITIONS=436} [2023-09-01 12:34:04,011 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 165 predicate places. [2023-09-01 12:34:04,011 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 436 transitions, 8881 flow [2023-09-01 12:34:04,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:04,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:34:04,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:34:04,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-09-01 12:34:04,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-09-01 12:34:04,212 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:34:04,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:34:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1514628361, now seen corresponding path program 1 times [2023-09-01 12:34:04,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:34:04,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336840145] [2023-09-01 12:34:04,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:34:04,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:34:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:04,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:34:04,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336840145] [2023-09-01 12:34:04,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336840145] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:34:04,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:34:04,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 12:34:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805037538] [2023-09-01 12:34:04,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:34:04,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 12:34:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:34:04,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 12:34:04,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 12:34:04,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 183 [2023-09-01 12:34:04,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 436 transitions, 8881 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:04,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:34:04,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 183 [2023-09-01 12:34:04,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:34:06,007 INFO L130 PetriNetUnfolder]: 4952/7977 cut-off events. [2023-09-01 12:34:06,007 INFO L131 PetriNetUnfolder]: For 246658/246658 co-relation queries the response was YES. [2023-09-01 12:34:06,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75891 conditions, 7977 events. 4952/7977 cut-off events. For 246658/246658 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 50852 event pairs, 1543 based on Foata normal form. 28/7993 useless extension candidates. Maximal degree in co-relation 75182. Up to 4042 conditions per place. [2023-09-01 12:34:06,068 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 393 selfloop transitions, 143 changer transitions 9/545 dead transitions. [2023-09-01 12:34:06,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 545 transitions, 11635 flow [2023-09-01 12:34:06,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:34:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:34:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 641 transitions. [2023-09-01 12:34:06,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003903200624512 [2023-09-01 12:34:06,070 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 641 transitions. [2023-09-01 12:34:06,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 641 transitions. [2023-09-01 12:34:06,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:34:06,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 641 transitions. [2023-09-01 12:34:06,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:06,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:06,073 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:06,073 INFO L175 Difference]: Start difference. First operand has 194 places, 436 transitions, 8881 flow. Second operand 7 states and 641 transitions. [2023-09-01 12:34:06,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 545 transitions, 11635 flow [2023-09-01 12:34:07,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 545 transitions, 11509 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-09-01 12:34:07,074 INFO L231 Difference]: Finished difference. Result has 204 places, 464 transitions, 9933 flow [2023-09-01 12:34:07,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=8772, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9933, PETRI_PLACES=204, PETRI_TRANSITIONS=464} [2023-09-01 12:34:07,075 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 175 predicate places. [2023-09-01 12:34:07,075 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 464 transitions, 9933 flow [2023-09-01 12:34:07,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:07,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:34:07,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:34:07,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 12:34:07,076 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:34:07,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:34:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1187761213, now seen corresponding path program 7 times [2023-09-01 12:34:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:34:07,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069938638] [2023-09-01 12:34:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:34:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:34:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:07,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:34:07,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069938638] [2023-09-01 12:34:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069938638] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:34:07,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662857475] [2023-09-01 12:34:07,214 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-09-01 12:34:07,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:34:07,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:34:07,217 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:34:07,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-09-01 12:34:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:07,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 12:34:07,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:34:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:07,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:34:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662857475] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 12:34:07,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 12:34:07,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2023-09-01 12:34:07,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753591031] [2023-09-01 12:34:07,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:34:07,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 12:34:07,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:34:07,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 12:34:07,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-09-01 12:34:08,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 183 [2023-09-01 12:34:08,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 464 transitions, 9933 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:08,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:34:08,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 183 [2023-09-01 12:34:08,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:34:09,631 INFO L130 PetriNetUnfolder]: 4819/7777 cut-off events. [2023-09-01 12:34:09,631 INFO L131 PetriNetUnfolder]: For 262039/262192 co-relation queries the response was YES. [2023-09-01 12:34:09,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77064 conditions, 7777 events. 4819/7777 cut-off events. For 262039/262192 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 49680 event pairs, 1577 based on Foata normal form. 32/7754 useless extension candidates. Maximal degree in co-relation 76338. Up to 4007 conditions per place. [2023-09-01 12:34:09,712 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 422 selfloop transitions, 95 changer transitions 1/529 dead transitions. [2023-09-01 12:34:09,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 529 transitions, 11694 flow [2023-09-01 12:34:09,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 12:34:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 12:34:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2023-09-01 12:34:09,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191256830601093 [2023-09-01 12:34:09,714 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 570 transitions. [2023-09-01 12:34:09,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions. [2023-09-01 12:34:09,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:34:09,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions. [2023-09-01 12:34:09,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:09,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:09,718 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:09,718 INFO L175 Difference]: Start difference. First operand has 204 places, 464 transitions, 9933 flow. Second operand 6 states and 570 transitions. [2023-09-01 12:34:09,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 529 transitions, 11694 flow [2023-09-01 12:34:10,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 529 transitions, 11618 flow, removed 38 selfloop flow, removed 1 redundant places. [2023-09-01 12:34:10,824 INFO L231 Difference]: Finished difference. Result has 210 places, 467 transitions, 10146 flow [2023-09-01 12:34:10,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=9857, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10146, PETRI_PLACES=210, PETRI_TRANSITIONS=467} [2023-09-01 12:34:10,825 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 181 predicate places. [2023-09-01 12:34:10,825 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 467 transitions, 10146 flow [2023-09-01 12:34:10,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:10,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:34:10,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:34:10,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-09-01 12:34:11,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-09-01 12:34:11,030 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:34:11,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:34:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2059082981, now seen corresponding path program 8 times [2023-09-01 12:34:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:34:11,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069126311] [2023-09-01 12:34:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:34:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:34:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:11,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:34:11,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069126311] [2023-09-01 12:34:11,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069126311] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:34:11,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179882246] [2023-09-01 12:34:11,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 12:34:11,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:34:11,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:34:11,187 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:34:11,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-09-01 12:34:11,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 12:34:11,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:34:11,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 12:34:11,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:34:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:11,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:34:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:11,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179882246] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 12:34:11,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 12:34:11,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2023-09-01 12:34:11,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4621592] [2023-09-01 12:34:11,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:34:11,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 12:34:11,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:34:11,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 12:34:11,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-09-01 12:34:12,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 183 [2023-09-01 12:34:12,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 467 transitions, 10146 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:12,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:34:12,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 183 [2023-09-01 12:34:12,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:34:13,910 INFO L130 PetriNetUnfolder]: 4799/7737 cut-off events. [2023-09-01 12:34:13,910 INFO L131 PetriNetUnfolder]: For 259837/259990 co-relation queries the response was YES. [2023-09-01 12:34:13,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76919 conditions, 7737 events. 4799/7737 cut-off events. For 259837/259990 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 49332 event pairs, 1579 based on Foata normal form. 36/7718 useless extension candidates. Maximal degree in co-relation 76190. Up to 4007 conditions per place. [2023-09-01 12:34:13,997 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 418 selfloop transitions, 96 changer transitions 1/526 dead transitions. [2023-09-01 12:34:13,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 526 transitions, 11845 flow [2023-09-01 12:34:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 12:34:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 12:34:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 568 transitions. [2023-09-01 12:34:13,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.517304189435337 [2023-09-01 12:34:13,999 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 568 transitions. [2023-09-01 12:34:13,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 568 transitions. [2023-09-01 12:34:13,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:34:13,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 568 transitions. [2023-09-01 12:34:14,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:14,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:14,002 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:14,002 INFO L175 Difference]: Start difference. First operand has 210 places, 467 transitions, 10146 flow. Second operand 6 states and 568 transitions. [2023-09-01 12:34:14,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 526 transitions, 11845 flow [2023-09-01 12:34:15,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 526 transitions, 11691 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-09-01 12:34:15,167 INFO L231 Difference]: Finished difference. Result has 215 places, 468 transitions, 10237 flow [2023-09-01 12:34:15,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=9992, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10237, PETRI_PLACES=215, PETRI_TRANSITIONS=468} [2023-09-01 12:34:15,168 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 186 predicate places. [2023-09-01 12:34:15,168 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 468 transitions, 10237 flow [2023-09-01 12:34:15,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:15,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:34:15,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:34:15,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-09-01 12:34:15,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-09-01 12:34:15,369 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:34:15,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:34:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1605114923, now seen corresponding path program 9 times [2023-09-01 12:34:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:34:15,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441023555] [2023-09-01 12:34:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:34:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:34:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:34:15,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441023555] [2023-09-01 12:34:15,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441023555] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:34:15,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360921401] [2023-09-01 12:34:15,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 12:34:15,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:34:15,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:34:15,515 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:34:15,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-09-01 12:34:15,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 12:34:15,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:34:15,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-01 12:34:15,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:34:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:15,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:34:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360921401] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 12:34:15,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 12:34:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 10 [2023-09-01 12:34:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297529286] [2023-09-01 12:34:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:34:15,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 12:34:15,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:34:15,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 12:34:15,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-09-01 12:34:15,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 183 [2023-09-01 12:34:15,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 468 transitions, 10237 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:15,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:34:15,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 183 [2023-09-01 12:34:15,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:34:17,548 INFO L130 PetriNetUnfolder]: 4789/7707 cut-off events. [2023-09-01 12:34:17,548 INFO L131 PetriNetUnfolder]: For 261776/261929 co-relation queries the response was YES. [2023-09-01 12:34:17,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76969 conditions, 7707 events. 4789/7707 cut-off events. For 261776/261929 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 48988 event pairs, 1547 based on Foata normal form. 26/7678 useless extension candidates. Maximal degree in co-relation 76238. Up to 4007 conditions per place. [2023-09-01 12:34:17,614 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 405 selfloop transitions, 109 changer transitions 1/526 dead transitions. [2023-09-01 12:34:17,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 526 transitions, 11959 flow [2023-09-01 12:34:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 12:34:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 12:34:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-09-01 12:34:17,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136612021857924 [2023-09-01 12:34:17,616 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-09-01 12:34:17,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-09-01 12:34:17,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:34:17,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-09-01 12:34:17,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:17,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:17,618 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:17,619 INFO L175 Difference]: Start difference. First operand has 215 places, 468 transitions, 10237 flow. Second operand 6 states and 564 transitions. [2023-09-01 12:34:17,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 526 transitions, 11959 flow [2023-09-01 12:34:18,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 526 transitions, 11794 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-09-01 12:34:18,706 INFO L231 Difference]: Finished difference. Result has 221 places, 470 transitions, 10391 flow [2023-09-01 12:34:18,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=10073, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10391, PETRI_PLACES=221, PETRI_TRANSITIONS=470} [2023-09-01 12:34:18,706 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 192 predicate places. [2023-09-01 12:34:18,707 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 470 transitions, 10391 flow [2023-09-01 12:34:18,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:18,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:34:18,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:34:18,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-09-01 12:34:18,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-09-01 12:34:18,912 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:34:18,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:34:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1543476489, now seen corresponding path program 2 times [2023-09-01 12:34:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:34:18,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677838088] [2023-09-01 12:34:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:34:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:34:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:19,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:34:19,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677838088] [2023-09-01 12:34:19,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677838088] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:34:19,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:34:19,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 12:34:19,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275819379] [2023-09-01 12:34:19,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:34:19,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 12:34:19,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:34:19,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 12:34:19,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 12:34:19,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 183 [2023-09-01 12:34:19,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 470 transitions, 10391 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:19,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:34:19,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 183 [2023-09-01 12:34:19,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:34:20,744 INFO L130 PetriNetUnfolder]: 4901/7938 cut-off events. [2023-09-01 12:34:20,744 INFO L131 PetriNetUnfolder]: For 272053/272053 co-relation queries the response was YES. [2023-09-01 12:34:20,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79466 conditions, 7938 events. 4901/7938 cut-off events. For 272053/272053 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 50868 event pairs, 1404 based on Foata normal form. 28/7954 useless extension candidates. Maximal degree in co-relation 78732. Up to 4394 conditions per place. [2023-09-01 12:34:20,825 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 342 selfloop transitions, 199 changer transitions 9/550 dead transitions. [2023-09-01 12:34:20,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 550 transitions, 12680 flow [2023-09-01 12:34:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:34:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:34:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 631 transitions. [2023-09-01 12:34:20,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492583918813427 [2023-09-01 12:34:20,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 631 transitions. [2023-09-01 12:34:20,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 631 transitions. [2023-09-01 12:34:20,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:34:20,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 631 transitions. [2023-09-01 12:34:20,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:20,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:20,829 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:20,829 INFO L175 Difference]: Start difference. First operand has 221 places, 470 transitions, 10391 flow. Second operand 7 states and 631 transitions. [2023-09-01 12:34:20,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 550 transitions, 12680 flow [2023-09-01 12:34:22,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 550 transitions, 12476 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-09-01 12:34:22,022 INFO L231 Difference]: Finished difference. Result has 229 places, 487 transitions, 11205 flow [2023-09-01 12:34:22,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=10187, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11205, PETRI_PLACES=229, PETRI_TRANSITIONS=487} [2023-09-01 12:34:22,022 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 200 predicate places. [2023-09-01 12:34:22,023 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 487 transitions, 11205 flow [2023-09-01 12:34:22,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:22,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:34:22,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:34:22,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-09-01 12:34:22,023 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:34:22,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:34:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1649157417, now seen corresponding path program 7 times [2023-09-01 12:34:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:34:22,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788281167] [2023-09-01 12:34:22,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:34:22,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:34:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:34:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788281167] [2023-09-01 12:34:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788281167] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:34:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065184827] [2023-09-01 12:34:22,169 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-09-01 12:34:22,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:34:22,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:34:22,173 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:34:22,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-09-01 12:34:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:22,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 12:34:22,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:34:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:22,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:34:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:22,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065184827] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:34:22,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:34:22,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-09-01 12:34:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611891296] [2023-09-01 12:34:22,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:34:22,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 12:34:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:34:22,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 12:34:22,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-09-01 12:34:22,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-09-01 12:34:22,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 487 transitions, 11205 flow. Second operand has 12 states, 12 states have (on average 81.75) internal successors, (981), 12 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:22,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:34:22,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-09-01 12:34:22,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:34:24,986 INFO L130 PetriNetUnfolder]: 5901/9619 cut-off events. [2023-09-01 12:34:24,987 INFO L131 PetriNetUnfolder]: For 357552/357552 co-relation queries the response was YES. [2023-09-01 12:34:25,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99918 conditions, 9619 events. 5901/9619 cut-off events. For 357552/357552 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 64270 event pairs, 1196 based on Foata normal form. 38/9645 useless extension candidates. Maximal degree in co-relation 98882. Up to 3807 conditions per place. [2023-09-01 12:34:25,087 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 381 selfloop transitions, 308 changer transitions 5/694 dead transitions. [2023-09-01 12:34:25,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 694 transitions, 15953 flow [2023-09-01 12:34:25,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 12:34:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 12:34:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1108 transitions. [2023-09-01 12:34:25,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045537340619308 [2023-09-01 12:34:25,089 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1108 transitions. [2023-09-01 12:34:25,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1108 transitions. [2023-09-01 12:34:25,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:34:25,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1108 transitions. [2023-09-01 12:34:25,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.33333333333333) internal successors, (1108), 12 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:25,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:25,092 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:25,093 INFO L175 Difference]: Start difference. First operand has 229 places, 487 transitions, 11205 flow. Second operand 12 states and 1108 transitions. [2023-09-01 12:34:25,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 694 transitions, 15953 flow [2023-09-01 12:34:26,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 694 transitions, 15465 flow, removed 114 selfloop flow, removed 7 redundant places. [2023-09-01 12:34:26,855 INFO L231 Difference]: Finished difference. Result has 236 places, 550 transitions, 13306 flow [2023-09-01 12:34:26,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=10803, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13306, PETRI_PLACES=236, PETRI_TRANSITIONS=550} [2023-09-01 12:34:26,856 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 207 predicate places. [2023-09-01 12:34:26,857 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 550 transitions, 13306 flow [2023-09-01 12:34:26,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.75) internal successors, (981), 12 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:26,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:34:26,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:34:26,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-09-01 12:34:27,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:34:27,063 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:34:27,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:34:27,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2115353481, now seen corresponding path program 3 times [2023-09-01 12:34:27,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:34:27,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751115510] [2023-09-01 12:34:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:34:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:34:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:27,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:34:27,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751115510] [2023-09-01 12:34:27,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751115510] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:34:27,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:34:27,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 12:34:27,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496252463] [2023-09-01 12:34:27,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:34:27,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 12:34:27,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:34:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 12:34:27,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 12:34:27,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 183 [2023-09-01 12:34:27,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 550 transitions, 13306 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:27,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:34:27,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 183 [2023-09-01 12:34:27,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:34:29,607 INFO L130 PetriNetUnfolder]: 5874/9560 cut-off events. [2023-09-01 12:34:29,607 INFO L131 PetriNetUnfolder]: For 363827/363827 co-relation queries the response was YES. [2023-09-01 12:34:29,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100686 conditions, 9560 events. 5874/9560 cut-off events. For 363827/363827 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 63500 event pairs, 1670 based on Foata normal form. 12/9560 useless extension candidates. Maximal degree in co-relation 99471. Up to 4343 conditions per place. [2023-09-01 12:34:29,690 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 485 selfloop transitions, 136 changer transitions 14/635 dead transitions. [2023-09-01 12:34:29,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 635 transitions, 15759 flow [2023-09-01 12:34:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:34:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:34:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 635 transitions. [2023-09-01 12:34:29,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957064793130367 [2023-09-01 12:34:29,691 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 635 transitions. [2023-09-01 12:34:29,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 635 transitions. [2023-09-01 12:34:29,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:34:29,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 635 transitions. [2023-09-01 12:34:29,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:29,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:29,694 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:29,694 INFO L175 Difference]: Start difference. First operand has 236 places, 550 transitions, 13306 flow. Second operand 7 states and 635 transitions. [2023-09-01 12:34:29,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 635 transitions, 15759 flow [2023-09-01 12:34:31,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 635 transitions, 15478 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-09-01 12:34:31,262 INFO L231 Difference]: Finished difference. Result has 243 places, 550 transitions, 13350 flow [2023-09-01 12:34:31,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=13035, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13350, PETRI_PLACES=243, PETRI_TRANSITIONS=550} [2023-09-01 12:34:31,262 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 214 predicate places. [2023-09-01 12:34:31,262 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 550 transitions, 13350 flow [2023-09-01 12:34:31,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:34:31,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:34:31,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:34:31,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-09-01 12:34:31,263 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:34:31,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:34:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1122867685, now seen corresponding path program 10 times [2023-09-01 12:34:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:34:31,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699123343] [2023-09-01 12:34:31,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:34:31,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:34:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:34:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:31,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:34:31,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699123343] [2023-09-01 12:34:31,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699123343] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:34:31,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16949266] [2023-09-01 12:34:31,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 12:34:31,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:34:31,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:34:31,389 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:34:31,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-09-01 12:34:31,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 12:34:31,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:34:31,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2023-09-01 12:34:31,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:34:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:31,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:34:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:34:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16949266] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:34:39,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:34:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 18 [2023-09-01 12:34:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37007031] [2023-09-01 12:34:39,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:34:39,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-09-01 12:34:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:34:39,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-09-01 12:34:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=236, Unknown=4, NotChecked=0, Total=306 [2023-09-01 12:34:41,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:34:44,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:34:46,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:34:48,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:34:50,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:34:52,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:34:54,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:34:56,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:34:58,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:00,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:02,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:04,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:06,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:08,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:10,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:12,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:14,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:16,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:18,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:20,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:22,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:22,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 183 [2023-09-01 12:35:22,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 550 transitions, 13350 flow. Second operand has 18 states, 18 states have (on average 75.5) internal successors, (1359), 18 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:35:22,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:35:22,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 183 [2023-09-01 12:35:22,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:35:29,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:31,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:33,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:35,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:37,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:39,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:40,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:42,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:45,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:47,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:49,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:51,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:53,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:55,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:57,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:35:59,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:01,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:03,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:05,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:07,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:09,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:11,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:13,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:17,504 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) (.cse0 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (and (= c_~x_3~0 0) (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse1 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 .cse0) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse1) (< .cse1 0) (let ((.cse3 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse2 (* (div .cse3 4294967296) 4294967296)) .cse3)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (or (let ((.cse4 (* 4294967295 c_~a~0))) (< (+ .cse2 (* (div .cse4 4294967296) 4294967296)) .cse4)) (< .cse0 (mod c_~a~0 4294967296))))) is different from false [2023-09-01 12:36:19,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:21,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:23,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:25,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:27,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:29,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:31,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:33,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:35,909 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (= c_~x_3~0 0) (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse0) (< .cse0 0) (let ((.cse2 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse1 (* (div .cse2 4294967296) 4294967296)) .cse2)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (let ((.cse3 (* 4294967295 c_~a~0))) (< (+ .cse1 (* (div .cse3 4294967296) 4294967296)) .cse3)))) is different from false [2023-09-01 12:36:38,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:40,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:42,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:44,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:46,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:48,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:50,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:52,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:54,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:56,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:36:58,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:00,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:02,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:04,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:06,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:08,409 WARN L839 $PredicateComparison]: unable to prove that (and (<= (div (+ c_~b~0 c_~a~0) 4294967296) (div (+ (- 1) c_~b~0 c_~a~0) 4294967296)) (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse0) (< .cse0 0) (let ((.cse1 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (mod c_thread2Thread1of1ForFork2_~i~1 4294967296) (* (div .cse1 4294967296) 4294967296)) .cse1)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296))))) is different from false [2023-09-01 12:37:21,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:23,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:29,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:31,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:33,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:35,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:37,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:39,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:41,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:43,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:45,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:47,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:49,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:51,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:53,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:55,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:57,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:37:57,771 INFO L130 PetriNetUnfolder]: 10243/16542 cut-off events. [2023-09-01 12:37:57,771 INFO L131 PetriNetUnfolder]: For 636950/636950 co-relation queries the response was YES. [2023-09-01 12:37:57,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171735 conditions, 16542 events. 10243/16542 cut-off events. For 636950/636950 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 119531 event pairs, 1526 based on Foata normal form. 72/16602 useless extension candidates. Maximal degree in co-relation 171303. Up to 6307 conditions per place. [2023-09-01 12:37:57,933 INFO L137 encePairwiseOnDemand]: 166/183 looper letters, 685 selfloop transitions, 635 changer transitions 6/1326 dead transitions. [2023-09-01 12:37:57,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1326 transitions, 29406 flow [2023-09-01 12:37:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-09-01 12:37:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-09-01 12:37:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3223 transitions. [2023-09-01 12:37:57,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634742594190394 [2023-09-01 12:37:57,937 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3223 transitions. [2023-09-01 12:37:57,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3223 transitions. [2023-09-01 12:37:57,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:37:57,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3223 transitions. [2023-09-01 12:37:57,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 84.8157894736842) internal successors, (3223), 38 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:37:57,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 183.0) internal successors, (7137), 39 states have internal predecessors, (7137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:37:57,950 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 183.0) internal successors, (7137), 39 states have internal predecessors, (7137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:37:57,950 INFO L175 Difference]: Start difference. First operand has 243 places, 550 transitions, 13350 flow. Second operand 38 states and 3223 transitions. [2023-09-01 12:37:57,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1326 transitions, 29406 flow [2023-09-01 12:38:01,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 1326 transitions, 29038 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-09-01 12:38:01,123 INFO L231 Difference]: Finished difference. Result has 301 places, 913 transitions, 23466 flow [2023-09-01 12:38:01,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=13052, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=322, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=23466, PETRI_PLACES=301, PETRI_TRANSITIONS=913} [2023-09-01 12:38:01,124 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 272 predicate places. [2023-09-01 12:38:01,124 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 913 transitions, 23466 flow [2023-09-01 12:38:01,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 75.5) internal successors, (1359), 18 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:01,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:38:01,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:38:01,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-09-01 12:38:01,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:38:01,325 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:38:01,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:38:01,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1922737153, now seen corresponding path program 11 times [2023-09-01 12:38:01,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:38:01,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611598568] [2023-09-01 12:38:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:38:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:38:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:38:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:38:01,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:38:01,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611598568] [2023-09-01 12:38:01,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611598568] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:38:01,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538592323] [2023-09-01 12:38:01,437 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 12:38:01,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:38:01,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:38:01,441 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:38:01,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-09-01 12:38:01,549 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 12:38:01,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:38:01,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 12:38:01,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:38:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:38:01,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:38:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:38:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538592323] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:38:01,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:38:01,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 15 [2023-09-01 12:38:01,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290993853] [2023-09-01 12:38:01,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:38:01,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-01 12:38:01,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:38:01,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-01 12:38:01,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-09-01 12:38:02,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-09-01 12:38:02,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 913 transitions, 23466 flow. Second operand has 15 states, 15 states have (on average 81.4) internal successors, (1221), 15 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:02,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:38:02,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-09-01 12:38:02,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:38:10,027 INFO L130 PetriNetUnfolder]: 14049/22993 cut-off events. [2023-09-01 12:38:10,027 INFO L131 PetriNetUnfolder]: For 1338013/1338013 co-relation queries the response was YES. [2023-09-01 12:38:10,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288597 conditions, 22993 events. 14049/22993 cut-off events. For 1338013/1338013 co-relation queries the response was YES. Maximal size of possible extension queue 1437. Compared 178128 event pairs, 2110 based on Foata normal form. 68/23049 useless extension candidates. Maximal degree in co-relation 287820. Up to 10424 conditions per place. [2023-09-01 12:38:10,360 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 819 selfloop transitions, 760 changer transitions 6/1585 dead transitions. [2023-09-01 12:38:10,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 1585 transitions, 40200 flow [2023-09-01 12:38:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-09-01 12:38:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-09-01 12:38:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2255 transitions. [2023-09-01 12:38:10,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492896174863388 [2023-09-01 12:38:10,363 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2255 transitions. [2023-09-01 12:38:10,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2255 transitions. [2023-09-01 12:38:10,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:38:10,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2255 transitions. [2023-09-01 12:38:10,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 90.2) internal successors, (2255), 25 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:10,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 183.0) internal successors, (4758), 26 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:10,370 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 183.0) internal successors, (4758), 26 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:10,370 INFO L175 Difference]: Start difference. First operand has 301 places, 913 transitions, 23466 flow. Second operand 25 states and 2255 transitions. [2023-09-01 12:38:10,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 1585 transitions, 40200 flow [2023-09-01 12:38:22,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 1585 transitions, 37461 flow, removed 1176 selfloop flow, removed 4 redundant places. [2023-09-01 12:38:22,036 INFO L231 Difference]: Finished difference. Result has 341 places, 1161 transitions, 31112 flow [2023-09-01 12:38:22,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=22043, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=549, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=31112, PETRI_PLACES=341, PETRI_TRANSITIONS=1161} [2023-09-01 12:38:22,037 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 312 predicate places. [2023-09-01 12:38:22,037 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 1161 transitions, 31112 flow [2023-09-01 12:38:22,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 81.4) internal successors, (1221), 15 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:22,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:38:22,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:38:22,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-09-01 12:38:22,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:38:22,238 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:38:22,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:38:22,239 INFO L85 PathProgramCache]: Analyzing trace with hash -158440847, now seen corresponding path program 8 times [2023-09-01 12:38:22,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:38:22,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837078331] [2023-09-01 12:38:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:38:22,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:38:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:38:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:38:22,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:38:22,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837078331] [2023-09-01 12:38:22,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837078331] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:38:22,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:38:22,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 12:38:22,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471119546] [2023-09-01 12:38:22,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:38:22,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 12:38:22,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:38:22,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 12:38:22,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 12:38:22,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 183 [2023-09-01 12:38:22,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 1161 transitions, 31112 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:22,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:38:22,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 183 [2023-09-01 12:38:22,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:38:31,543 INFO L130 PetriNetUnfolder]: 13982/22883 cut-off events. [2023-09-01 12:38:31,543 INFO L131 PetriNetUnfolder]: For 1749289/1749289 co-relation queries the response was YES. [2023-09-01 12:38:31,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306833 conditions, 22883 events. 13982/22883 cut-off events. For 1749289/1749289 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 177548 event pairs, 4822 based on Foata normal form. 36/22907 useless extension candidates. Maximal degree in co-relation 305997. Up to 16202 conditions per place. [2023-09-01 12:38:31,893 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 1037 selfloop transitions, 179 changer transitions 16/1232 dead transitions. [2023-09-01 12:38:31,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1232 transitions, 34778 flow [2023-09-01 12:38:31,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:38:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:38:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 645 transitions. [2023-09-01 12:38:31,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035128805620609 [2023-09-01 12:38:31,894 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 645 transitions. [2023-09-01 12:38:31,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 645 transitions. [2023-09-01 12:38:31,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:38:31,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 645 transitions. [2023-09-01 12:38:31,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:31,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:31,897 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:31,897 INFO L175 Difference]: Start difference. First operand has 341 places, 1161 transitions, 31112 flow. Second operand 7 states and 645 transitions. [2023-09-01 12:38:31,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 1232 transitions, 34778 flow [2023-09-01 12:38:44,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 1232 transitions, 32829 flow, removed 488 selfloop flow, removed 5 redundant places. [2023-09-01 12:38:44,980 INFO L231 Difference]: Finished difference. Result has 346 places, 1165 transitions, 29726 flow [2023-09-01 12:38:44,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=29130, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=29726, PETRI_PLACES=346, PETRI_TRANSITIONS=1165} [2023-09-01 12:38:44,981 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 317 predicate places. [2023-09-01 12:38:44,981 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 1165 transitions, 29726 flow [2023-09-01 12:38:44,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:44,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:38:44,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:38:44,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-09-01 12:38:44,982 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:38:44,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:38:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1715774453, now seen corresponding path program 9 times [2023-09-01 12:38:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:38:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377061654] [2023-09-01 12:38:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:38:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:38:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:38:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:38:45,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:38:45,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377061654] [2023-09-01 12:38:45,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377061654] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:38:45,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:38:45,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 12:38:45,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567951419] [2023-09-01 12:38:45,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:38:45,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 12:38:45,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:38:45,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 12:38:45,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 12:38:45,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 183 [2023-09-01 12:38:45,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 1165 transitions, 29726 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:45,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:38:45,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 183 [2023-09-01 12:38:45,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:38:53,772 INFO L130 PetriNetUnfolder]: 13819/22577 cut-off events. [2023-09-01 12:38:53,772 INFO L131 PetriNetUnfolder]: For 1590948/1590948 co-relation queries the response was YES. [2023-09-01 12:38:53,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294022 conditions, 22577 events. 13819/22577 cut-off events. For 1590948/1590948 co-relation queries the response was YES. Maximal size of possible extension queue 1410. Compared 174433 event pairs, 4799 based on Foata normal form. 78/22643 useless extension candidates. Maximal degree in co-relation 293870. Up to 16202 conditions per place. [2023-09-01 12:38:54,080 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 1029 selfloop transitions, 182 changer transitions 15/1226 dead transitions. [2023-09-01 12:38:54,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 1226 transitions, 33151 flow [2023-09-01 12:38:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:38:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:38:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 645 transitions. [2023-09-01 12:38:54,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035128805620609 [2023-09-01 12:38:54,081 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 645 transitions. [2023-09-01 12:38:54,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 645 transitions. [2023-09-01 12:38:54,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:38:54,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 645 transitions. [2023-09-01 12:38:54,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:54,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:54,084 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:38:54,084 INFO L175 Difference]: Start difference. First operand has 346 places, 1165 transitions, 29726 flow. Second operand 7 states and 645 transitions. [2023-09-01 12:38:54,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 1226 transitions, 33151 flow [2023-09-01 12:39:04,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1226 transitions, 32809 flow, removed 40 selfloop flow, removed 2 redundant places. [2023-09-01 12:39:04,902 INFO L231 Difference]: Finished difference. Result has 351 places, 1160 transitions, 29650 flow [2023-09-01 12:39:04,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=29255, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=29650, PETRI_PLACES=351, PETRI_TRANSITIONS=1160} [2023-09-01 12:39:04,903 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 322 predicate places. [2023-09-01 12:39:04,903 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 1160 transitions, 29650 flow [2023-09-01 12:39:04,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:39:04,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:39:04,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:39:04,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-09-01 12:39:04,904 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:39:04,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:39:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1045000087, now seen corresponding path program 10 times [2023-09-01 12:39:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:39:04,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713973394] [2023-09-01 12:39:04,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:39:04,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:39:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:39:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:39:05,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:39:05,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713973394] [2023-09-01 12:39:05,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713973394] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:39:05,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197638382] [2023-09-01 12:39:05,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 12:39:05,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:39:05,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:39:05,023 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:39:05,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-09-01 12:39:05,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 12:39:05,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:39:05,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2023-09-01 12:39:05,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:39:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:39:05,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:39:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:39:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197638382] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:39:19,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:39:19,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-09-01 12:39:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130904151] [2023-09-01 12:39:19,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:39:19,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 12:39:19,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:39:19,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 12:39:19,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=85, Unknown=7, NotChecked=0, Total=132 [2023-09-01 12:39:21,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:39:23,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:39:25,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:39:25,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 183 [2023-09-01 12:39:25,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1160 transitions, 29650 flow. Second operand has 12 states, 12 states have (on average 78.25) internal successors, (939), 12 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:39:25,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:39:25,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 183 [2023-09-01 12:39:25,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:39:38,576 INFO L130 PetriNetUnfolder]: 13769/22450 cut-off events. [2023-09-01 12:39:38,576 INFO L131 PetriNetUnfolder]: For 1583519/1583519 co-relation queries the response was YES. [2023-09-01 12:39:38,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292813 conditions, 22450 events. 13769/22450 cut-off events. For 1583519/1583519 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 172482 event pairs, 4797 based on Foata normal form. 8/22446 useless extension candidates. Maximal degree in co-relation 292659. Up to 16206 conditions per place. [2023-09-01 12:39:39,005 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 1016 selfloop transitions, 190 changer transitions 1/1207 dead transitions. [2023-09-01 12:39:39,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 1207 transitions, 32970 flow [2023-09-01 12:39:39,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:39:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:39:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 606 transitions. [2023-09-01 12:39:39,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47306791569086654 [2023-09-01 12:39:39,006 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 606 transitions. [2023-09-01 12:39:39,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 606 transitions. [2023-09-01 12:39:39,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:39:39,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 606 transitions. [2023-09-01 12:39:39,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:39:39,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:39:39,009 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:39:39,009 INFO L175 Difference]: Start difference. First operand has 351 places, 1160 transitions, 29650 flow. Second operand 7 states and 606 transitions. [2023-09-01 12:39:39,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 1207 transitions, 32970 flow [2023-09-01 12:39:50,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 1207 transitions, 32573 flow, removed 30 selfloop flow, removed 4 redundant places. [2023-09-01 12:39:50,357 INFO L231 Difference]: Finished difference. Result has 352 places, 1163 transitions, 29751 flow [2023-09-01 12:39:50,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=29233, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=29751, PETRI_PLACES=352, PETRI_TRANSITIONS=1163} [2023-09-01 12:39:50,358 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 323 predicate places. [2023-09-01 12:39:50,358 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 1163 transitions, 29751 flow [2023-09-01 12:39:50,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 78.25) internal successors, (939), 12 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:39:50,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:39:50,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 12:39:50,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-09-01 12:39:50,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-09-01 12:39:50,559 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 12:39:50,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:39:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2133347175, now seen corresponding path program 12 times [2023-09-01 12:39:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:39:50,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31618071] [2023-09-01 12:39:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:39:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:39:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:39:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:39:50,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:39:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31618071] [2023-09-01 12:39:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31618071] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 12:39:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642017413] [2023-09-01 12:39:50,706 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 12:39:50,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 12:39:50,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:39:50,709 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 12:39:50,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-09-01 12:39:50,827 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-09-01 12:39:50,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 12:39:50,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 12:39:50,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 12:39:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:39:50,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 12:39:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:39:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642017413] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 12:39:53,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 12:39:53,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2023-09-01 12:39:53,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836994366] [2023-09-01 12:39:53,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 12:39:53,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 12:39:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:39:53,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 12:39:53,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-09-01 12:39:55,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:39:57,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:39:59,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:01,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:03,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:05,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:07,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:07,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 183 [2023-09-01 12:40:07,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 1163 transitions, 29751 flow. Second operand has 16 states, 16 states have (on average 79.25) internal successors, (1268), 16 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:40:07,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:40:07,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 183 [2023-09-01 12:40:07,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:40:09,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:11,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:13,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:15,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:17,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:19,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:21,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:23,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:25,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:27,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:29,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:31,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:33,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:35,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:38,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:40,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:42,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:44,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:46,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:48,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:50,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:52,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:54,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:56,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:40:58,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:00,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:02,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:04,620 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) (.cse0 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse1 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 .cse0) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse1) (< .cse1 0) (let ((.cse3 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse2 (* (div .cse3 4294967296) 4294967296)) .cse3)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (or (let ((.cse4 (* 4294967295 c_~a~0))) (< (+ .cse2 (* (div .cse4 4294967296) 4294967296)) .cse4)) (< .cse0 (mod c_~a~0 4294967296))))) is different from false [2023-09-01 12:41:06,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:08,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:10,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:12,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:14,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:16,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:19,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:21,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:23,293 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse0) (< .cse0 0) (let ((.cse2 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse1 (* (div .cse2 4294967296) 4294967296)) .cse2)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (let ((.cse3 (* 4294967295 c_~a~0))) (< (+ .cse1 (* (div .cse3 4294967296) 4294967296)) .cse3)))) is different from false [2023-09-01 12:41:25,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:27,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:29,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:31,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:33,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:35,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:37,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:39,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:41,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:43,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:45,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:47,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:49,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:51,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:53,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:55,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:57,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:41:59,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:01,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:03,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:05,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:07,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:09,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:12,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:14,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:16,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:18,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:20,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:22,862 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse0) (< .cse0 0) (let ((.cse2 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse1 (* (div .cse2 4294967296) 4294967296)) .cse2)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (let ((.cse3 (* 4294967295 c_~a~0))) (< (+ (* (div (+ .cse3 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296)) 4294967296) 4294967296) .cse1) .cse3)))) is different from false [2023-09-01 12:42:25,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:27,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:29,710 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse0) (< .cse0 0) (let ((.cse2 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse1 (* (div .cse2 4294967296) 4294967296)) .cse2)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (< .cse1 (mod c_~b~0 4294967296)) (let ((.cse3 (* 4294967295 c_~a~0))) (< (+ (* (div (+ .cse3 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296)) 4294967296) 4294967296) .cse1) .cse3)))) is different from false [2023-09-01 12:42:33,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:36,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:38,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:40,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:42,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:44,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 12:42:46,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Killed by 15