./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/popl20-two-queue.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 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 04:01:30,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 04:01:30,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 04:01:30,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 04:01:30,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 04:01:30,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 04:01:30,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 04:01:30,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 04:01:30,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 04:01:30,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 04:01:30,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 04:01:30,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 04:01:30,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 04:01:30,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 04:01:30,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 04:01:30,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 04:01:30,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 04:01:30,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 04:01:30,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 04:01:30,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 04:01:30,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 04:01:30,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 04:01:30,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 04:01:30,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 04:01:30,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 04:01:30,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 04:01:30,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 04:01:30,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 04:01:30,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 04:01:30,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 04:01:30,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 04:01:30,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 04:01:30,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 04:01:30,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 04:01:30,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 04:01:30,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 04:01:30,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 04:01:30,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 04:01:30,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 04:01:30,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 04:01:30,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 04:01:30,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 04:01:30,207 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 04:01:30,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 04:01:30,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 04:01:30,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 04:01:30,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 04:01:30,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 04:01:30,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 04:01:30,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 04:01:30,210 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 04:01:30,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 04:01:30,211 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 04:01:30,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 04:01:30,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 04:01:30,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 04:01:30,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 04:01:30,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 04:01:30,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 04:01:30,212 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 04:01:30,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 04:01:30,213 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 04:01:30,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 04:01:30,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 04:01:30,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 04:01:30,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 04:01:30,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 04:01:30,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 04:01:30,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 04:01:30,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 04:01:30,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 04:01:30,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 04:01:30,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 04:01:30,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 04:01:30,215 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 04:01:30,216 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 04:01:30,216 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 04:01:30,216 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 -> 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 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 -> TOGETHER [2023-08-31 04:01:30,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 04:01:30,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 04:01:30,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 04:01:30,551 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 04:01:30,551 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 04:01:30,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-08-31 04:01:31,664 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 04:01:31,855 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 04:01:31,856 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-08-31 04:01:31,863 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1783f2d/ae9271d40b6a4a16a49667d248b0bc56/FLAG645eb2ce6 [2023-08-31 04:01:31,879 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1783f2d/ae9271d40b6a4a16a49667d248b0bc56 [2023-08-31 04:01:31,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 04:01:31,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 04:01:31,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 04:01:31,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 04:01:31,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 04:01:31,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:01:31" (1/1) ... [2023-08-31 04:01:31,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b716da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:31, skipping insertion in model container [2023-08-31 04:01:31,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:01:31" (1/1) ... [2023-08-31 04:01:31,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 04:01:31,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 04:01:32,063 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/popl20-two-queue.wvr.c[2987,3000] [2023-08-31 04:01:32,075 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 04:01:32,084 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 04:01:32,102 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/popl20-two-queue.wvr.c[2987,3000] [2023-08-31 04:01:32,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 04:01:32,112 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 04:01:32,112 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 04:01:32,118 INFO L208 MainTranslator]: Completed translation [2023-08-31 04:01:32,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32 WrapperNode [2023-08-31 04:01:32,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 04:01:32,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 04:01:32,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 04:01:32,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 04:01:32,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,179 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 207 [2023-08-31 04:01:32,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 04:01:32,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 04:01:32,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 04:01:32,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 04:01:32,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,228 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 04:01:32,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 04:01:32,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 04:01:32,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 04:01:32,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (1/1) ... [2023-08-31 04:01:32,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 04:01:32,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:01:32,266 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-08-31 04:01:32,290 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-08-31 04:01:32,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 04:01:32,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 04:01:32,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 04:01:32,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 04:01:32,304 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 04:01:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 04:01:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 04:01:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 04:01:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 04:01:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 04:01:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 04:01:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 04:01:32,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 04:01:32,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 04:01:32,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 04:01:32,307 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 04:01:32,418 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 04:01:32,419 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 04:01:32,781 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 04:01:32,925 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 04:01:32,926 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-31 04:01:32,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:01:32 BoogieIcfgContainer [2023-08-31 04:01:32,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 04:01:32,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 04:01:32,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 04:01:32,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 04:01:32,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 04:01:31" (1/3) ... [2023-08-31 04:01:32,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e638c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 04:01:32, skipping insertion in model container [2023-08-31 04:01:32,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:01:32" (2/3) ... [2023-08-31 04:01:32,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e638c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 04:01:32, skipping insertion in model container [2023-08-31 04:01:32,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:01:32" (3/3) ... [2023-08-31 04:01:32,935 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-08-31 04:01:32,942 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 04:01:32,949 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 04:01:32,949 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 04:01:32,949 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 04:01:33,024 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 04:01:33,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 170 transitions, 356 flow [2023-08-31 04:01:33,144 INFO L130 PetriNetUnfolder]: 13/168 cut-off events. [2023-08-31 04:01:33,144 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 04:01:33,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 13/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-08-31 04:01:33,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 170 transitions, 356 flow [2023-08-31 04:01:33,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 160 transitions, 332 flow [2023-08-31 04:01:33,162 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 04:01:33,169 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 160 transitions, 332 flow [2023-08-31 04:01:33,173 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 160 transitions, 332 flow [2023-08-31 04:01:33,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 160 transitions, 332 flow [2023-08-31 04:01:33,215 INFO L130 PetriNetUnfolder]: 13/160 cut-off events. [2023-08-31 04:01:33,215 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 04:01:33,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 160 events. 13/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-08-31 04:01:33,220 INFO L119 LiptonReduction]: Number of co-enabled transitions 500 [2023-08-31 04:01:38,403 INFO L134 LiptonReduction]: Checked pairs total: 763 [2023-08-31 04:01:38,403 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-08-31 04:01:38,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 04:01:38,421 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;@65fe2efe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 04:01:38,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-31 04:01:38,426 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2023-08-31 04:01:38,426 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 04:01:38,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:01:38,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:01:38,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:01:38,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:01:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash 219698779, now seen corresponding path program 1 times [2023-08-31 04:01:38,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:01:38,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791493839] [2023-08-31 04:01:38,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:01:38,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:01:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:01:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:01:38,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:01:38,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791493839] [2023-08-31 04:01:38,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791493839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 04:01:38,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 04:01:38,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 04:01:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295130073] [2023-08-31 04:01:38,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 04:01:38,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 04:01:38,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:01:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 04:01:38,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 04:01:39,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-08-31 04:01:39,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:01:39,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-08-31 04:01:39,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:01:39,081 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2023-08-31 04:01:39,081 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-31 04:01:39,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 410 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2023-08-31 04:01:39,084 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-08-31 04:01:39,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2023-08-31 04:01:39,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 04:01:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 04:01:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-08-31 04:01:39,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750499001996008 [2023-08-31 04:01:39,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-08-31 04:01:39,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-08-31 04:01:39,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:01:39,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-08-31 04:01:39,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,123 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 476 transitions. [2023-08-31 04:01:39,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2023-08-31 04:01:39,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 04:01:39,127 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2023-08-31 04:01:39,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2023-08-31 04:01:39,133 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2023-08-31 04:01:39,133 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2023-08-31 04:01:39,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:01:39,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:01:39,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 04:01:39,137 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:01:39,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:01:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1594831125, now seen corresponding path program 1 times [2023-08-31 04:01:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:01:39,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981680823] [2023-08-31 04:01:39,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:01:39,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:01:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:01:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:01:39,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:01:39,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981680823] [2023-08-31 04:01:39,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981680823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 04:01:39,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 04:01:39,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 04:01:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124480014] [2023-08-31 04:01:39,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 04:01:39,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 04:01:39,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:01:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 04:01:39,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 04:01:39,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-08-31 04:01:39,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:01:39,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-08-31 04:01:39,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:01:39,458 INFO L130 PetriNetUnfolder]: 102/194 cut-off events. [2023-08-31 04:01:39,458 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-31 04:01:39,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 194 events. 102/194 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 653 event pairs, 9 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 114. Up to 76 conditions per place. [2023-08-31 04:01:39,461 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 41 selfloop transitions, 6 changer transitions 1/48 dead transitions. [2023-08-31 04:01:39,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 48 transitions, 224 flow [2023-08-31 04:01:39,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 04:01:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 04:01:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2023-08-31 04:01:39,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4616766467065868 [2023-08-31 04:01:39,464 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 771 transitions. [2023-08-31 04:01:39,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 771 transitions. [2023-08-31 04:01:39,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:01:39,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 771 transitions. [2023-08-31 04:01:39,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.2) internal successors, (771), 5 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,470 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,470 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 5 states and 771 transitions. [2023-08-31 04:01:39,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 48 transitions, 224 flow [2023-08-31 04:01:39,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 48 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 04:01:39,473 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 99 flow [2023-08-31 04:01:39,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2023-08-31 04:01:39,474 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2023-08-31 04:01:39,474 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 99 flow [2023-08-31 04:01:39,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:01:39,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:01:39,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 04:01:39,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:01:39,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:01:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash -723769805, now seen corresponding path program 2 times [2023-08-31 04:01:39,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:01:39,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687567448] [2023-08-31 04:01:39,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:01:39,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:01:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:01:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:01:39,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:01:39,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687567448] [2023-08-31 04:01:39,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687567448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 04:01:39,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 04:01:39,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 04:01:39,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931970324] [2023-08-31 04:01:39,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 04:01:39,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 04:01:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:01:39,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 04:01:39,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 04:01:39,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-08-31 04:01:39,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:01:39,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-08-31 04:01:39,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:01:39,696 INFO L130 PetriNetUnfolder]: 89/165 cut-off events. [2023-08-31 04:01:39,696 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-08-31 04:01:39,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 165 events. 89/165 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 15 based on Foata normal form. 6/169 useless extension candidates. Maximal degree in co-relation 192. Up to 120 conditions per place. [2023-08-31 04:01:39,701 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 26 selfloop transitions, 3 changer transitions 10/39 dead transitions. [2023-08-31 04:01:39,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 227 flow [2023-08-31 04:01:39,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 04:01:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 04:01:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2023-08-31 04:01:39,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595808383233533 [2023-08-31 04:01:39,703 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 614 transitions. [2023-08-31 04:01:39,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 614 transitions. [2023-08-31 04:01:39,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:01:39,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 614 transitions. [2023-08-31 04:01:39,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,709 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,709 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 99 flow. Second operand 4 states and 614 transitions. [2023-08-31 04:01:39,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 227 flow [2023-08-31 04:01:39,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 04:01:39,713 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 110 flow [2023-08-31 04:01:39,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-08-31 04:01:39,715 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-08-31 04:01:39,717 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 110 flow [2023-08-31 04:01:39,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:01:39,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:01:39,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 04:01:39,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:01:39,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:01:39,719 INFO L85 PathProgramCache]: Analyzing trace with hash 521491958, now seen corresponding path program 1 times [2023-08-31 04:01:39,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:01:39,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329753945] [2023-08-31 04:01:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:01:39,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:01:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:01:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:01:39,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:01:39,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329753945] [2023-08-31 04:01:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329753945] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 04:01:39,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 04:01:39,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 04:01:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826141308] [2023-08-31 04:01:39,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 04:01:39,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 04:01:39,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:01:39,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 04:01:39,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 04:01:39,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-08-31 04:01:39,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:01:39,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-08-31 04:01:39,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:01:39,921 INFO L130 PetriNetUnfolder]: 98/173 cut-off events. [2023-08-31 04:01:39,921 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2023-08-31 04:01:39,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 173 events. 98/173 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 474 event pairs, 18 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 214. Up to 122 conditions per place. [2023-08-31 04:01:39,923 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 32 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-08-31 04:01:39,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 236 flow [2023-08-31 04:01:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 04:01:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 04:01:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2023-08-31 04:01:39,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4538922155688623 [2023-08-31 04:01:39,927 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2023-08-31 04:01:39,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2023-08-31 04:01:39,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:01:39,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2023-08-31 04:01:39,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,933 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,933 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 110 flow. Second operand 5 states and 758 transitions. [2023-08-31 04:01:39,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 236 flow [2023-08-31 04:01:39,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 214 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-31 04:01:39,938 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 112 flow [2023-08-31 04:01:39,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2023-08-31 04:01:39,939 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-08-31 04:01:39,939 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 112 flow [2023-08-31 04:01:39,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:39,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:01:39,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:01:39,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 04:01:39,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:01:39,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:01:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash -44837542, now seen corresponding path program 1 times [2023-08-31 04:01:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:01:39,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133763867] [2023-08-31 04:01:39,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:01:39,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:01:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:01:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:01:40,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:01:40,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133763867] [2023-08-31 04:01:40,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133763867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 04:01:40,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 04:01:40,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 04:01:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983036302] [2023-08-31 04:01:40,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 04:01:40,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 04:01:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:01:40,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 04:01:40,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 04:01:40,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 334 [2023-08-31 04:01:40,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:01:40,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 334 [2023-08-31 04:01:40,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:01:40,177 INFO L130 PetriNetUnfolder]: 102/188 cut-off events. [2023-08-31 04:01:40,178 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2023-08-31 04:01:40,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 188 events. 102/188 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 492 event pairs, 61 based on Foata normal form. 8/192 useless extension candidates. Maximal degree in co-relation 308. Up to 174 conditions per place. [2023-08-31 04:01:40,179 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 24 selfloop transitions, 2 changer transitions 8/34 dead transitions. [2023-08-31 04:01:40,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 205 flow [2023-08-31 04:01:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 04:01:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 04:01:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2023-08-31 04:01:40,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476047904191617 [2023-08-31 04:01:40,182 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2023-08-31 04:01:40,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2023-08-31 04:01:40,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:01:40,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2023-08-31 04:01:40,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,187 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,187 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 112 flow. Second operand 4 states and 598 transitions. [2023-08-31 04:01:40,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 205 flow [2023-08-31 04:01:40,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 04:01:40,190 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 120 flow [2023-08-31 04:01:40,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-08-31 04:01:40,192 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 10 predicate places. [2023-08-31 04:01:40,192 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 120 flow [2023-08-31 04:01:40,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:01:40,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:01:40,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 04:01:40,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:01:40,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:01:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1961656, now seen corresponding path program 1 times [2023-08-31 04:01:40,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:01:40,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558447854] [2023-08-31 04:01:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:01:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:01:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:01:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 04:01:40,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:01:40,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558447854] [2023-08-31 04:01:40,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558447854] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 04:01:40,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 04:01:40,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 04:01:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510118435] [2023-08-31 04:01:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 04:01:40,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 04:01:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:01:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 04:01:40,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 04:01:40,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 334 [2023-08-31 04:01:40,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:01:40,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 334 [2023-08-31 04:01:40,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:01:40,403 INFO L130 PetriNetUnfolder]: 99/183 cut-off events. [2023-08-31 04:01:40,403 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-08-31 04:01:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 183 events. 99/183 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 479 event pairs, 59 based on Foata normal form. 8/188 useless extension candidates. Maximal degree in co-relation 616. Up to 175 conditions per place. [2023-08-31 04:01:40,405 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 25 selfloop transitions, 2 changer transitions 6/33 dead transitions. [2023-08-31 04:01:40,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 207 flow [2023-08-31 04:01:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 04:01:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 04:01:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2023-08-31 04:01:40,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44610778443113774 [2023-08-31 04:01:40,407 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 596 transitions. [2023-08-31 04:01:40,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 596 transitions. [2023-08-31 04:01:40,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:01:40,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 596 transitions. [2023-08-31 04:01:40,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,412 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,412 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 120 flow. Second operand 4 states and 596 transitions. [2023-08-31 04:01:40,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 207 flow [2023-08-31 04:01:40,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 199 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-31 04:01:40,415 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 132 flow [2023-08-31 04:01:40,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-31 04:01:40,417 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2023-08-31 04:01:40,417 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 132 flow [2023-08-31 04:01:40,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:01:40,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] [2023-08-31 04:01:40,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 04:01:40,418 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:01:40,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:01:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1784763123, now seen corresponding path program 1 times [2023-08-31 04:01:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:01:40,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408936065] [2023-08-31 04:01:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:01:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:01:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:01:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 04:01:40,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:01:40,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408936065] [2023-08-31 04:01:40,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408936065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 04:01:40,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 04:01:40,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 04:01:40,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787857795] [2023-08-31 04:01:40,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 04:01:40,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 04:01:40,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:01:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 04:01:40,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 04:01:40,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-08-31 04:01:40,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:01:40,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-08-31 04:01:40,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:01:40,624 INFO L130 PetriNetUnfolder]: 77/140 cut-off events. [2023-08-31 04:01:40,624 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2023-08-31 04:01:40,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 140 events. 77/140 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 327 event pairs, 19 based on Foata normal form. 4/143 useless extension candidates. Maximal degree in co-relation 487. Up to 123 conditions per place. [2023-08-31 04:01:40,625 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 26 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-08-31 04:01:40,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 198 flow [2023-08-31 04:01:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 04:01:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 04:01:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-31 04:01:40,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660678642714571 [2023-08-31 04:01:40,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-31 04:01:40,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-31 04:01:40,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:01:40,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-31 04:01:40,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,633 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 132 flow. Second operand 3 states and 467 transitions. [2023-08-31 04:01:40,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 198 flow [2023-08-31 04:01:40,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 186 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-31 04:01:40,635 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 139 flow [2023-08-31 04:01:40,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-31 04:01:40,635 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2023-08-31 04:01:40,636 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 139 flow [2023-08-31 04:01:40,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:01:40,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:01:40,637 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-08-31 04:01:40,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 04:01:40,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:01:40,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:01:40,637 INFO L85 PathProgramCache]: Analyzing trace with hash 761354163, now seen corresponding path program 2 times [2023-08-31 04:01:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:01:40,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770775089] [2023-08-31 04:01:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:01:40,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:01:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:01:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:01:41,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:01:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770775089] [2023-08-31 04:01:41,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770775089] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:01:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462561927] [2023-08-31 04:01:41,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 04:01:41,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:01:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:01:41,885 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-08-31 04:01:41,911 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-08-31 04:01:41,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 04:01:41,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:01:42,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-31 04:01:42,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:01:42,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 04:01:42,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:01:42,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:01:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 04:01:42,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:01:43,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:01:43,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2023-08-31 04:01:43,484 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-31 04:01:43,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1112 treesize of output 1048 [2023-08-31 04:01:43,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:01:43,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 502 treesize of output 462 [2023-08-31 04:01:43,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:01:43,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 402 [2023-08-31 04:02:12,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:02:12,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 80 [2023-08-31 04:02:12,517 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-08-31 04:02:12,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 550 treesize of output 493 [2023-08-31 04:02:12,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:02:12,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:02:12,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:02:12,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 470 treesize of output 366 [2023-08-31 04:02:12,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:02:12,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:02:12,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:02:12,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 350 treesize of output 306 [2023-08-31 04:02:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 04:02:12,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462561927] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:02:12,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:02:12,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2023-08-31 04:02:12,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972116439] [2023-08-31 04:02:12,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:02:12,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-31 04:02:12,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:02:12,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-31 04:02:12,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=760, Unknown=1, NotChecked=0, Total=870 [2023-08-31 04:02:14,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-08-31 04:02:14,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 139 flow. Second operand has 30 states, 30 states have (on average 82.76666666666667) internal successors, (2483), 30 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:02:14,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:02:14,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-08-31 04:02:14,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:02:22,785 INFO L130 PetriNetUnfolder]: 244/446 cut-off events. [2023-08-31 04:02:22,786 INFO L131 PetriNetUnfolder]: For 530/530 co-relation queries the response was YES. [2023-08-31 04:02:22,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 446 events. 244/446 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1739 event pairs, 6 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 1404. Up to 173 conditions per place. [2023-08-31 04:02:22,789 INFO L137 encePairwiseOnDemand]: 323/334 looper letters, 76 selfloop transitions, 58 changer transitions 2/136 dead transitions. [2023-08-31 04:02:22,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 136 transitions, 907 flow [2023-08-31 04:02:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-31 04:02:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-31 04:02:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2316 transitions. [2023-08-31 04:02:22,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25681969394544246 [2023-08-31 04:02:22,805 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2316 transitions. [2023-08-31 04:02:22,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2316 transitions. [2023-08-31 04:02:22,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:02:22,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2316 transitions. [2023-08-31 04:02:22,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 85.77777777777777) internal successors, (2316), 27 states have internal predecessors, (2316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:02:22,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 334.0) internal successors, (9352), 28 states have internal predecessors, (9352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:02:22,825 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 334.0) internal successors, (9352), 28 states have internal predecessors, (9352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:02:22,826 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 139 flow. Second operand 27 states and 2316 transitions. [2023-08-31 04:02:22,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 136 transitions, 907 flow [2023-08-31 04:02:22,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 136 transitions, 887 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-31 04:02:22,831 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 664 flow [2023-08-31 04:02:22,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=664, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2023-08-31 04:02:22,832 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2023-08-31 04:02:22,833 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 664 flow [2023-08-31 04:02:22,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 82.76666666666667) internal successors, (2483), 30 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:02:22,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:02:22,834 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-08-31 04:02:22,846 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-08-31 04:02:23,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:02:23,040 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:02:23,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:02:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1927973413, now seen corresponding path program 3 times [2023-08-31 04:02:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:02:23,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079381335] [2023-08-31 04:02:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:02:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:02:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:02:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:02:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:02:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079381335] [2023-08-31 04:02:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079381335] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:02:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831361825] [2023-08-31 04:02:24,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 04:02:24,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:02:24,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:02:24,293 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-08-31 04:02:24,297 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-08-31 04:02:24,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 04:02:24,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:02:24,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 73 conjunts are in the unsatisfiable core [2023-08-31 04:02:24,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:02:24,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:02:24,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:02:24,444 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 04:02:24,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-31 04:02:24,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 04:02:24,599 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 04:02:24,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-31 04:02:24,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 04:02:24,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:02:24,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:02:25,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 20 [2023-08-31 04:02:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:02:25,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:02:26,760 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-08-31 04:02:26,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 88 [2023-08-31 04:02:26,831 INFO L321 Elim1Store]: treesize reduction 4, result has 94.7 percent of original size [2023-08-31 04:02:26,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 480 treesize of output 499 [2023-08-31 04:02:26,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:02:26,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 174 [2023-08-31 04:02:26,915 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:02:26,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 153 [2023-08-31 04:02:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:02:29,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831361825] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:02:29,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:02:29,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-08-31 04:02:29,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335116276] [2023-08-31 04:02:29,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:02:29,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 04:02:29,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:02:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 04:02:29,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1163, Unknown=6, NotChecked=0, Total=1332 [2023-08-31 04:02:31,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-31 04:02:31,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 664 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:02:31,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:02:31,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-31 04:02:31,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:02:36,705 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse40 (* c_~q2_front~0 4))) (let ((.cse12 (select |c_#memory_int| c_~q2~0.base)) (.cse18 (+ c_~q2~0.offset .cse40))) (let ((.cse9 (select |c_#memory_int| c_~q1~0.base)) (.cse19 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse41 (* c_~q2_back~0 4)) (.cse15 (select .cse12 .cse18))) (let ((.cse7 (< .cse15 c_~i~0)) (.cse13 (+ .cse41 c_~q2~0.offset)) (.cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse2 (+ c_~i~0 1)) (.cse27 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse26 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (< c_~q1_back~0 0)) (.cse14 (select .cse9 .cse19)) (.cse6 (< (+ .cse15 1) c_~N~0)) (.cse8 (<= c_~n2~0 c_~q2_front~0)) (.cse5 (< c_~q2_front~0 0))) (and (or (< 0 c_~q2_front~0) .cse0 .cse1 (and (< c_~j~0 .cse2) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse3 .cse4 .cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (or (and (or .cse6 .cse7) (or (< c_~i~0 (+ c_~N~0 1)) .cse6)) .cse8 .cse5) (or (not (= (select .cse9 .cse10) c_~j~0)) .cse0 .cse1 .cse11 .cse4 .cse8 .cse5 (not (= c_~i~0 (select .cse12 .cse13))) (and (or (< .cse14 .cse2) .cse7) (or (< .cse15 .cse2) (< .cse14 c_~i~0)))) (or .cse0 .cse1 .cse11 .cse4 .cse8 .cse5 (and (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse16 (select .cse20 c_~q1~0.base)) (.cse17 (select .cse20 c_~q2~0.base))) (or (not (= c_~j~0 (select .cse16 .cse10))) (< (select .cse17 .cse18) .cse2) (< (select .cse16 .cse19) c_~i~0) (not (= c_~i~0 (select .cse17 .cse13))))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse22 (select .cse23 c_~q1~0.base)) (.cse21 (select .cse23 c_~q2~0.base))) (or (< (select .cse21 .cse18) c_~i~0) (< (select .cse22 .cse19) .cse2) (not (= c_~j~0 (select .cse22 .cse10))) (not (= c_~i~0 (select .cse21 .cse13))))))))) (or .cse0 .cse1 .cse11 .cse3 .cse4 .cse8 .cse5 (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse30 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse29 .cse30 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse24 (select .cse28 c_~q1~0.base))) (or (not (= (select .cse24 .cse10) c_~j~0)) (< (select .cse25 .cse26) .cse2) (not (= (select .cse25 .cse27) c_~i~0)) (< (select .cse24 .cse19) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse29 .cse30 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse31 (select .cse33 c_~q1~0.base)) (.cse32 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse31 .cse10) c_~j~0)) (< (select .cse31 .cse19) .cse2) (not (= (select .cse32 .cse27) c_~i~0)) (< (select .cse32 .cse26) c_~i~0)))))))) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse35 (select .cse36 c_~q1~0.base)) (.cse34 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse34 .cse27) c_~i~0)) (not (= (select .cse35 .cse10) c_~j~0)) (< (select .cse35 .cse19) c_~i~0) (< (select .cse34 .cse26) .cse2))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse37 (select .cse39 c_~q1~0.base)) (.cse38 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse37 .cse19) .cse2) (not (= (select .cse38 .cse27) c_~i~0)) (not (= (select .cse37 .cse10) c_~j~0)) (< (select .cse38 .cse26) c_~i~0)))))) .cse11 .cse4 .cse8 .cse5) (or (and (or (< .cse15 c_~N~0) (< (+ .cse14 1) c_~N~0)) (or (< .cse14 c_~N~0) .cse6)) .cse8 .cse5)))))) is different from false [2023-08-31 04:02:38,113 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse40 (* c_~q2_front~0 4))) (let ((.cse12 (select |c_#memory_int| c_~q2~0.base)) (.cse18 (+ c_~q2~0.offset .cse40))) (let ((.cse9 (select |c_#memory_int| c_~q1~0.base)) (.cse19 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse41 (* c_~q2_back~0 4)) (.cse15 (select .cse12 .cse18))) (let ((.cse7 (< .cse15 c_~i~0)) (.cse13 (+ .cse41 c_~q2~0.offset)) (.cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse2 (+ c_~i~0 1)) (.cse27 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse26 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (< c_~q1_back~0 0)) (.cse14 (select .cse9 .cse19)) (.cse6 (< (+ .cse15 1) c_~N~0)) (.cse8 (<= c_~n2~0 c_~q2_front~0)) (.cse5 (< c_~q2_front~0 0))) (and (or (< 0 c_~q2_front~0) .cse0 .cse1 (and (< c_~j~0 .cse2) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse3 .cse4 .cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (or (and (or .cse6 .cse7) (or (< c_~i~0 (+ c_~N~0 1)) .cse6)) .cse8 .cse5) (or (not (= (select .cse9 .cse10) c_~j~0)) .cse0 .cse1 .cse11 .cse4 .cse8 .cse5 (not (= c_~i~0 (select .cse12 .cse13))) (and (or (< .cse14 .cse2) .cse7) (or (< .cse15 .cse2) (< .cse14 c_~i~0)))) (<= 1 c_~N~0) (<= c_~j~0 c_~i~0) (<= c_~j~0 c_~N~0) (or .cse0 .cse1 .cse11 .cse4 .cse8 .cse5 (and (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse16 (select .cse20 c_~q1~0.base)) (.cse17 (select .cse20 c_~q2~0.base))) (or (not (= c_~j~0 (select .cse16 .cse10))) (< (select .cse17 .cse18) .cse2) (< (select .cse16 .cse19) c_~i~0) (not (= c_~i~0 (select .cse17 .cse13))))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse22 (select .cse23 c_~q1~0.base)) (.cse21 (select .cse23 c_~q2~0.base))) (or (< (select .cse21 .cse18) c_~i~0) (< (select .cse22 .cse19) .cse2) (not (= c_~j~0 (select .cse22 .cse10))) (not (= c_~i~0 (select .cse21 .cse13))))))))) (or .cse0 .cse1 .cse11 .cse3 .cse4 .cse8 .cse5 (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse30 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse29 .cse30 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse24 (select .cse28 c_~q1~0.base))) (or (not (= (select .cse24 .cse10) c_~j~0)) (< (select .cse25 .cse26) .cse2) (not (= (select .cse25 .cse27) c_~i~0)) (< (select .cse24 .cse19) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse29 .cse30 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse31 (select .cse33 c_~q1~0.base)) (.cse32 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse31 .cse10) c_~j~0)) (< (select .cse31 .cse19) .cse2) (not (= (select .cse32 .cse27) c_~i~0)) (< (select .cse32 .cse26) c_~i~0)))))))) (<= c_~N~0 c_~i~0) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse35 (select .cse36 c_~q1~0.base)) (.cse34 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse34 .cse27) c_~i~0)) (not (= (select .cse35 .cse10) c_~j~0)) (< (select .cse35 .cse19) c_~i~0) (< (select .cse34 .cse26) .cse2))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse37 (select .cse39 c_~q1~0.base)) (.cse38 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse37 .cse19) .cse2) (not (= (select .cse38 .cse27) c_~i~0)) (not (= (select .cse37 .cse10) c_~j~0)) (< (select .cse38 .cse26) c_~i~0)))))) .cse11 .cse4 .cse8 .cse5) (or (and (or (< .cse15 c_~N~0) (< (+ .cse14 1) c_~N~0)) (or (< .cse14 c_~N~0) .cse6)) .cse8 .cse5) (<= c_~i~0 1) (<= 1 c_~j~0)))))) is different from false [2023-08-31 04:02:39,864 INFO L130 PetriNetUnfolder]: 502/934 cut-off events. [2023-08-31 04:02:39,864 INFO L131 PetriNetUnfolder]: For 2821/2821 co-relation queries the response was YES. [2023-08-31 04:02:39,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 934 events. 502/934 cut-off events. For 2821/2821 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4635 event pairs, 26 based on Foata normal form. 5/932 useless extension candidates. Maximal degree in co-relation 3469. Up to 286 conditions per place. [2023-08-31 04:02:39,873 INFO L137 encePairwiseOnDemand]: 318/334 looper letters, 111 selfloop transitions, 181 changer transitions 13/305 dead transitions. [2023-08-31 04:02:39,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 305 transitions, 2678 flow [2023-08-31 04:02:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-08-31 04:02:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-08-31 04:02:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 4218 transitions. [2023-08-31 04:02:39,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2476224022543149 [2023-08-31 04:02:39,889 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 4218 transitions. [2023-08-31 04:02:39,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 4218 transitions. [2023-08-31 04:02:39,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:02:39,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 4218 transitions. [2023-08-31 04:02:39,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 82.70588235294117) internal successors, (4218), 51 states have internal predecessors, (4218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:02:39,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 334.0) internal successors, (17368), 52 states have internal predecessors, (17368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:02:39,919 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 334.0) internal successors, (17368), 52 states have internal predecessors, (17368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:02:39,920 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 664 flow. Second operand 51 states and 4218 transitions. [2023-08-31 04:02:39,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 305 transitions, 2678 flow [2023-08-31 04:02:39,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 305 transitions, 2362 flow, removed 141 selfloop flow, removed 4 redundant places. [2023-08-31 04:02:39,940 INFO L231 Difference]: Finished difference. Result has 130 places, 204 transitions, 2000 flow [2023-08-31 04:02:39,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=2000, PETRI_PLACES=130, PETRI_TRANSITIONS=204} [2023-08-31 04:02:39,941 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 108 predicate places. [2023-08-31 04:02:39,941 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 204 transitions, 2000 flow [2023-08-31 04:02:39,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:02:39,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:02:39,943 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-08-31 04:02:39,949 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-08-31 04:02:40,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-08-31 04:02:40,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:02:40,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:02:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1880605723, now seen corresponding path program 4 times [2023-08-31 04:02:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:02:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912170933] [2023-08-31 04:02:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:02:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:02:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:02:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:02:41,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:02:41,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912170933] [2023-08-31 04:02:41,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912170933] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:02:41,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544735925] [2023-08-31 04:02:41,168 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 04:02:41,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:02:41,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:02:41,170 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-08-31 04:02:41,176 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-08-31 04:02:41,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 04:02:41,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:02:41,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-31 04:02:41,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:02:41,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:02:41,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:02:41,289 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 04:02:41,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-31 04:02:41,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 04:02:41,449 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 04:02:41,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-31 04:02:41,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 04:02:41,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:02:41,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:02:41,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2023-08-31 04:02:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:02:42,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:02:47,462 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-08-31 04:02:47,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-08-31 04:02:47,593 INFO L321 Elim1Store]: treesize reduction 4, result has 97.3 percent of original size [2023-08-31 04:02:47,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 477 treesize of output 563 [2023-08-31 04:02:47,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:02:47,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 248 [2023-08-31 04:02:47,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:02:47,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 242 [2023-08-31 04:03:08,649 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-08-31 04:03:08,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-08-31 04:03:08,769 INFO L321 Elim1Store]: treesize reduction 5, result has 96.6 percent of original size [2023-08-31 04:03:08,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 477 treesize of output 562 [2023-08-31 04:03:08,807 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 04:03:08,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:03:08,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 252 [2023-08-31 04:03:08,858 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 04:03:08,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:03:08,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 210 [2023-08-31 04:03:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:03:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544735925] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:03:21,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:03:21,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-08-31 04:03:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185914176] [2023-08-31 04:03:21,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:03:21,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 04:03:21,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:03:21,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 04:03:21,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1154, Unknown=11, NotChecked=0, Total=1332 [2023-08-31 04:03:23,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-31 04:03:23,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 204 transitions, 2000 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:03:23,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:03:23,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-31 04:03:23,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:03:28,324 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (+ c_~i~0 1))) (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse7 (<= c_~n2~0 c_~q2_back~0)) (.cse19 (* c_~q2_front~0 4)) (.cse20 (* c_~q2_back~0 4)) (.cse14 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse11 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse3 (< c_~q1_back~0 0)) (.cse4 (< c_~j~0 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 (let ((.cse5 (< 0 c_~q2_back~0)) (.cse6 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|))))) (and (or (and .cse4 (= c_~q1_back~0 c_~q1_front~0)) .cse5 .cse6) (or .cse5 (= c_~q2_front~0 c_~q2_back~0) .cse6 (< c_~j~0 c_~i~0))))) (<= c_~i~0 c_~j~0) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse7 .cse3 (let ((.cse9 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_247 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_246) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_247))) (let ((.cse8 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse10 (select .cse15 c_~q1~0.base))) (or (not (= (select .cse8 .cse9) c_~i~0)) (not (= c_~j~0 (select .cse10 .cse11))) (< (select .cse8 .cse12) .cse13) (< (select .cse10 .cse14) c_~i~0))))) (forall ((v_ArrVal_247 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_246) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_247))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse17 (select .cse18 c_~q1~0.base))) (or (not (= (select .cse16 .cse9) c_~i~0)) (not (= c_~j~0 (select .cse17 .cse11))) (< (select .cse16 .cse12) c_~i~0) (< (select .cse17 .cse14) .cse13)))))))) (or .cse0 .cse1 .cse7 (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse25 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 (+ .cse25 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_244)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_246) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_247))) (let ((.cse22 (select .cse23 c_~q1~0.base)) (.cse21 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~i~0 (select .cse21 (+ .cse20 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= c_~j~0 (select .cse22 .cse11))) (< (select .cse22 .cse14) c_~i~0) (< (select .cse21 (+ .cse19 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse13))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 (+ .cse25 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_244)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_246) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_247))) (let ((.cse26 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse27 (select .cse28 c_~q1~0.base))) (or (< (select .cse26 (+ .cse19 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= c_~i~0 (select .cse26 (+ .cse20 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select .cse27 .cse14) .cse13) (not (= c_~j~0 (select .cse27 .cse11))))))))) .cse2 .cse3) .cse4))) is different from false [2023-08-31 04:03:30,851 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-08-31 04:03:32,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 04:03:39,584 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-08-31 04:03:53,253 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-08-31 04:03:55,427 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-08-31 04:03:57,501 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-08-31 04:03:59,796 INFO L130 PetriNetUnfolder]: 603/1130 cut-off events. [2023-08-31 04:03:59,796 INFO L131 PetriNetUnfolder]: For 5862/5862 co-relation queries the response was YES. [2023-08-31 04:03:59,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6562 conditions, 1130 events. 603/1130 cut-off events. For 5862/5862 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5879 event pairs, 30 based on Foata normal form. 12/1140 useless extension candidates. Maximal degree in co-relation 6513. Up to 460 conditions per place. [2023-08-31 04:03:59,806 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 126 selfloop transitions, 233 changer transitions 18/377 dead transitions. [2023-08-31 04:03:59,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 377 transitions, 4160 flow [2023-08-31 04:03:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-08-31 04:03:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-08-31 04:03:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 4927 transitions. [2023-08-31 04:03:59,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24585828343313373 [2023-08-31 04:03:59,818 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 4927 transitions. [2023-08-31 04:03:59,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 4927 transitions. [2023-08-31 04:03:59,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:03:59,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 4927 transitions. [2023-08-31 04:03:59,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 82.11666666666666) internal successors, (4927), 60 states have internal predecessors, (4927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:03:59,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 334.0) internal successors, (20374), 61 states have internal predecessors, (20374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:03:59,864 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 334.0) internal successors, (20374), 61 states have internal predecessors, (20374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:03:59,864 INFO L175 Difference]: Start difference. First operand has 130 places, 204 transitions, 2000 flow. Second operand 60 states and 4927 transitions. [2023-08-31 04:03:59,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 377 transitions, 4160 flow [2023-08-31 04:03:59,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 377 transitions, 3704 flow, removed 182 selfloop flow, removed 15 redundant places. [2023-08-31 04:03:59,908 INFO L231 Difference]: Finished difference. Result has 180 places, 265 transitions, 2835 flow [2023-08-31 04:03:59,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=2835, PETRI_PLACES=180, PETRI_TRANSITIONS=265} [2023-08-31 04:03:59,909 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 158 predicate places. [2023-08-31 04:03:59,909 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 265 transitions, 2835 flow [2023-08-31 04:03:59,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:03:59,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:03:59,911 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-08-31 04:03:59,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-31 04:04:00,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:04:00,117 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:04:00,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:04:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash 226074675, now seen corresponding path program 5 times [2023-08-31 04:04:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:04:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89771297] [2023-08-31 04:04:00,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:04:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:04:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:04:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:04:01,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:04:01,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89771297] [2023-08-31 04:04:01,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89771297] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:04:01,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379095634] [2023-08-31 04:04:01,085 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 04:04:01,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:04:01,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:04:01,087 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-08-31 04:04:01,088 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-08-31 04:04:01,199 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-31 04:04:01,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:04:01,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 71 conjunts are in the unsatisfiable core [2023-08-31 04:04:01,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:04:01,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:04:01,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:04:01,229 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 04:04:01,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-31 04:04:01,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 04:04:01,353 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 04:04:01,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-31 04:04:01,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:04:01,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:04:01,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:04:01,981 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 04:04:01,994 INFO L321 Elim1Store]: treesize reduction 77, result has 8.3 percent of original size [2023-08-31 04:04:01,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 26 [2023-08-31 04:04:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:04:02,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:04:03,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:04:03,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 75 [2023-08-31 04:04:03,772 INFO L321 Elim1Store]: treesize reduction 4, result has 90.7 percent of original size [2023-08-31 04:04:03,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 594 treesize of output 604 [2023-08-31 04:04:03,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:04:03,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 426 treesize of output 398 [2023-08-31 04:04:03,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:04:03,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 362 treesize of output 366 [2023-08-31 04:04:03,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:04:03,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 275 treesize of output 295 [2023-08-31 04:04:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:04:15,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379095634] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:04:15,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:04:15,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-08-31 04:04:15,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392266779] [2023-08-31 04:04:15,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:04:15,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 04:04:15,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:04:15,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 04:04:15,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1109, Unknown=9, NotChecked=0, Total=1332 [2023-08-31 04:04:17,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-08-31 04:04:17,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 265 transitions, 2835 flow. Second operand has 37 states, 37 states have (on average 80.48648648648648) internal successors, (2978), 37 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:04:17,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:04:17,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-08-31 04:04:17,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:04:17,328 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse42 (* c_~q2_front~0 4))) (let ((.cse6 (+ c_~q2~0.offset .cse42))) (let ((.cse29 (select (select |c_#memory_int| c_~q2~0.base) .cse6)) (.cse31 (select |c_#memory_int| c_~q1~0.base)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse41 (* c_~q2_back~0 4))) (let ((.cse26 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse7 (+ .cse41 c_~q2~0.offset)) (.cse27 (<= c_~q2_back~0 c_~q2_front~0)) (.cse32 (select .cse31 .cse10)) (.cse28 (< (+ .cse29 1) c_~N~0)) (.cse30 (<= c_~n2~0 c_~q2_front~0)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (<= c_~n1~0 c_~q1_front~0)) (.cse2 (< c_~q1_front~0 0)) (.cse3 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (< c_~q1_back~0 0)) (.cse16 (< c_~q2_back~0 c_~q2_front~0)) (.cse17 (< c_~q2_front~0 0)) (.cse11 (+ c_~i~0 1)) (.cse12 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse20 (+ .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (forall ((v_ArrVal_293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse9 (select .cse8 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse5 (select .cse8 ~q2~0.base))) (or (< (select .cse5 .cse6) c_~i~0) (not (= (select .cse5 .cse7) c_~i~0))))) (< (select .cse9 .cse10) .cse11) (not (= c_~j~0 (select .cse9 .cse12))))))) (forall ((v_ArrVal_293 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse13 (select .cse15 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse13 .cse12))) (forall ((~q2~0.base Int)) (let ((.cse14 (select .cse15 ~q2~0.base))) (or (< (select .cse14 .cse6) .cse11) (not (= (select .cse14 .cse7) c_~i~0))))) (< (select .cse13 .cse10) c_~i~0)))))) .cse16 .cse17) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse22 (select .cse21 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse18 (select .cse21 ~q2~0.base))) (or (not (= c_~i~0 (select .cse18 .cse19))) (< (select .cse18 .cse20) .cse11)))) (< (select .cse22 .cse10) c_~i~0) (not (= c_~j~0 (select .cse22 .cse12))))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse23 (select .cse25 c_~q1~0.base))) (or (< (select .cse23 .cse10) .cse11) (forall ((~q2~0.base Int)) (let ((.cse24 (select .cse25 ~q2~0.base))) (or (not (= c_~i~0 (select .cse24 .cse19))) (< (select .cse24 .cse20) c_~i~0)))) (not (= c_~j~0 (select .cse23 .cse12)))))))) .cse3 .cse26 .cse4 .cse16 .cse17) (or .cse0 .cse1 .cse2 (and (< c_~j~0 .cse11) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse26 .cse4 .cse16 .cse17 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97|) 0)))) (= c_~j~0 c_~i~0) (or .cse27 (and (or .cse28 (< .cse29 c_~i~0)) (or (< c_~i~0 (+ c_~N~0 1)) .cse28)) .cse30 .cse17) (or (not (= (select .cse31 .cse12) c_~j~0)) .cse0 .cse1 .cse2 .cse3 .cse4 (and (or (< .cse32 .cse11) (forall ((~q2~0.base Int)) (let ((.cse33 (select |c_#memory_int| ~q2~0.base))) (or (< (select .cse33 .cse6) c_~i~0) (not (= (select .cse33 .cse7) c_~i~0)))))) (or (forall ((~q2~0.base Int)) (let ((.cse34 (select |c_#memory_int| ~q2~0.base))) (or (< (select .cse34 .cse6) .cse11) (not (= (select .cse34 .cse7) c_~i~0))))) (< .cse32 c_~i~0))) .cse16 .cse17) (or .cse27 .cse1 (and (or (< .cse29 c_~N~0) (< (+ .cse32 1) c_~N~0)) (or (< .cse32 c_~N~0) .cse28)) .cse2 .cse30 .cse17) (or .cse0 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 .cse16 .cse17 (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse37 (select .cse36 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse35 (select .cse36 ~q2~0.base))) (or (< (select .cse35 .cse20) .cse11) (not (= c_~i~0 (select .cse35 .cse19)))))) (not (= c_~j~0 (select .cse37 .cse12))) (< (select .cse37 .cse10) c_~i~0))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse38 (select .cse40 c_~q1~0.base))) (or (< (select .cse38 .cse10) .cse11) (not (= c_~j~0 (select .cse38 .cse12))) (forall ((~q2~0.base Int)) (let ((.cse39 (select .cse40 ~q2~0.base))) (or (< (select .cse39 .cse20) c_~i~0) (not (= c_~i~0 (select .cse39 .cse19))))))))))))))))) is different from false [2023-08-31 04:04:18,195 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (<= c_~n1~0 c_~q1_front~0)) (.cse2 (< c_~q1_front~0 0)) (.cse14 (<= c_~n2~0 c_~q2_back~0)) (.cse15 (< c_~q1_back~0 0)) (.cse16 (< c_~q2_back~0 c_~q2_front~0)) (.cse17 (< c_~q2_front~0 0)) (.cse9 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse6 (+ c_~i~0 1)) (.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse5 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse8 (select .cse7 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse3 (select .cse7 ~q2~0.base))) (or (not (= c_~i~0 (select .cse3 .cse4))) (< (select .cse3 .cse5) .cse6)))) (< (select .cse8 .cse9) c_~i~0) (not (= c_~j~0 (select .cse8 .cse10))))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse11 (select .cse13 c_~q1~0.base))) (or (< (select .cse11 .cse9) .cse6) (forall ((~q2~0.base Int)) (let ((.cse12 (select .cse13 ~q2~0.base))) (or (not (= c_~i~0 (select .cse12 .cse4))) (< (select .cse12 .cse5) c_~i~0)))) (not (= c_~j~0 (select .cse11 .cse10)))))))) .cse14 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse15 .cse16 .cse17 (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse20 (select .cse19 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse18 (select .cse19 ~q2~0.base))) (or (< (select .cse18 .cse5) .cse6) (not (= c_~i~0 (select .cse18 .cse4)))))) (not (= c_~j~0 (select .cse20 .cse10))) (< (select .cse20 .cse9) c_~i~0))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse21 (select .cse23 c_~q1~0.base))) (or (< (select .cse21 .cse9) .cse6) (not (= c_~j~0 (select .cse21 .cse10))) (forall ((~q2~0.base Int)) (let ((.cse22 (select .cse23 ~q2~0.base))) (or (< (select .cse22 .cse5) c_~i~0) (not (= c_~i~0 (select .cse22 .cse4)))))))))))))) is different from false [2023-08-31 04:04:37,840 WARN L222 SmtUtils]: Spent 9.32s on a formula simplification. DAG size of input: 210 DAG size of output: 173 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 04:04:59,552 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse41 (* c_~q2_front~0 4)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse40 (* c_~q2_back~0 4))) (let ((.cse26 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse7 (+ .cse40 c_~q2~0.offset)) (.cse29 (select (select |c_#memory_int| c_~q1~0.base) .cse10)) (.cse28 (select |c_#memory_int| c_~q2~0.base)) (.cse6 (+ c_~q2~0.offset .cse41)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (<= c_~n1~0 c_~q1_front~0)) (.cse2 (< c_~q1_front~0 0)) (.cse3 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (< c_~q1_back~0 0)) (.cse16 (< c_~q2_back~0 c_~q2_front~0)) (.cse17 (< c_~q2_front~0 0)) (.cse11 (+ c_~i~0 1)) (.cse12 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse20 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (= c_~q2~0.offset 0) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (forall ((v_ArrVal_293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse9 (select .cse8 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse5 (select .cse8 ~q2~0.base))) (or (< (select .cse5 .cse6) c_~i~0) (not (= (select .cse5 .cse7) c_~i~0))))) (< (select .cse9 .cse10) .cse11) (not (= c_~j~0 (select .cse9 .cse12))))))) (forall ((v_ArrVal_293 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse13 (select .cse15 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse13 .cse12))) (forall ((~q2~0.base Int)) (let ((.cse14 (select .cse15 ~q2~0.base))) (or (< (select .cse14 .cse6) .cse11) (not (= (select .cse14 .cse7) c_~i~0))))) (< (select .cse13 .cse10) c_~i~0)))))) .cse16 .cse17) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse22 (select .cse21 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse18 (select .cse21 ~q2~0.base))) (or (not (= c_~i~0 (select .cse18 .cse19))) (< (select .cse18 .cse20) .cse11)))) (< (select .cse22 .cse10) c_~i~0) (not (= c_~j~0 (select .cse22 .cse12))))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse23 (select .cse25 c_~q1~0.base))) (or (< (select .cse23 .cse10) .cse11) (forall ((~q2~0.base Int)) (let ((.cse24 (select .cse25 ~q2~0.base))) (or (not (= c_~i~0 (select .cse24 .cse19))) (< (select .cse24 .cse20) c_~i~0)))) (not (= c_~j~0 (select .cse23 .cse12)))))))) .cse3 .cse26 .cse4 .cse16 .cse17) (or .cse0 .cse1 .cse2 (and (< c_~j~0 .cse11) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse26 .cse4 .cse16 .cse17 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97|) 0)))) (exists ((v_~q2_back~0_87 Int)) (let ((.cse27 (select .cse28 (* v_~q2_back~0_87 4)))) (and (< v_~q2_back~0_87 c_~n2~0) (<= v_~q2_back~0_87 c_~q2_front~0) (< .cse27 c_~N~0) (<= 0 .cse27) (<= 0 v_~q2_back~0_87) (<= c_~q2_back~0 (+ v_~q2_back~0_87 1))))) (or .cse1 .cse2 .cse3 (and (or (< .cse29 .cse11) (forall ((~q2~0.base Int)) (let ((.cse30 (select |c_#memory_int| ~q2~0.base))) (or (< (select .cse30 .cse6) c_~i~0) (not (= (select .cse30 .cse7) c_~i~0)))))) (or (forall ((~q2~0.base Int)) (let ((.cse31 (select |c_#memory_int| ~q2~0.base))) (or (< (select .cse31 .cse6) .cse11) (not (= (select .cse31 .cse7) c_~i~0))))) (< .cse29 c_~i~0))) .cse16 .cse17) (or (<= c_~q2_back~0 c_~q2_front~0) .cse1 (let ((.cse32 (select .cse28 .cse6))) (and (or (< .cse32 c_~N~0) (< (+ .cse29 1) c_~N~0)) (or (< .cse29 c_~N~0) (< (+ .cse32 1) c_~N~0)))) .cse2 (<= c_~n2~0 c_~q2_front~0) .cse17) (<= c_~n2~0 1) (exists ((~q1~0.offset Int) (v_~q1_back~0_91 Int) (~q1~0.base Int) (v_~q1_front~0_77 Int)) (let ((.cse33 (select |c_#memory_int| ~q1~0.base))) (and (<= 0 v_~q1_front~0_77) (<= c_~i~0 (+ (select .cse33 (+ ~q1~0.offset (* 4 v_~q1_front~0_77))) 1)) (<= v_~q1_back~0_91 0) (<= v_~q1_front~0_77 v_~q1_back~0_91) (<= (select .cse33 (+ ~q1~0.offset (* 4 v_~q1_back~0_91))) 0)))) (or .cse0 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 .cse16 .cse17 (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse36 (select .cse35 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse34 (select .cse35 ~q2~0.base))) (or (< (select .cse34 .cse20) .cse11) (not (= c_~i~0 (select .cse34 .cse19)))))) (not (= c_~j~0 (select .cse36 .cse12))) (< (select .cse36 .cse10) c_~i~0))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse37 (select .cse39 c_~q1~0.base))) (or (< (select .cse37 .cse10) .cse11) (not (= c_~j~0 (select .cse37 .cse12))) (forall ((~q2~0.base Int)) (let ((.cse38 (select .cse39 ~q2~0.base))) (or (< (select .cse38 .cse20) c_~i~0) (not (= c_~i~0 (select .cse38 .cse19))))))))))))))) is different from false [2023-08-31 04:05:07,336 INFO L130 PetriNetUnfolder]: 798/1472 cut-off events. [2023-08-31 04:05:07,336 INFO L131 PetriNetUnfolder]: For 9581/9581 co-relation queries the response was YES. [2023-08-31 04:05:07,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9048 conditions, 1472 events. 798/1472 cut-off events. For 9581/9581 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8055 event pairs, 31 based on Foata normal form. 12/1482 useless extension candidates. Maximal degree in co-relation 8963. Up to 469 conditions per place. [2023-08-31 04:05:07,346 INFO L137 encePairwiseOnDemand]: 320/334 looper letters, 117 selfloop transitions, 296 changer transitions 35/448 dead transitions. [2023-08-31 04:05:07,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 448 transitions, 5439 flow [2023-08-31 04:05:07,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-08-31 04:05:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-08-31 04:05:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4354 transitions. [2023-08-31 04:05:07,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25069092584062647 [2023-08-31 04:05:07,354 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 4354 transitions. [2023-08-31 04:05:07,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 4354 transitions. [2023-08-31 04:05:07,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:05:07,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 4354 transitions. [2023-08-31 04:05:07,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 83.73076923076923) internal successors, (4354), 52 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:05:07,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 334.0) internal successors, (17702), 53 states have internal predecessors, (17702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:05:07,374 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 334.0) internal successors, (17702), 53 states have internal predecessors, (17702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:05:07,374 INFO L175 Difference]: Start difference. First operand has 180 places, 265 transitions, 2835 flow. Second operand 52 states and 4354 transitions. [2023-08-31 04:05:07,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 448 transitions, 5439 flow [2023-08-31 04:05:07,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 448 transitions, 5175 flow, removed 69 selfloop flow, removed 28 redundant places. [2023-08-31 04:05:07,432 INFO L231 Difference]: Finished difference. Result has 209 places, 339 transitions, 4300 flow [2023-08-31 04:05:07,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=2450, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=4300, PETRI_PLACES=209, PETRI_TRANSITIONS=339} [2023-08-31 04:05:07,433 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 187 predicate places. [2023-08-31 04:05:07,433 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 339 transitions, 4300 flow [2023-08-31 04:05:07,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 80.48648648648648) internal successors, (2978), 37 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:05:07,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:05:07,434 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-08-31 04:05:07,444 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-08-31 04:05:07,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:05:07,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:05:07,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:05:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1834517005, now seen corresponding path program 6 times [2023-08-31 04:05:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:05:07,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333073025] [2023-08-31 04:05:07,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:05:07,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:05:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:05:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:05:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:05:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333073025] [2023-08-31 04:05:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333073025] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:05:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693590091] [2023-08-31 04:05:08,669 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 04:05:08,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:05:08,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:05:08,670 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-08-31 04:05:08,671 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-08-31 04:05:08,831 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-31 04:05:08,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:05:08,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 77 conjunts are in the unsatisfiable core [2023-08-31 04:05:08,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:05:08,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:05:08,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:05:08,871 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-31 04:05:08,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2023-08-31 04:05:08,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 04:05:09,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:05:09,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:05:09,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:05:09,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:05:09,038 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-31 04:05:09,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 17 [2023-08-31 04:05:09,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 04:05:09,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:05:09,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:05:09,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2023-08-31 04:05:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:05:09,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:05:15,116 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-08-31 04:05:15,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-08-31 04:05:15,230 INFO L321 Elim1Store]: treesize reduction 5, result has 96.6 percent of original size [2023-08-31 04:05:15,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 317 treesize of output 418 [2023-08-31 04:05:15,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 04:05:15,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:05:15,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 255 treesize of output 279 [2023-08-31 04:05:15,301 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 04:05:15,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:05:15,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 209 [2023-08-31 04:05:35,687 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-08-31 04:05:35,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-08-31 04:05:35,830 INFO L321 Elim1Store]: treesize reduction 4, result has 97.3 percent of original size [2023-08-31 04:05:35,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 317 treesize of output 419 [2023-08-31 04:05:35,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:05:35,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 255 treesize of output 287 [2023-08-31 04:05:35,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:05:35,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 217 [2023-08-31 04:06:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:06:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693590091] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:06:04,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:06:04,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-08-31 04:06:04,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121285416] [2023-08-31 04:06:04,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:06:04,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 04:06:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:06:04,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 04:06:04,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1140, Unknown=8, NotChecked=0, Total=1332 [2023-08-31 04:06:07,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-31 04:06:07,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 339 transitions, 4300 flow. Second operand has 37 states, 37 states have (on average 79.43243243243244) internal successors, (2939), 37 states have internal predecessors, (2939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:06:07,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:06:07,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-31 04:06:07,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:06:13,091 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-08-31 04:06:28,429 INFO L130 PetriNetUnfolder]: 850/1582 cut-off events. [2023-08-31 04:06:28,429 INFO L131 PetriNetUnfolder]: For 18864/18864 co-relation queries the response was YES. [2023-08-31 04:06:28,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11679 conditions, 1582 events. 850/1582 cut-off events. For 18864/18864 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9004 event pairs, 26 based on Foata normal form. 8/1588 useless extension candidates. Maximal degree in co-relation 11599. Up to 505 conditions per place. [2023-08-31 04:06:28,445 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 105 selfloop transitions, 344 changer transitions 17/466 dead transitions. [2023-08-31 04:06:28,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 466 transitions, 6651 flow [2023-08-31 04:06:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-08-31 04:06:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-08-31 04:06:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3706 transitions. [2023-08-31 04:06:28,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24657351962741184 [2023-08-31 04:06:28,451 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3706 transitions. [2023-08-31 04:06:28,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3706 transitions. [2023-08-31 04:06:28,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:06:28,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3706 transitions. [2023-08-31 04:06:28,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 82.35555555555555) internal successors, (3706), 45 states have internal predecessors, (3706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:06:28,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 334.0) internal successors, (15364), 46 states have internal predecessors, (15364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:06:28,469 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 334.0) internal successors, (15364), 46 states have internal predecessors, (15364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:06:28,469 INFO L175 Difference]: Start difference. First operand has 209 places, 339 transitions, 4300 flow. Second operand 45 states and 3706 transitions. [2023-08-31 04:06:28,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 466 transitions, 6651 flow [2023-08-31 04:06:28,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 466 transitions, 6100 flow, removed 205 selfloop flow, removed 25 redundant places. [2023-08-31 04:06:28,579 INFO L231 Difference]: Finished difference. Result has 234 places, 388 transitions, 5569 flow [2023-08-31 04:06:28,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=3919, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=5569, PETRI_PLACES=234, PETRI_TRANSITIONS=388} [2023-08-31 04:06:28,581 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 212 predicate places. [2023-08-31 04:06:28,581 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 388 transitions, 5569 flow [2023-08-31 04:06:28,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.43243243243244) internal successors, (2939), 37 states have internal predecessors, (2939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:06:28,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:06:28,582 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-08-31 04:06:28,588 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-08-31 04:06:28,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-31 04:06:28,785 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:06:28,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:06:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash 130363839, now seen corresponding path program 7 times [2023-08-31 04:06:28,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:06:28,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880957205] [2023-08-31 04:06:28,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:06:28,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:06:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:06:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:06:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:06:29,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880957205] [2023-08-31 04:06:29,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880957205] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:06:29,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447973977] [2023-08-31 04:06:29,767 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 04:06:29,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:06:29,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:06:29,768 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-08-31 04:06:29,770 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-08-31 04:06:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:06:29,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 51 conjunts are in the unsatisfiable core [2023-08-31 04:06:29,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:06:29,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 04:06:29,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:06:30,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:06:30,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-08-31 04:06:30,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:06:30,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2023-08-31 04:06:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 04:06:30,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:06:30,695 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (* c_~q1_front~0 4)) (.cse2 (* c_~q1_back~0 4))) (and (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (< (select .cse0 (+ .cse1 ~q1~0.offset)) c_~N~0) (not (= (select .cse0 (+ .cse2 ~q1~0.offset)) c_~j~0))))) (< (+ (select (select .cse3 c_~q2~0.base) .cse4) 1) c_~N~0)))) (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (or (< (select (select .cse5 c_~q2~0.base) .cse4) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (< (+ (select .cse6 (+ .cse1 ~q1~0.offset)) 1) c_~N~0) (not (= (select .cse6 (+ .cse2 ~q1~0.offset)) c_~j~0)))))))))) is different from false [2023-08-31 04:06:31,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:06:31,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2023-08-31 04:06:31,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:06:31,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 385 [2023-08-31 04:06:31,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:06:31,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 164 [2023-08-31 04:06:31,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:06:31,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 190 [2023-08-31 04:06:45,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:06:45,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2023-08-31 04:06:45,591 INFO L321 Elim1Store]: treesize reduction 46, result has 50.5 percent of original size [2023-08-31 04:06:45,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 325 treesize of output 331 [2023-08-31 04:06:45,647 INFO L321 Elim1Store]: treesize reduction 36, result has 55.6 percent of original size [2023-08-31 04:06:45,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 172 [2023-08-31 04:06:45,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:06:45,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 156 [2023-08-31 04:06:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 04:06:47,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447973977] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:06:47,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:06:47,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 31 [2023-08-31 04:06:47,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869105603] [2023-08-31 04:06:47,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:06:47,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-31 04:06:47,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:06:47,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-31 04:06:47,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=887, Unknown=20, NotChecked=60, Total=1056 [2023-08-31 04:06:48,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-08-31 04:06:48,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 388 transitions, 5569 flow. Second operand has 33 states, 33 states have (on average 82.60606060606061) internal successors, (2726), 33 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:06:48,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:06:48,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-08-31 04:06:48,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:06:53,726 INFO L130 PetriNetUnfolder]: 1004/1878 cut-off events. [2023-08-31 04:06:53,726 INFO L131 PetriNetUnfolder]: For 23867/23867 co-relation queries the response was YES. [2023-08-31 04:06:53,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14755 conditions, 1878 events. 1004/1878 cut-off events. For 23867/23867 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11084 event pairs, 53 based on Foata normal form. 7/1879 useless extension candidates. Maximal degree in co-relation 14662. Up to 788 conditions per place. [2023-08-31 04:06:53,748 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 156 selfloop transitions, 395 changer transitions 15/566 dead transitions. [2023-08-31 04:06:53,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 566 transitions, 8913 flow [2023-08-31 04:06:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-08-31 04:06:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-08-31 04:06:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 4163 transitions. [2023-08-31 04:06:53,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25436881339362094 [2023-08-31 04:06:53,755 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 4163 transitions. [2023-08-31 04:06:53,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 4163 transitions. [2023-08-31 04:06:53,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:06:53,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 4163 transitions. [2023-08-31 04:06:53,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 84.95918367346938) internal successors, (4163), 49 states have internal predecessors, (4163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:06:53,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 334.0) internal successors, (16700), 50 states have internal predecessors, (16700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:06:53,775 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 334.0) internal successors, (16700), 50 states have internal predecessors, (16700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:06:53,775 INFO L175 Difference]: Start difference. First operand has 234 places, 388 transitions, 5569 flow. Second operand 49 states and 4163 transitions. [2023-08-31 04:06:53,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 566 transitions, 8913 flow [2023-08-31 04:06:53,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 566 transitions, 8424 flow, removed 60 selfloop flow, removed 29 redundant places. [2023-08-31 04:06:53,934 INFO L231 Difference]: Finished difference. Result has 264 places, 482 transitions, 7840 flow [2023-08-31 04:06:53,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=5157, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=7840, PETRI_PLACES=264, PETRI_TRANSITIONS=482} [2023-08-31 04:06:53,935 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 242 predicate places. [2023-08-31 04:06:53,935 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 482 transitions, 7840 flow [2023-08-31 04:06:53,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 82.60606060606061) internal successors, (2726), 33 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:06:53,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:06:53,936 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-08-31 04:06:53,942 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-08-31 04:06:54,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:06:54,142 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:06:54,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:06:54,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2104011777, now seen corresponding path program 8 times [2023-08-31 04:06:54,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:06:54,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724807989] [2023-08-31 04:06:54,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:06:54,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:06:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:06:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:06:55,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:06:55,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724807989] [2023-08-31 04:06:55,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724807989] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:06:55,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228616088] [2023-08-31 04:06:55,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 04:06:55,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:06:55,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:06:55,200 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-08-31 04:06:55,202 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-08-31 04:06:55,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 04:06:55,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:06:55,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-31 04:06:55,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:06:55,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:06:55,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:06:55,347 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 04:06:55,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-31 04:06:55,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 04:06:55,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:06:55,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:06:55,494 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 04:06:55,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-31 04:06:55,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 04:06:55,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:06:55,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:06:55,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-08-31 04:06:56,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 20 [2023-08-31 04:06:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:06:56,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:06:57,573 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-08-31 04:06:57,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 100 [2023-08-31 04:06:57,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:06:57,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 421 treesize of output 503 [2023-08-31 04:06:57,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:06:57,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 198 [2023-08-31 04:06:57,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:06:57,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 152 [2023-08-31 04:07:11,551 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-08-31 04:07:11,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 100 [2023-08-31 04:07:11,669 INFO L321 Elim1Store]: treesize reduction 4, result has 97.0 percent of original size [2023-08-31 04:07:11,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 429 treesize of output 507 [2023-08-31 04:07:11,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:07:11,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 198 [2023-08-31 04:07:11,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:07:11,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 148 [2023-08-31 04:07:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:07:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228616088] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:07:23,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:07:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-08-31 04:07:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976121056] [2023-08-31 04:07:23,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:07:23,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 04:07:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:07:23,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 04:07:23,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1202, Unknown=6, NotChecked=0, Total=1332 [2023-08-31 04:07:23,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-31 04:07:23,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 482 transitions, 7840 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:07:23,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:07:23,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-31 04:07:23,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:07:41,467 WARN L222 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 182 DAG size of output: 177 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 04:07:47,711 WARN L222 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 185 DAG size of output: 177 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 04:07:59,391 WARN L222 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 188 DAG size of output: 160 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 04:08:00,638 INFO L130 PetriNetUnfolder]: 1219/2277 cut-off events. [2023-08-31 04:08:00,639 INFO L131 PetriNetUnfolder]: For 41358/41358 co-relation queries the response was YES. [2023-08-31 04:08:00,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19916 conditions, 2277 events. 1219/2277 cut-off events. For 41358/41358 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14212 event pairs, 32 based on Foata normal form. 7/2282 useless extension candidates. Maximal degree in co-relation 19493. Up to 741 conditions per place. [2023-08-31 04:08:00,661 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 171 selfloop transitions, 457 changer transitions 17/645 dead transitions. [2023-08-31 04:08:00,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 645 transitions, 11503 flow [2023-08-31 04:08:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-31 04:08:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-31 04:08:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3391 transitions. [2023-08-31 04:08:00,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24762669782386446 [2023-08-31 04:08:00,667 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 3391 transitions. [2023-08-31 04:08:00,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 3391 transitions. [2023-08-31 04:08:00,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:08:00,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 3391 transitions. [2023-08-31 04:08:00,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 82.70731707317073) internal successors, (3391), 41 states have internal predecessors, (3391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:00,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 334.0) internal successors, (14028), 42 states have internal predecessors, (14028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:00,682 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 334.0) internal successors, (14028), 42 states have internal predecessors, (14028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:00,682 INFO L175 Difference]: Start difference. First operand has 264 places, 482 transitions, 7840 flow. Second operand 41 states and 3391 transitions. [2023-08-31 04:08:00,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 645 transitions, 11503 flow [2023-08-31 04:08:00,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 645 transitions, 11173 flow, removed 106 selfloop flow, removed 17 redundant places. [2023-08-31 04:08:00,933 INFO L231 Difference]: Finished difference. Result has 294 places, 559 transitions, 10268 flow [2023-08-31 04:08:00,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=7550, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=384, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=10268, PETRI_PLACES=294, PETRI_TRANSITIONS=559} [2023-08-31 04:08:00,934 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 272 predicate places. [2023-08-31 04:08:00,934 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 559 transitions, 10268 flow [2023-08-31 04:08:00,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:00,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:08:00,935 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:08:00,945 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-08-31 04:08:01,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:08:01,140 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:08:01,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:08:01,141 INFO L85 PathProgramCache]: Analyzing trace with hash 595168778, now seen corresponding path program 9 times [2023-08-31 04:08:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:08:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623106368] [2023-08-31 04:08:01,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:08:01,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:08:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:08:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:08:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:08:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623106368] [2023-08-31 04:08:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623106368] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:08:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972196384] [2023-08-31 04:08:02,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 04:08:02,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:08:02,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:08:02,311 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-08-31 04:08:02,312 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-08-31 04:08:02,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-31 04:08:02,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:08:02,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-31 04:08:02,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:08:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 04:08:02,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:08:03,083 INFO L321 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-08-31 04:08:03,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 219 [2023-08-31 04:08:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 04:08:05,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972196384] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:08:05,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:08:05,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 29 [2023-08-31 04:08:05,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483145607] [2023-08-31 04:08:05,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:08:05,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-31 04:08:05,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:08:05,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-31 04:08:05,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2023-08-31 04:08:07,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 334 [2023-08-31 04:08:07,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 559 transitions, 10268 flow. Second operand has 31 states, 31 states have (on average 110.7741935483871) internal successors, (3434), 31 states have internal predecessors, (3434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:07,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:08:07,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 334 [2023-08-31 04:08:07,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:08:10,367 INFO L130 PetriNetUnfolder]: 1524/2815 cut-off events. [2023-08-31 04:08:10,367 INFO L131 PetriNetUnfolder]: For 65051/65051 co-relation queries the response was YES. [2023-08-31 04:08:10,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27313 conditions, 2815 events. 1524/2815 cut-off events. For 65051/65051 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 18152 event pairs, 110 based on Foata normal form. 3/2815 useless extension candidates. Maximal degree in co-relation 27132. Up to 1509 conditions per place. [2023-08-31 04:08:10,400 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 342 selfloop transitions, 402 changer transitions 11/755 dead transitions. [2023-08-31 04:08:10,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 755 transitions, 15035 flow [2023-08-31 04:08:10,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-31 04:08:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-31 04:08:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 4110 transitions. [2023-08-31 04:08:10,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34181636726546905 [2023-08-31 04:08:10,410 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 4110 transitions. [2023-08-31 04:08:10,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 4110 transitions. [2023-08-31 04:08:10,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:08:10,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 4110 transitions. [2023-08-31 04:08:10,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 114.16666666666667) internal successors, (4110), 36 states have internal predecessors, (4110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:10,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 334.0) internal successors, (12358), 37 states have internal predecessors, (12358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:10,428 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 334.0) internal successors, (12358), 37 states have internal predecessors, (12358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:10,428 INFO L175 Difference]: Start difference. First operand has 294 places, 559 transitions, 10268 flow. Second operand 36 states and 4110 transitions. [2023-08-31 04:08:10,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 755 transitions, 15035 flow [2023-08-31 04:08:10,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 755 transitions, 14809 flow, removed 62 selfloop flow, removed 17 redundant places. [2023-08-31 04:08:10,957 INFO L231 Difference]: Finished difference. Result has 325 places, 666 transitions, 13898 flow [2023-08-31 04:08:10,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=10052, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=307, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=13898, PETRI_PLACES=325, PETRI_TRANSITIONS=666} [2023-08-31 04:08:10,958 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 303 predicate places. [2023-08-31 04:08:10,958 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 666 transitions, 13898 flow [2023-08-31 04:08:10,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 110.7741935483871) internal successors, (3434), 31 states have internal predecessors, (3434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:10,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:08:10,959 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:08:10,966 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-08-31 04:08:11,159 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,SelfDestructingSolverStorable14 [2023-08-31 04:08:11,160 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:08:11,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:08:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash -436176240, now seen corresponding path program 10 times [2023-08-31 04:08:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:08:11,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159805979] [2023-08-31 04:08:11,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:08:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:08:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:08:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:08:13,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:08:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159805979] [2023-08-31 04:08:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159805979] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:08:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193074336] [2023-08-31 04:08:13,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 04:08:13,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:08:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:08:13,220 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-08-31 04:08:13,222 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-08-31 04:08:13,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 04:08:13,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:08:13,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-31 04:08:13,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:08:13,354 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-08-31 04:08:13,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2023-08-31 04:08:13,415 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 04:08:13,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-31 04:08:13,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-31 04:08:13,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:08:13,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 37 [2023-08-31 04:08:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 04:08:13,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:08:14,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:08:14,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 197 treesize of output 377 [2023-08-31 04:08:14,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:08:14,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 160 [2023-08-31 04:08:14,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:08:14,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 142 [2023-08-31 04:08:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 04:08:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193074336] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:08:29,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:08:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 30 [2023-08-31 04:08:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18169775] [2023-08-31 04:08:29,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:08:29,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-31 04:08:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:08:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-31 04:08:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=885, Unknown=16, NotChecked=0, Total=992 [2023-08-31 04:08:32,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-31 04:08:32,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 666 transitions, 13898 flow. Second operand has 32 states, 32 states have (on average 79.5) internal successors, (2544), 32 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:32,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:08:32,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-31 04:08:32,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:08:36,273 INFO L130 PetriNetUnfolder]: 1628/3047 cut-off events. [2023-08-31 04:08:36,273 INFO L131 PetriNetUnfolder]: For 90764/90764 co-relation queries the response was YES. [2023-08-31 04:08:36,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31967 conditions, 3047 events. 1628/3047 cut-off events. For 90764/90764 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 20362 event pairs, 87 based on Foata normal form. 1/3045 useless extension candidates. Maximal degree in co-relation 31661. Up to 1282 conditions per place. [2023-08-31 04:08:36,314 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 212 selfloop transitions, 581 changer transitions 10/803 dead transitions. [2023-08-31 04:08:36,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 803 transitions, 17843 flow [2023-08-31 04:08:36,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-31 04:08:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-31 04:08:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2715 transitions. [2023-08-31 04:08:36,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2463255307566685 [2023-08-31 04:08:36,318 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2715 transitions. [2023-08-31 04:08:36,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2715 transitions. [2023-08-31 04:08:36,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:08:36,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2715 transitions. [2023-08-31 04:08:36,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 82.27272727272727) internal successors, (2715), 33 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:36,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 334.0) internal successors, (11356), 34 states have internal predecessors, (11356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:36,330 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 334.0) internal successors, (11356), 34 states have internal predecessors, (11356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:36,331 INFO L175 Difference]: Start difference. First operand has 325 places, 666 transitions, 13898 flow. Second operand 33 states and 2715 transitions. [2023-08-31 04:08:36,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 803 transitions, 17843 flow [2023-08-31 04:08:37,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 803 transitions, 17647 flow, removed 86 selfloop flow, removed 8 redundant places. [2023-08-31 04:08:37,120 INFO L231 Difference]: Finished difference. Result has 354 places, 735 transitions, 17113 flow [2023-08-31 04:08:37,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=13712, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=521, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=17113, PETRI_PLACES=354, PETRI_TRANSITIONS=735} [2023-08-31 04:08:37,121 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 332 predicate places. [2023-08-31 04:08:37,121 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 735 transitions, 17113 flow [2023-08-31 04:08:37,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 79.5) internal successors, (2544), 32 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:08:37,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:08:37,122 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:08:37,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-31 04:08:37,322 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,SelfDestructingSolverStorable15 [2023-08-31 04:08:37,323 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:08:37,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:08:37,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1283601332, now seen corresponding path program 11 times [2023-08-31 04:08:37,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:08:37,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69563913] [2023-08-31 04:08:37,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:08:37,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:08:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:08:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:08:39,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:08:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69563913] [2023-08-31 04:08:39,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69563913] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:08:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703163245] [2023-08-31 04:08:39,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 04:08:39,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:08:39,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:08:39,301 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-08-31 04:08:39,305 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-08-31 04:08:39,400 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 04:08:39,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:08:39,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-31 04:08:39,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:08:39,731 INFO L321 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2023-08-31 04:08:39,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 43 [2023-08-31 04:08:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 04:08:39,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:08:40,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:08:40,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 100 treesize of output 372 [2023-08-31 04:09:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 04:09:32,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703163245] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:09:32,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:09:32,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2023-08-31 04:09:32,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207560894] [2023-08-31 04:09:32,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:09:32,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-31 04:09:32,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:09:32,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-31 04:09:32,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2023-08-31 04:09:36,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 334 [2023-08-31 04:09:36,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 735 transitions, 17113 flow. Second operand has 31 states, 31 states have (on average 105.74193548387096) internal successors, (3278), 31 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:09:36,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:09:36,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 334 [2023-08-31 04:09:36,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:09:39,492 INFO L130 PetriNetUnfolder]: 1790/3296 cut-off events. [2023-08-31 04:09:39,493 INFO L131 PetriNetUnfolder]: For 109006/109006 co-relation queries the response was YES. [2023-08-31 04:09:39,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37362 conditions, 3296 events. 1790/3296 cut-off events. For 109006/109006 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 21959 event pairs, 102 based on Foata normal form. 9/3302 useless extension candidates. Maximal degree in co-relation 37118. Up to 1640 conditions per place. [2023-08-31 04:09:39,526 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 287 selfloop transitions, 596 changer transitions 6/889 dead transitions. [2023-08-31 04:09:39,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 889 transitions, 21600 flow [2023-08-31 04:09:39,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-31 04:09:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-31 04:09:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3808 transitions. [2023-08-31 04:09:39,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325748502994012 [2023-08-31 04:09:39,530 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3808 transitions. [2023-08-31 04:09:39,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3808 transitions. [2023-08-31 04:09:39,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:09:39,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3808 transitions. [2023-08-31 04:09:39,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 108.8) internal successors, (3808), 35 states have internal predecessors, (3808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:09:39,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:09:39,544 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:09:39,545 INFO L175 Difference]: Start difference. First operand has 354 places, 735 transitions, 17113 flow. Second operand 35 states and 3808 transitions. [2023-08-31 04:09:39,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 889 transitions, 21600 flow [2023-08-31 04:09:40,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 889 transitions, 21072 flow, removed 222 selfloop flow, removed 12 redundant places. [2023-08-31 04:09:40,668 INFO L231 Difference]: Finished difference. Result has 383 places, 817 transitions, 20517 flow [2023-08-31 04:09:40,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=16502, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=513, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=20517, PETRI_PLACES=383, PETRI_TRANSITIONS=817} [2023-08-31 04:09:40,668 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 361 predicate places. [2023-08-31 04:09:40,669 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 817 transitions, 20517 flow [2023-08-31 04:09:40,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 105.74193548387096) internal successors, (3278), 31 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:09:40,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:09:40,670 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:09:40,676 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-08-31 04:09:40,874 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,SelfDestructingSolverStorable16 [2023-08-31 04:09:40,875 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:09:40,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:09:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1893910212, now seen corresponding path program 12 times [2023-08-31 04:09:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:09:40,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4916503] [2023-08-31 04:09:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:09:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:09:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:09:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:09:42,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:09:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4916503] [2023-08-31 04:09:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4916503] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:09:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349969166] [2023-08-31 04:09:42,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 04:09:42,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:09:42,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:09:42,295 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-08-31 04:09:42,301 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-08-31 04:09:42,400 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-31 04:09:42,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:09:42,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-31 04:09:42,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:09:42,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:09:42,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2023-08-31 04:09:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 04:09:42,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:09:43,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:09:43,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 268 [2023-08-31 04:10:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 04:10:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349969166] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:10:13,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:10:13,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 31 [2023-08-31 04:10:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851368088] [2023-08-31 04:10:13,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:10:13,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-31 04:10:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:10:13,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-31 04:10:13,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2023-08-31 04:10:15,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 334 [2023-08-31 04:10:15,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 817 transitions, 20517 flow. Second operand has 33 states, 33 states have (on average 109.66666666666667) internal successors, (3619), 33 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:10:15,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:10:15,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 334 [2023-08-31 04:10:15,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:10:18,656 INFO L130 PetriNetUnfolder]: 1859/3445 cut-off events. [2023-08-31 04:10:18,657 INFO L131 PetriNetUnfolder]: For 86494/86494 co-relation queries the response was YES. [2023-08-31 04:10:18,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39234 conditions, 3445 events. 1859/3445 cut-off events. For 86494/86494 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 23362 event pairs, 93 based on Foata normal form. 6/3448 useless extension candidates. Maximal degree in co-relation 38945. Up to 1683 conditions per place. [2023-08-31 04:10:18,693 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 273 selfloop transitions, 642 changer transitions 18/933 dead transitions. [2023-08-31 04:10:18,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 933 transitions, 24165 flow [2023-08-31 04:10:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-31 04:10:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-31 04:10:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 4173 transitions. [2023-08-31 04:10:18,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3376759993526461 [2023-08-31 04:10:18,698 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 4173 transitions. [2023-08-31 04:10:18,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 4173 transitions. [2023-08-31 04:10:18,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 04:10:18,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 4173 transitions. [2023-08-31 04:10:18,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 112.78378378378379) internal successors, (4173), 37 states have internal predecessors, (4173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:10:18,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 334.0) internal successors, (12692), 38 states have internal predecessors, (12692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:10:18,711 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 334.0) internal successors, (12692), 38 states have internal predecessors, (12692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:10:18,711 INFO L175 Difference]: Start difference. First operand has 383 places, 817 transitions, 20517 flow. Second operand 37 states and 4173 transitions. [2023-08-31 04:10:18,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 933 transitions, 24165 flow [2023-08-31 04:10:19,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 933 transitions, 23837 flow, removed 126 selfloop flow, removed 14 redundant places. [2023-08-31 04:10:19,541 INFO L231 Difference]: Finished difference. Result has 413 places, 845 transitions, 22684 flow [2023-08-31 04:10:19,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=20225, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=615, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=22684, PETRI_PLACES=413, PETRI_TRANSITIONS=845} [2023-08-31 04:10:19,542 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 391 predicate places. [2023-08-31 04:10:19,542 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 845 transitions, 22684 flow [2023-08-31 04:10:19,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 109.66666666666667) internal successors, (3619), 33 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:10:19,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:10:19,543 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:10:19,548 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-08-31 04:10:19,747 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,SelfDestructingSolverStorable17 [2023-08-31 04:10:19,748 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 04:10:19,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:10:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash -126602492, now seen corresponding path program 13 times [2023-08-31 04:10:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:10:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133807676] [2023-08-31 04:10:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:10:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:10:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:10:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:10:21,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:10:21,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133807676] [2023-08-31 04:10:21,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133807676] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:10:21,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216159296] [2023-08-31 04:10:21,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 04:10:21,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:10:21,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:10:21,094 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-08-31 04:10:21,096 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-08-31 04:10:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:10:21,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-31 04:10:21,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:10:21,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:10:21,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:10:21,221 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 04:10:21,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-31 04:10:21,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 04:10:21,358 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 04:10:21,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-31 04:10:21,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:10:21,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:10:21,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 04:10:21,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:10:21,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-08-31 04:10:21,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:10:21,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2023-08-31 04:10:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 04:10:21,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:10:25,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:10:25,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 94 [2023-08-31 04:10:25,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:10:25,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2067 treesize of output 2047 [2023-08-31 04:10:25,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:10:25,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 403 [2023-08-31 04:10:25,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:10:25,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 413 treesize of output 381 [2023-08-31 04:10:25,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:10:25,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 297 treesize of output 329 [2023-08-31 04:11:36,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:11:36,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 94 [2023-08-31 04:11:37,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:11:37,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1095 treesize of output 1123 [2023-08-31 04:11:37,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:11:37,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 422 treesize of output 454 [2023-08-31 04:11:37,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:11:37,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 322 treesize of output 378 [2023-08-31 04:11:37,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 04:11:37,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 377 treesize of output 345 [2023-08-31 04:12:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 04:12:52,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216159296] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:12:52,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:12:52,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-08-31 04:12:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708857895] [2023-08-31 04:12:52,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:12:52,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 04:12:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:12:52,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 04:12:52,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1193, Unknown=14, NotChecked=0, Total=1332 [2023-08-31 04:12:54,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 04:12:56,438 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-08-31 04:12:57,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 04:12:59,869 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-08-31 04:13:01,936 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-08-31 04:13:04,177 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-08-31 04:13:06,376 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-08-31 04:13:08,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 04:13:10,878 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-08-31 04:13:12,917 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-08-31 04:13:15,018 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-08-31 04:13:17,075 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-08-31 04:13:19,132 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-08-31 04:13:21,174 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-08-31 04:13:23,338 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-08-31 04:13:25,409 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-08-31 04:13:28,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 04:13:29,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 04:13:31,663 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-08-31 04:13:31,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-31 04:13:31,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 845 transitions, 22684 flow. Second operand has 37 states, 37 states have (on average 79.51351351351352) internal successors, (2942), 37 states have internal predecessors, (2942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 04:13:31,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:13:31,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-31 04:13:31,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:13:47,573 WARN L222 SmtUtils]: Spent 15.23s on a formula simplification. DAG size of input: 124 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 04:13:58,508 WARN L222 SmtUtils]: Spent 10.35s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 04:14:06,512 WARN L222 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 04:14:08,562 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-08-31 04:14:10,960 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-08-31 04:14:16,907 WARN L222 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 04:14:21,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 04:14:34,403 WARN L222 SmtUtils]: Spent 12.14s on a formula simplification. DAG size of input: 216 DAG size of output: 126 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15