./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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-more-min-array-hom.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 ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 20:49:52,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 20:49:52,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 20:49:52,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 20:49:52,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 20:49:52,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 20:49:52,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 20:49:52,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 20:49:52,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 20:49:52,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 20:49:52,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 20:49:52,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 20:49:52,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 20:49:52,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 20:49:52,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 20:49:52,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 20:49:52,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 20:49:52,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 20:49:52,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 20:49:52,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 20:49:52,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 20:49:52,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 20:49:52,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 20:49:52,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 20:49:52,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 20:49:52,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 20:49:52,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 20:49:52,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 20:49:52,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 20:49:52,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 20:49:52,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 20:49:52,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 20:49:52,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 20:49:52,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 20:49:52,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 20:49:52,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 20:49:52,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 20:49:52,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 20:49:52,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 20:49:52,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 20:49:52,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 20:49:52,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 20:49:52,248 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 20:49:52,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 20:49:52,250 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 20:49:52,250 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 20:49:52,251 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 20:49:52,251 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 20:49:52,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 20:49:52,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 20:49:52,252 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 20:49:52,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 20:49:52,253 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 20:49:52,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 20:49:52,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 20:49:52,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 20:49:52,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 20:49:52,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 20:49:52,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 20:49:52,254 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 20:49:52,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 20:49:52,255 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 20:49:52,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 20:49:52,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 20:49:52,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 20:49:52,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 20:49:52,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:49:52,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 20:49:52,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 20:49:52,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 20:49:52,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 20:49:52,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 20:49:52,257 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 20:49:52,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 20:49:52,257 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 20:49:52,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 20:49:52,258 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 20:49:52,258 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 -> ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 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 -> AFTER [2023-08-30 20:49:52,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 20:49:52,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 20:49:52,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 20:49:52,590 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 20:49:52,591 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 20:49:52,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-08-30 20:49:53,772 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 20:49:54,010 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 20:49:54,011 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-08-30 20:49:54,018 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c28ce3fb/42e90493c615488aa4da440e59428793/FLAG124c1a36c [2023-08-30 20:49:54,030 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c28ce3fb/42e90493c615488aa4da440e59428793 [2023-08-30 20:49:54,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 20:49:54,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 20:49:54,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 20:49:54,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 20:49:54,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 20:49:54,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a90dc0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54, skipping insertion in model container [2023-08-30 20:49:54,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 20:49:54,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 20:49:54,225 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-more-min-array-hom.wvr.c[2586,2599] [2023-08-30 20:49:54,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:49:54,253 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 20:49:54,293 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-more-min-array-hom.wvr.c[2586,2599] [2023-08-30 20:49:54,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:49:54,309 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:49:54,310 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:49:54,316 INFO L208 MainTranslator]: Completed translation [2023-08-30 20:49:54,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54 WrapperNode [2023-08-30 20:49:54,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 20:49:54,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 20:49:54,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 20:49:54,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 20:49:54,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,371 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-08-30 20:49:54,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 20:49:54,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 20:49:54,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 20:49:54,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 20:49:54,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,415 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 20:49:54,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 20:49:54,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 20:49:54,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 20:49:54,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (1/1) ... [2023-08-30 20:49:54,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:49:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:49:54,462 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-30 20:49:54,488 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-30 20:49:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 20:49:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 20:49:54,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 20:49:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 20:49:54,503 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 20:49:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 20:49:54,503 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 20:49:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 20:49:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 20:49:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 20:49:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 20:49:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 20:49:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 20:49:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 20:49:54,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 20:49:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 20:49:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 20:49:54,506 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 20:49:54,598 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 20:49:54,599 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 20:49:54,896 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 20:49:54,953 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 20:49:54,953 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-30 20:49:54,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:49:54 BoogieIcfgContainer [2023-08-30 20:49:54,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 20:49:54,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 20:49:54,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 20:49:54,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 20:49:54,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:49:54" (1/3) ... [2023-08-30 20:49:54,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47087a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:49:54, skipping insertion in model container [2023-08-30 20:49:54,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:49:54" (2/3) ... [2023-08-30 20:49:54,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47087a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:49:54, skipping insertion in model container [2023-08-30 20:49:54,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:49:54" (3/3) ... [2023-08-30 20:49:54,963 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2023-08-30 20:49:54,970 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 20:49:54,979 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 20:49:54,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 20:49:54,979 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 20:49:55,098 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 20:49:55,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 145 transitions, 314 flow [2023-08-30 20:49:55,196 INFO L130 PetriNetUnfolder]: 12/142 cut-off events. [2023-08-30 20:49:55,196 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:49:55,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 12/142 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 88 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-08-30 20:49:55,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 145 transitions, 314 flow [2023-08-30 20:49:55,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 132 transitions, 282 flow [2023-08-30 20:49:55,208 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 20:49:55,215 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 132 transitions, 282 flow [2023-08-30 20:49:55,217 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 132 transitions, 282 flow [2023-08-30 20:49:55,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 132 transitions, 282 flow [2023-08-30 20:49:55,253 INFO L130 PetriNetUnfolder]: 12/132 cut-off events. [2023-08-30 20:49:55,253 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:49:55,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 12/132 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-08-30 20:49:55,256 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2023-08-30 20:49:59,870 INFO L134 LiptonReduction]: Checked pairs total: 1523 [2023-08-30 20:49:59,871 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-30 20:49:59,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 20:49:59,889 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;@24882427, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 20:49:59,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 20:49:59,897 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2023-08-30 20:49:59,897 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:49:59,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:49:59,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:49:59,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:49:59,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:49:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash -924859563, now seen corresponding path program 1 times [2023-08-30 20:49:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:49:59,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047814654] [2023-08-30 20:49:59,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:49:59,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:50:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:00,630 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-30 20:50:00,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:50:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047814654] [2023-08-30 20:50:00,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047814654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:50:00,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:50:00,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 20:50:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178810613] [2023-08-30 20:50:00,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:50:00,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 20:50:00,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:50:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 20:50:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 20:50:00,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 20:50:00,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 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-30 20:50:00,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:50:00,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 20:50:00,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:50:01,086 INFO L130 PetriNetUnfolder]: 514/733 cut-off events. [2023-08-30 20:50:01,087 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-30 20:50:01,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 733 events. 514/733 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2552 event pairs, 137 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 1179. Up to 348 conditions per place. [2023-08-30 20:50:01,094 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 50 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2023-08-30 20:50:01,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 62 transitions, 288 flow [2023-08-30 20:50:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 20:50:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 20:50:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2023-08-30 20:50:01,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449438202247191 [2023-08-30 20:50:01,111 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2023-08-30 20:50:01,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2023-08-30 20:50:01,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:50:01,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2023-08-30 20:50:01,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 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-30 20:50:01,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 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-30 20:50:01,141 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 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-30 20:50:01,143 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 8 states and 960 transitions. [2023-08-30 20:50:01,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 62 transitions, 288 flow [2023-08-30 20:50:01,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 62 transitions, 260 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 20:50:01,148 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 118 flow [2023-08-30 20:50:01,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=118, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-08-30 20:50:01,152 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-08-30 20:50:01,152 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 118 flow [2023-08-30 20:50:01,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 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-30 20:50:01,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:50:01,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:50:01,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 20:50:01,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:50:01,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:50:01,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1563909876, now seen corresponding path program 1 times [2023-08-30 20:50:01,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:50:01,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022679120] [2023-08-30 20:50:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:01,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:50:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:50:01,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:50:01,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022679120] [2023-08-30 20:50:01,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022679120] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:50:01,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071420066] [2023-08-30 20:50:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:01,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:01,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:50:01,291 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-30 20:50:01,299 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-30 20:50:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:01,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 20:50:01,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:50:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:50:01,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:50:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:50:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071420066] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 20:50:01,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 20:50:01,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-08-30 20:50:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954745345] [2023-08-30 20:50:01,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:50:01,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:50:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:50:01,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:50:01,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 20:50:01,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-30 20:50:01,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 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-30 20:50:01,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:50:01,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-30 20:50:01,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:50:01,720 INFO L130 PetriNetUnfolder]: 451/682 cut-off events. [2023-08-30 20:50:01,720 INFO L131 PetriNetUnfolder]: For 378/418 co-relation queries the response was YES. [2023-08-30 20:50:01,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 682 events. 451/682 cut-off events. For 378/418 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2501 event pairs, 114 based on Foata normal form. 30/596 useless extension candidates. Maximal degree in co-relation 1921. Up to 527 conditions per place. [2023-08-30 20:50:01,727 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-30 20:50:01,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 256 flow [2023-08-30 20:50:01,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:50:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:50:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-08-30 20:50:01,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45617977528089887 [2023-08-30 20:50:01,730 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-08-30 20:50:01,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-08-30 20:50:01,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:50:01,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-08-30 20:50:01,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 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-30 20:50:01,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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-30 20:50:01,736 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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-30 20:50:01,737 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 118 flow. Second operand 5 states and 609 transitions. [2023-08-30 20:50:01,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 256 flow [2023-08-30 20:50:01,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 245 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-30 20:50:01,742 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 127 flow [2023-08-30 20:50:01,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-30 20:50:01,743 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2023-08-30 20:50:01,743 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 127 flow [2023-08-30 20:50:01,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 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-30 20:50:01,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:50:01,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:50:01,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 20:50:01,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:01,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:50:01,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:50:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1717822039, now seen corresponding path program 1 times [2023-08-30 20:50:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:50:01,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235852955] [2023-08-30 20:50:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:01,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:50:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:03,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:50:03,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235852955] [2023-08-30 20:50:03,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235852955] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:50:03,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302344782] [2023-08-30 20:50:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:03,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:03,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:50:03,352 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-30 20:50:03,381 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-30 20:50:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:03,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-30 20:50:03,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:50:03,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 20:50:03,707 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-30 20:50:03,785 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-30 20:50:03,843 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-30 20:50:04,185 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-30 20:50:04,185 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 73 treesize of output 59 [2023-08-30 20:50:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:04,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:50:05,748 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (<= c_~min2~0 c_~min3~0)) (.cse5 (= c_~min2~0 c_~min1~0)) (.cse6 (< c_~min3~0 c_~min2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (select .cse2 c_~A~0.offset))) (or (<= c_~min3~0 .cse0) (= .cse1 .cse0) (<= c_~min2~0 .cse0) (<= c_~min1~0 .cse1))))) (or (and (or .cse4 (= c_~min1~0 c_~min3~0)) (or .cse5 .cse6)) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (or (< (select .cse7 c_~A~0.offset) c_~min1~0) (< (select .cse7 .cse3) c_~min3~0))))) (or .cse4 (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset))) (or (= .cse8 c_~min3~0) (< (select .cse9 .cse3) c_~min3~0) (<= c_~min1~0 .cse8)))))) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse11 (select .cse10 .cse3))) (or (< (select .cse10 c_~A~0.offset) c_~min1~0) (<= c_~min3~0 .cse11) (= c_~min1~0 .cse11) (<= c_~min2~0 .cse11))))) (or .cse5 (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse13 (select .cse12 .cse3))) (or (< (select .cse12 c_~A~0.offset) c_~min1~0) (<= c_~min3~0 .cse13) (< .cse13 c_~min2~0)))))) (or (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse15 (select .cse14 c_~A~0.offset))) (or (< (select .cse14 .cse3) c_~min3~0) (= c_~min2~0 .cse15) (<= c_~min1~0 .cse15))))) .cse6) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset)) (.cse16 (select .cse18 .cse3))) (or (<= c_~min3~0 .cse16) (= c_~min2~0 .cse17) (<= c_~min1~0 .cse17) (< .cse16 c_~min2~0))))))) is different from false [2023-08-30 20:50:05,979 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (<= c_~min2~0 c_~min3~0)) (.cse6 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse15 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (= c_~min1~0 .cse0) (<= c_~min2~0 .cse0) (<= c_~min3~0 .cse0) (< (select .cse1 c_~A~0.offset) c_~min1~0))))) (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse3 (select .cse5 c_~A~0.offset)) (.cse4 (select .cse5 .cse2))) (or (= c_~min2~0 .cse3) (<= c_~min1~0 .cse3) (< .cse4 c_~min2~0) (<= c_~min3~0 .cse4))))) (or .cse6 (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse2))) (or (< .cse7 c_~min2~0) (<= c_~min3~0 .cse7) (< (select .cse8 c_~A~0.offset) c_~min1~0)))))) (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse9 (select .cse11 c_~A~0.offset)) (.cse10 (select .cse11 .cse2))) (or (<= c_~min1~0 .cse9) (<= c_~min2~0 .cse10) (= .cse9 .cse10) (<= c_~min3~0 .cse10))))) (or .cse12 (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse13 (select .cse14 c_~A~0.offset))) (or (<= c_~min1~0 .cse13) (< (select .cse14 .cse2) c_~min3~0) (= c_~min3~0 .cse13)))))) (or (and (or .cse12 (= c_~min1~0 c_~min3~0)) (or .cse6 .cse15)) (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (or (< (select .cse16 .cse2) c_~min3~0) (< (select .cse16 c_~A~0.offset) c_~min1~0))))) (or (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset))) (or (= c_~min2~0 .cse17) (<= c_~min1~0 .cse17) (< (select .cse18 .cse2) c_~min3~0))))) .cse15))) is different from false [2023-08-30 20:50:07,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:07,621 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 125 treesize of output 89 [2023-08-30 20:50:07,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:07,637 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 541 treesize of output 521 [2023-08-30 20:50:07,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:07,664 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 513 treesize of output 441 [2023-08-30 20:50:07,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:07,690 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 433 treesize of output 401 [2023-08-30 20:50:07,720 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:07,721 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 205 treesize of output 193 [2023-08-30 20:50:09,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:09,821 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 121 treesize of output 85 [2023-08-30 20:50:09,856 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:09,857 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 4373 treesize of output 4185 [2023-08-30 20:50:09,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:50:09,971 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 221 [2023-08-30 20:50:09,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:50:09,987 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 418 treesize of output 354 [2023-08-30 20:50:10,010 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:10,011 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 218 treesize of output 190 [2023-08-30 20:50:10,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:10,437 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 89 treesize of output 65 [2023-08-30 20:50:10,462 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:10,462 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 764 treesize of output 736 [2023-08-30 20:50:10,506 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:10,507 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 350 treesize of output 314 [2023-08-30 20:50:10,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:50:10,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 142 [2023-08-30 20:50:10,544 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:10,545 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 159 treesize of output 143 [2023-08-30 20:50:10,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:10,762 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 93 treesize of output 69 [2023-08-30 20:50:10,782 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:10,783 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 1688 treesize of output 1612 [2023-08-30 20:50:10,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:50:10,828 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 156 [2023-08-30 20:50:10,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:50:10,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 142 [2023-08-30 20:50:10,967 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:10,968 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 195 treesize of output 143 [2023-08-30 20:50:11,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:11,209 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 61 treesize of output 49 [2023-08-30 20:50:11,233 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:11,236 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 2187 treesize of output 2095 [2023-08-30 20:50:11,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:50:11,301 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 111 [2023-08-30 20:50:11,317 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:11,317 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 235 treesize of output 207 [2023-08-30 20:50:11,339 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:11,339 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 109 treesize of output 97 [2023-08-30 20:50:11,439 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:50:11,440 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 150 treesize of output 1 [2023-08-30 20:50:11,453 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:50:11,453 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 89 treesize of output 1 [2023-08-30 20:50:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302344782] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:50:11,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:50:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2023-08-30 20:50:11,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026338510] [2023-08-30 20:50:11,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:50:11,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 20:50:11,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:50:11,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 20:50:11,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=689, Unknown=2, NotChecked=110, Total=930 [2023-08-30 20:50:11,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 267 [2023-08-30 20:50:11,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 127 flow. Second operand has 31 states, 31 states have (on average 71.03225806451613) internal successors, (2202), 31 states have internal predecessors, (2202), 0 states have call successors, (0), 0 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-30 20:50:11,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:50:11,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 267 [2023-08-30 20:50:11,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:50:14,581 INFO L130 PetriNetUnfolder]: 1091/1613 cut-off events. [2023-08-30 20:50:14,581 INFO L131 PetriNetUnfolder]: For 1313/1313 co-relation queries the response was YES. [2023-08-30 20:50:14,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 1613 events. 1091/1613 cut-off events. For 1313/1313 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6171 event pairs, 160 based on Foata normal form. 17/1414 useless extension candidates. Maximal degree in co-relation 3672. Up to 999 conditions per place. [2023-08-30 20:50:14,592 INFO L137 encePairwiseOnDemand]: 255/267 looper letters, 108 selfloop transitions, 67 changer transitions 13/188 dead transitions. [2023-08-30 20:50:14,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 188 transitions, 1077 flow [2023-08-30 20:50:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-30 20:50:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-30 20:50:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1906 transitions. [2023-08-30 20:50:14,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2855430711610487 [2023-08-30 20:50:14,598 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1906 transitions. [2023-08-30 20:50:14,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1906 transitions. [2023-08-30 20:50:14,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:50:14,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1906 transitions. [2023-08-30 20:50:14,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 76.24) internal successors, (1906), 25 states have internal predecessors, (1906), 0 states have call successors, (0), 0 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-30 20:50:14,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 267.0) internal successors, (6942), 26 states have internal predecessors, (6942), 0 states have call successors, (0), 0 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-30 20:50:14,615 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 267.0) internal successors, (6942), 26 states have internal predecessors, (6942), 0 states have call successors, (0), 0 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-30 20:50:14,615 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 127 flow. Second operand 25 states and 1906 transitions. [2023-08-30 20:50:14,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 188 transitions, 1077 flow [2023-08-30 20:50:14,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 188 transitions, 1016 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-30 20:50:14,628 INFO L231 Difference]: Finished difference. Result has 73 places, 96 transitions, 619 flow [2023-08-30 20:50:14,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=619, PETRI_PLACES=73, PETRI_TRANSITIONS=96} [2023-08-30 20:50:14,629 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2023-08-30 20:50:14,630 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 96 transitions, 619 flow [2023-08-30 20:50:14,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 71.03225806451613) internal successors, (2202), 31 states have internal predecessors, (2202), 0 states have call successors, (0), 0 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-30 20:50:14,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:50:14,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:50:14,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-30 20:50:14,836 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,SelfDestructingSolverStorable2 [2023-08-30 20:50:14,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:50:14,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:50:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1797774933, now seen corresponding path program 2 times [2023-08-30 20:50:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:50:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20392437] [2023-08-30 20:50:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:50:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:15,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:50:15,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20392437] [2023-08-30 20:50:15,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20392437] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:50:15,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293455859] [2023-08-30 20:50:15,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:50:15,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:15,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:50:15,629 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-30 20:50:15,653 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-30 20:50:15,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:50:15,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:50:15,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-30 20:50:15,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:50:16,101 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:50:16,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:16,104 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 64 treesize of output 37 [2023-08-30 20:50:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:16,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:50:16,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:16,556 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 125 treesize of output 69 [2023-08-30 20:50:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293455859] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:50:16,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:50:16,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-08-30 20:50:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013955204] [2023-08-30 20:50:16,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:50:16,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 20:50:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:50:16,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 20:50:16,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2023-08-30 20:50:17,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 267 [2023-08-30 20:50:17,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 96 transitions, 619 flow. Second operand has 23 states, 23 states have (on average 102.6086956521739) internal successors, (2360), 23 states have internal predecessors, (2360), 0 states have call successors, (0), 0 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-30 20:50:17,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:50:17,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 267 [2023-08-30 20:50:17,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:50:18,940 INFO L130 PetriNetUnfolder]: 1348/2024 cut-off events. [2023-08-30 20:50:18,941 INFO L131 PetriNetUnfolder]: For 4141/4189 co-relation queries the response was YES. [2023-08-30 20:50:18,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7802 conditions, 2024 events. 1348/2024 cut-off events. For 4141/4189 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8962 event pairs, 148 based on Foata normal form. 43/2055 useless extension candidates. Maximal degree in co-relation 7735. Up to 1321 conditions per place. [2023-08-30 20:50:18,958 INFO L137 encePairwiseOnDemand]: 255/267 looper letters, 109 selfloop transitions, 69 changer transitions 4/189 dead transitions. [2023-08-30 20:50:18,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 189 transitions, 1397 flow [2023-08-30 20:50:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 20:50:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 20:50:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1212 transitions. [2023-08-30 20:50:18,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41266598569969354 [2023-08-30 20:50:18,962 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1212 transitions. [2023-08-30 20:50:18,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1212 transitions. [2023-08-30 20:50:18,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:50:18,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1212 transitions. [2023-08-30 20:50:18,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 110.18181818181819) internal successors, (1212), 11 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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-30 20:50:18,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 267.0) internal successors, (3204), 12 states have internal predecessors, (3204), 0 states have call successors, (0), 0 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-30 20:50:18,972 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 267.0) internal successors, (3204), 12 states have internal predecessors, (3204), 0 states have call successors, (0), 0 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-30 20:50:18,972 INFO L175 Difference]: Start difference. First operand has 73 places, 96 transitions, 619 flow. Second operand 11 states and 1212 transitions. [2023-08-30 20:50:18,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 189 transitions, 1397 flow [2023-08-30 20:50:18,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 189 transitions, 1376 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 20:50:18,992 INFO L231 Difference]: Finished difference. Result has 86 places, 128 transitions, 1055 flow [2023-08-30 20:50:18,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1055, PETRI_PLACES=86, PETRI_TRANSITIONS=128} [2023-08-30 20:50:18,994 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2023-08-30 20:50:18,995 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 128 transitions, 1055 flow [2023-08-30 20:50:18,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 102.6086956521739) internal successors, (2360), 23 states have internal predecessors, (2360), 0 states have call successors, (0), 0 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-30 20:50:18,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:50:18,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:50:19,005 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-30 20:50:19,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:19,203 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:50:19,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:50:19,203 INFO L85 PathProgramCache]: Analyzing trace with hash 184588913, now seen corresponding path program 3 times [2023-08-30 20:50:19,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:50:19,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567028616] [2023-08-30 20:50:19,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:50:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:19,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:50:19,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567028616] [2023-08-30 20:50:19,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567028616] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:50:19,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168645999] [2023-08-30 20:50:19,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:50:19,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:19,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:50:19,958 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-30 20:50:19,968 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-30 20:50:20,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:50:20,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:50:20,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-30 20:50:20,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:50:20,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:50:20,396 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 34 treesize of output 32 [2023-08-30 20:50:20,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:50:20,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:20,539 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 64 treesize of output 37 [2023-08-30 20:50:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:20,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:50:21,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:21,103 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 241 treesize of output 177 [2023-08-30 20:50:21,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 141 [2023-08-30 20:50:21,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 129 [2023-08-30 20:50:21,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 111 [2023-08-30 20:50:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:21,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168645999] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:50:21,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:50:21,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 26 [2023-08-30 20:50:21,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659096874] [2023-08-30 20:50:21,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:50:21,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 20:50:21,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:50:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 20:50:21,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=647, Unknown=5, NotChecked=0, Total=756 [2023-08-30 20:50:22,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 267 [2023-08-30 20:50:22,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 128 transitions, 1055 flow. Second operand has 28 states, 28 states have (on average 77.28571428571429) internal successors, (2164), 28 states have internal predecessors, (2164), 0 states have call successors, (0), 0 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-30 20:50:22,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:50:22,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 267 [2023-08-30 20:50:22,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:50:26,456 INFO L130 PetriNetUnfolder]: 2159/3216 cut-off events. [2023-08-30 20:50:26,456 INFO L131 PetriNetUnfolder]: For 10698/10698 co-relation queries the response was YES. [2023-08-30 20:50:26,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14353 conditions, 3216 events. 2159/3216 cut-off events. For 10698/10698 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15069 event pairs, 161 based on Foata normal form. 44/3260 useless extension candidates. Maximal degree in co-relation 14314. Up to 1871 conditions per place. [2023-08-30 20:50:26,485 INFO L137 encePairwiseOnDemand]: 254/267 looper letters, 196 selfloop transitions, 121 changer transitions 2/319 dead transitions. [2023-08-30 20:50:26,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 319 transitions, 2747 flow [2023-08-30 20:50:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 20:50:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 20:50:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1707 transitions. [2023-08-30 20:50:26,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3196629213483146 [2023-08-30 20:50:26,492 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1707 transitions. [2023-08-30 20:50:26,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1707 transitions. [2023-08-30 20:50:26,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:50:26,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1707 transitions. [2023-08-30 20:50:26,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 85.35) internal successors, (1707), 20 states have internal predecessors, (1707), 0 states have call successors, (0), 0 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-30 20:50:26,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 0 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-30 20:50:26,504 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 0 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-30 20:50:26,504 INFO L175 Difference]: Start difference. First operand has 86 places, 128 transitions, 1055 flow. Second operand 20 states and 1707 transitions. [2023-08-30 20:50:26,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 319 transitions, 2747 flow [2023-08-30 20:50:26,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 319 transitions, 2714 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-30 20:50:26,574 INFO L231 Difference]: Finished difference. Result has 112 places, 192 transitions, 1994 flow [2023-08-30 20:50:26,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1994, PETRI_PLACES=112, PETRI_TRANSITIONS=192} [2023-08-30 20:50:26,575 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2023-08-30 20:50:26,575 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 192 transitions, 1994 flow [2023-08-30 20:50:26,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 77.28571428571429) internal successors, (2164), 28 states have internal predecessors, (2164), 0 states have call successors, (0), 0 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-30 20:50:26,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:50:26,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:50:26,582 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-30 20:50:26,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:26,777 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:50:26,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:50:26,778 INFO L85 PathProgramCache]: Analyzing trace with hash -542212045, now seen corresponding path program 4 times [2023-08-30 20:50:26,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:50:26,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698647885] [2023-08-30 20:50:26,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:50:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:27,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:50:27,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698647885] [2023-08-30 20:50:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698647885] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:50:27,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852968377] [2023-08-30 20:50:27,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 20:50:27,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:27,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:50:27,537 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-30 20:50:27,540 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-30 20:50:27,628 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 20:50:27,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:50:27,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-30 20:50:27,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:50:28,042 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-30 20:50:28,043 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 77 treesize of output 63 [2023-08-30 20:50:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:50:28,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:50:28,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:28,546 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 117 treesize of output 69 [2023-08-30 20:50:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:50:28,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852968377] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:50:28,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:50:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 23 [2023-08-30 20:50:28,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175543112] [2023-08-30 20:50:28,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:50:28,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 20:50:28,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:50:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 20:50:28,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2023-08-30 20:50:30,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 267 [2023-08-30 20:50:30,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 192 transitions, 1994 flow. Second operand has 25 states, 25 states have (on average 98.48) internal successors, (2462), 25 states have internal predecessors, (2462), 0 states have call successors, (0), 0 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-30 20:50:30,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:50:30,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 267 [2023-08-30 20:50:30,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:50:33,748 INFO L130 PetriNetUnfolder]: 3690/5659 cut-off events. [2023-08-30 20:50:33,749 INFO L131 PetriNetUnfolder]: For 33384/33384 co-relation queries the response was YES. [2023-08-30 20:50:33,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29048 conditions, 5659 events. 3690/5659 cut-off events. For 33384/33384 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 31189 event pairs, 190 based on Foata normal form. 7/5666 useless extension candidates. Maximal degree in co-relation 28999. Up to 2351 conditions per place. [2023-08-30 20:50:33,793 INFO L137 encePairwiseOnDemand]: 252/267 looper letters, 294 selfloop transitions, 282 changer transitions 36/612 dead transitions. [2023-08-30 20:50:33,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 612 transitions, 6418 flow [2023-08-30 20:50:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-30 20:50:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-30 20:50:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4768 transitions. [2023-08-30 20:50:33,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3882103891874288 [2023-08-30 20:50:33,806 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4768 transitions. [2023-08-30 20:50:33,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4768 transitions. [2023-08-30 20:50:33,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:50:33,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4768 transitions. [2023-08-30 20:50:33,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 103.65217391304348) internal successors, (4768), 46 states have internal predecessors, (4768), 0 states have call successors, (0), 0 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-30 20:50:33,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 267.0) internal successors, (12549), 47 states have internal predecessors, (12549), 0 states have call successors, (0), 0 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-30 20:50:33,835 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 267.0) internal successors, (12549), 47 states have internal predecessors, (12549), 0 states have call successors, (0), 0 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-30 20:50:33,835 INFO L175 Difference]: Start difference. First operand has 112 places, 192 transitions, 1994 flow. Second operand 46 states and 4768 transitions. [2023-08-30 20:50:33,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 612 transitions, 6418 flow [2023-08-30 20:50:33,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 612 transitions, 6068 flow, removed 153 selfloop flow, removed 7 redundant places. [2023-08-30 20:50:33,972 INFO L231 Difference]: Finished difference. Result has 178 places, 398 transitions, 4869 flow [2023-08-30 20:50:33,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4869, PETRI_PLACES=178, PETRI_TRANSITIONS=398} [2023-08-30 20:50:33,976 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2023-08-30 20:50:33,976 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 398 transitions, 4869 flow [2023-08-30 20:50:33,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 98.48) internal successors, (2462), 25 states have internal predecessors, (2462), 0 states have call successors, (0), 0 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-30 20:50:33,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:50:33,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:50:33,987 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-30 20:50:34,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:34,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:50:34,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:50:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1208376447, now seen corresponding path program 5 times [2023-08-30 20:50:34,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:50:34,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127600638] [2023-08-30 20:50:34,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:34,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:50:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:35,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:50:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127600638] [2023-08-30 20:50:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127600638] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:50:35,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615707282] [2023-08-30 20:50:35,155 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 20:50:35,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:35,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:50:35,156 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-30 20:50:35,161 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-30 20:50:35,246 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-30 20:50:35,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:50:35,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-30 20:50:35,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:50:35,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:35,550 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 77 treesize of output 71 [2023-08-30 20:50:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:50:36,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:50:36,460 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:50:36,462 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 117 treesize of output 65 [2023-08-30 20:50:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:50:36,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615707282] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:50:36,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:50:36,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 5] total 21 [2023-08-30 20:50:36,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472724256] [2023-08-30 20:50:36,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:50:36,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 20:50:36,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:50:36,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 20:50:36,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-08-30 20:50:37,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 267 [2023-08-30 20:50:37,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 398 transitions, 4869 flow. Second operand has 23 states, 23 states have (on average 97.6086956521739) internal successors, (2245), 23 states have internal predecessors, (2245), 0 states have call successors, (0), 0 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-30 20:50:37,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:50:37,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 267 [2023-08-30 20:50:37,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:50:40,392 INFO L130 PetriNetUnfolder]: 4546/7224 cut-off events. [2023-08-30 20:50:40,392 INFO L131 PetriNetUnfolder]: For 101225/101596 co-relation queries the response was YES. [2023-08-30 20:50:40,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48306 conditions, 7224 events. 4546/7224 cut-off events. For 101225/101596 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 44972 event pairs, 486 based on Foata normal form. 227/7432 useless extension candidates. Maximal degree in co-relation 48230. Up to 4394 conditions per place. [2023-08-30 20:50:40,451 INFO L137 encePairwiseOnDemand]: 253/267 looper letters, 298 selfloop transitions, 339 changer transitions 14/672 dead transitions. [2023-08-30 20:50:40,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 672 transitions, 9216 flow [2023-08-30 20:50:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-30 20:50:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-30 20:50:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2471 transitions. [2023-08-30 20:50:40,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3856117353308365 [2023-08-30 20:50:40,455 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2471 transitions. [2023-08-30 20:50:40,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2471 transitions. [2023-08-30 20:50:40,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:50:40,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2471 transitions. [2023-08-30 20:50:40,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 102.95833333333333) internal successors, (2471), 24 states have internal predecessors, (2471), 0 states have call successors, (0), 0 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-30 20:50:40,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 267.0) internal successors, (6675), 25 states have internal predecessors, (6675), 0 states have call successors, (0), 0 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-30 20:50:40,467 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 267.0) internal successors, (6675), 25 states have internal predecessors, (6675), 0 states have call successors, (0), 0 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-30 20:50:40,468 INFO L175 Difference]: Start difference. First operand has 178 places, 398 transitions, 4869 flow. Second operand 24 states and 2471 transitions. [2023-08-30 20:50:40,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 672 transitions, 9216 flow [2023-08-30 20:50:40,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 672 transitions, 8312 flow, removed 436 selfloop flow, removed 7 redundant places. [2023-08-30 20:50:40,813 INFO L231 Difference]: Finished difference. Result has 199 places, 572 transitions, 7408 flow [2023-08-30 20:50:40,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=4325, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=7408, PETRI_PLACES=199, PETRI_TRANSITIONS=572} [2023-08-30 20:50:40,815 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 169 predicate places. [2023-08-30 20:50:40,815 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 572 transitions, 7408 flow [2023-08-30 20:50:40,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 97.6086956521739) internal successors, (2245), 23 states have internal predecessors, (2245), 0 states have call successors, (0), 0 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-30 20:50:40,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:50:40,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:50:40,824 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-30 20:50:41,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:41,022 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:50:41,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:50:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1180941759, now seen corresponding path program 6 times [2023-08-30 20:50:41,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:50:41,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409985026] [2023-08-30 20:50:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:41,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:50:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:41,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:50:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409985026] [2023-08-30 20:50:41,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409985026] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:50:41,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440845978] [2023-08-30 20:50:41,665 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:50:41,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:41,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:50:41,666 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-30 20:50:41,669 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-30 20:50:41,761 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-30 20:50:41,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:50:41,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-30 20:50:41,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:50:42,204 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-30 20:50:42,204 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 73 treesize of output 59 [2023-08-30 20:50:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:42,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:50:42,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:42,614 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 101 treesize of output 69 [2023-08-30 20:50:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:42,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440845978] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:50:42,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:50:42,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2023-08-30 20:50:42,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656382929] [2023-08-30 20:50:42,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:50:42,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 20:50:42,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:50:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 20:50:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2023-08-30 20:50:44,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 267 [2023-08-30 20:50:44,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 572 transitions, 7408 flow. Second operand has 26 states, 26 states have (on average 99.65384615384616) internal successors, (2591), 26 states have internal predecessors, (2591), 0 states have call successors, (0), 0 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-30 20:50:44,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:50:44,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 267 [2023-08-30 20:50:44,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:50:47,057 INFO L130 PetriNetUnfolder]: 5457/8532 cut-off events. [2023-08-30 20:50:47,057 INFO L131 PetriNetUnfolder]: For 139401/139401 co-relation queries the response was YES. [2023-08-30 20:50:47,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61020 conditions, 8532 events. 5457/8532 cut-off events. For 139401/139401 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 51665 event pairs, 1042 based on Foata normal form. 5/8537 useless extension candidates. Maximal degree in co-relation 60938. Up to 7397 conditions per place. [2023-08-30 20:50:47,127 INFO L137 encePairwiseOnDemand]: 254/267 looper letters, 557 selfloop transitions, 185 changer transitions 17/759 dead transitions. [2023-08-30 20:50:47,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 759 transitions, 10998 flow [2023-08-30 20:50:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-30 20:50:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-30 20:50:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3120 transitions. [2023-08-30 20:50:47,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3895131086142322 [2023-08-30 20:50:47,132 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3120 transitions. [2023-08-30 20:50:47,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3120 transitions. [2023-08-30 20:50:47,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:50:47,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3120 transitions. [2023-08-30 20:50:47,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 104.0) internal successors, (3120), 30 states have internal predecessors, (3120), 0 states have call successors, (0), 0 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-30 20:50:47,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 267.0) internal successors, (8277), 31 states have internal predecessors, (8277), 0 states have call successors, (0), 0 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-30 20:50:47,146 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 267.0) internal successors, (8277), 31 states have internal predecessors, (8277), 0 states have call successors, (0), 0 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-30 20:50:47,146 INFO L175 Difference]: Start difference. First operand has 199 places, 572 transitions, 7408 flow. Second operand 30 states and 3120 transitions. [2023-08-30 20:50:47,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 759 transitions, 10998 flow [2023-08-30 20:50:47,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 759 transitions, 10246 flow, removed 338 selfloop flow, removed 6 redundant places. [2023-08-30 20:50:47,831 INFO L231 Difference]: Finished difference. Result has 233 places, 645 transitions, 8388 flow [2023-08-30 20:50:47,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=6885, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=8388, PETRI_PLACES=233, PETRI_TRANSITIONS=645} [2023-08-30 20:50:47,832 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2023-08-30 20:50:47,832 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 645 transitions, 8388 flow [2023-08-30 20:50:47,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 99.65384615384616) internal successors, (2591), 26 states have internal predecessors, (2591), 0 states have call successors, (0), 0 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-30 20:50:47,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:50:47,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, 1, 1, 1, 1] [2023-08-30 20:50:47,845 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-30 20:50:48,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:48,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 (and 1 more)] === [2023-08-30 20:50:48,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:50:48,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1868694365, now seen corresponding path program 7 times [2023-08-30 20:50:48,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:50:48,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971525776] [2023-08-30 20:50:48,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:48,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:50:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:49,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:50:49,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971525776] [2023-08-30 20:50:49,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971525776] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:50:49,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317574460] [2023-08-30 20:50:49,400 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 20:50:49,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:49,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:50:49,401 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-30 20:50:49,402 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-30 20:50:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:49,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 20:50:49,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:50:49,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:50:49,774 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 34 treesize of output 32 [2023-08-30 20:50:49,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:50:49,869 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 34 treesize of output 32 [2023-08-30 20:50:50,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:50:50,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:50,050 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 64 treesize of output 37 [2023-08-30 20:50:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:50:50,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:50:50,663 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse0 (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_380) c_~A~0.base) .cse1) c_~min3~0))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_380) c_~A~0.base) .cse1))) (or (<= c_~min2~0 .cse2) (= c_~min1~0 .cse2) (<= c_~min3~0 .cse2)))) (or .cse0 (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_380) c_~A~0.base) .cse1))) (or (< .cse3 c_~min2~0) (<= c_~min3~0 .cse3))))))) is different from false [2023-08-30 20:50:50,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:50:50,720 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 938 treesize of output 826 [2023-08-30 20:50:50,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 376 treesize of output 364 [2023-08-30 20:50:50,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 340 [2023-08-30 20:50:50,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 322 [2023-08-30 20:50:50,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 286 [2023-08-30 20:50:50,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 280 [2023-08-30 20:50:50,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 268 [2023-08-30 20:50:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 20:50:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317574460] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:50:51,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:50:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2023-08-30 20:50:51,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794036292] [2023-08-30 20:50:51,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:50:51,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 20:50:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:50:51,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 20:50:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=727, Unknown=3, NotChecked=56, Total=930 [2023-08-30 20:50:51,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 267 [2023-08-30 20:50:51,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 645 transitions, 8388 flow. Second operand has 31 states, 31 states have (on average 71.2258064516129) internal successors, (2208), 31 states have internal predecessors, (2208), 0 states have call successors, (0), 0 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-30 20:50:51,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:50:51,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 267 [2023-08-30 20:50:51,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:50:55,014 INFO L130 PetriNetUnfolder]: 6795/10607 cut-off events. [2023-08-30 20:50:55,014 INFO L131 PetriNetUnfolder]: For 166066/166066 co-relation queries the response was YES. [2023-08-30 20:50:55,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76058 conditions, 10607 events. 6795/10607 cut-off events. For 166066/166066 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 66651 event pairs, 805 based on Foata normal form. 4/10611 useless extension candidates. Maximal degree in co-relation 75964. Up to 6808 conditions per place. [2023-08-30 20:50:55,119 INFO L137 encePairwiseOnDemand]: 249/267 looper letters, 547 selfloop transitions, 408 changer transitions 8/963 dead transitions. [2023-08-30 20:50:55,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 963 transitions, 14199 flow [2023-08-30 20:50:55,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-30 20:50:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-30 20:50:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1661 transitions. [2023-08-30 20:50:55,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29623684679864454 [2023-08-30 20:50:55,123 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1661 transitions. [2023-08-30 20:50:55,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1661 transitions. [2023-08-30 20:50:55,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:50:55,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1661 transitions. [2023-08-30 20:50:55,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 79.0952380952381) internal successors, (1661), 21 states have internal predecessors, (1661), 0 states have call successors, (0), 0 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-30 20:50:55,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 267.0) internal successors, (5874), 22 states have internal predecessors, (5874), 0 states have call successors, (0), 0 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-30 20:50:55,133 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 267.0) internal successors, (5874), 22 states have internal predecessors, (5874), 0 states have call successors, (0), 0 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-30 20:50:55,133 INFO L175 Difference]: Start difference. First operand has 233 places, 645 transitions, 8388 flow. Second operand 21 states and 1661 transitions. [2023-08-30 20:50:55,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 963 transitions, 14199 flow [2023-08-30 20:50:55,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 963 transitions, 13787 flow, removed 165 selfloop flow, removed 12 redundant places. [2023-08-30 20:50:55,874 INFO L231 Difference]: Finished difference. Result has 252 places, 822 transitions, 12152 flow [2023-08-30 20:50:55,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=7985, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12152, PETRI_PLACES=252, PETRI_TRANSITIONS=822} [2023-08-30 20:50:55,876 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2023-08-30 20:50:55,876 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 822 transitions, 12152 flow [2023-08-30 20:50:55,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 71.2258064516129) internal successors, (2208), 31 states have internal predecessors, (2208), 0 states have call successors, (0), 0 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-30 20:50:55,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:50:55,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:50:55,888 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-30 20:50:56,083 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,SelfDestructingSolverStorable8 [2023-08-30 20:50:56,084 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:50:56,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:50:56,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1505548975, now seen corresponding path program 1 times [2023-08-30 20:50:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:50:56,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900264234] [2023-08-30 20:50:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:56,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:50:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:50:56,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:50:56,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900264234] [2023-08-30 20:50:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900264234] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:50:56,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108034970] [2023-08-30 20:50:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:50:56,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:50:56,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:50:56,195 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-30 20:50:56,198 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-30 20:50:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:50:56,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 20:50:56,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:50:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:50:56,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:50:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:50:56,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108034970] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:50:56,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:50:56,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-08-30 20:50:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349521752] [2023-08-30 20:50:56,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:50:56,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 20:50:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:50:56,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 20:50:56,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-08-30 20:50:56,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 267 [2023-08-30 20:50:56,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 822 transitions, 12152 flow. Second operand has 18 states, 18 states have (on average 111.27777777777777) internal successors, (2003), 18 states have internal predecessors, (2003), 0 states have call successors, (0), 0 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-30 20:50:56,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:50:56,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 267 [2023-08-30 20:50:56,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:00,729 INFO L130 PetriNetUnfolder]: 9723/15629 cut-off events. [2023-08-30 20:51:00,730 INFO L131 PetriNetUnfolder]: For 346526/346566 co-relation queries the response was YES. [2023-08-30 20:51:00,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125001 conditions, 15629 events. 9723/15629 cut-off events. For 346526/346566 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 112365 event pairs, 689 based on Foata normal form. 362/15969 useless extension candidates. Maximal degree in co-relation 124896. Up to 4390 conditions per place. [2023-08-30 20:51:00,872 INFO L137 encePairwiseOnDemand]: 258/267 looper letters, 1468 selfloop transitions, 410 changer transitions 30/1923 dead transitions. [2023-08-30 20:51:00,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 1923 transitions, 30327 flow [2023-08-30 20:51:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 20:51:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 20:51:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2369 transitions. [2023-08-30 20:51:00,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4436329588014981 [2023-08-30 20:51:00,876 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2369 transitions. [2023-08-30 20:51:00,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2369 transitions. [2023-08-30 20:51:00,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:00,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2369 transitions. [2023-08-30 20:51:00,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 118.45) internal successors, (2369), 20 states have internal predecessors, (2369), 0 states have call successors, (0), 0 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-30 20:51:00,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 0 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-30 20:51:00,885 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 0 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-30 20:51:00,885 INFO L175 Difference]: Start difference. First operand has 252 places, 822 transitions, 12152 flow. Second operand 20 states and 2369 transitions. [2023-08-30 20:51:00,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 1923 transitions, 30327 flow [2023-08-30 20:51:03,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 1923 transitions, 29369 flow, removed 389 selfloop flow, removed 8 redundant places. [2023-08-30 20:51:03,053 INFO L231 Difference]: Finished difference. Result has 275 places, 1061 transitions, 17218 flow [2023-08-30 20:51:03,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=11532, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=17218, PETRI_PLACES=275, PETRI_TRANSITIONS=1061} [2023-08-30 20:51:03,055 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2023-08-30 20:51:03,055 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 1061 transitions, 17218 flow [2023-08-30 20:51:03,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 111.27777777777777) internal successors, (2003), 18 states have internal predecessors, (2003), 0 states have call successors, (0), 0 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-30 20:51:03,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:03,055 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:03,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:03,256 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,SelfDestructingSolverStorable9 [2023-08-30 20:51:03,256 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:03,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:03,257 INFO L85 PathProgramCache]: Analyzing trace with hash 17771202, now seen corresponding path program 8 times [2023-08-30 20:51:03,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:03,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064558621] [2023-08-30 20:51:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:03,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:51:03,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:03,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064558621] [2023-08-30 20:51:03,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064558621] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:03,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716526547] [2023-08-30 20:51:03,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:51:03,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:03,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:03,361 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-30 20:51:03,365 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-30 20:51:03,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:51:03,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:03,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 20:51:03,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:51:03,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:51:03,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716526547] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:03,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:03,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-08-30 20:51:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472881421] [2023-08-30 20:51:03,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:03,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 20:51:03,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:03,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 20:51:03,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-08-30 20:51:03,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-30 20:51:03,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 1061 transitions, 17218 flow. Second operand has 15 states, 15 states have (on average 117.8) internal successors, (1767), 15 states have internal predecessors, (1767), 0 states have call successors, (0), 0 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-30 20:51:03,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:03,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-30 20:51:03,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:07,375 INFO L130 PetriNetUnfolder]: 7685/12299 cut-off events. [2023-08-30 20:51:07,375 INFO L131 PetriNetUnfolder]: For 346728/348538 co-relation queries the response was YES. [2023-08-30 20:51:07,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107419 conditions, 12299 events. 7685/12299 cut-off events. For 346728/348538 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 86151 event pairs, 2014 based on Foata normal form. 950/12911 useless extension candidates. Maximal degree in co-relation 107302. Up to 9431 conditions per place. [2023-08-30 20:51:07,491 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 857 selfloop transitions, 82 changer transitions 2/1062 dead transitions. [2023-08-30 20:51:07,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1062 transitions, 18952 flow [2023-08-30 20:51:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 20:51:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 20:51:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 870 transitions. [2023-08-30 20:51:07,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654895666131621 [2023-08-30 20:51:07,492 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 870 transitions. [2023-08-30 20:51:07,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 870 transitions. [2023-08-30 20:51:07,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:07,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 870 transitions. [2023-08-30 20:51:07,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 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-30 20:51:07,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 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-30 20:51:07,496 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 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-30 20:51:07,496 INFO L175 Difference]: Start difference. First operand has 275 places, 1061 transitions, 17218 flow. Second operand 7 states and 870 transitions. [2023-08-30 20:51:07,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 1062 transitions, 18952 flow [2023-08-30 20:51:11,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 1062 transitions, 17831 flow, removed 553 selfloop flow, removed 6 redundant places. [2023-08-30 20:51:11,123 INFO L231 Difference]: Finished difference. Result has 278 places, 979 transitions, 15252 flow [2023-08-30 20:51:11,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14783, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=970, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15252, PETRI_PLACES=278, PETRI_TRANSITIONS=979} [2023-08-30 20:51:11,125 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 248 predicate places. [2023-08-30 20:51:11,125 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 979 transitions, 15252 flow [2023-08-30 20:51:11,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 117.8) internal successors, (1767), 15 states have internal predecessors, (1767), 0 states have call successors, (0), 0 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-30 20:51:11,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:11,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:11,131 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-30 20:51:11,326 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,SelfDestructingSolverStorable10 [2023-08-30 20:51:11,326 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:11,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:11,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1595059175, now seen corresponding path program 2 times [2023-08-30 20:51:11,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:11,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081047553] [2023-08-30 20:51:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:11,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081047553] [2023-08-30 20:51:11,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081047553] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:11,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404642519] [2023-08-30 20:51:11,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:51:11,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:11,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:11,449 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-30 20:51:11,468 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-30 20:51:11,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:51:11,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:11,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 20:51:11,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:11,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:11,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404642519] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:11,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:11,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2023-08-30 20:51:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756923358] [2023-08-30 20:51:11,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:11,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 20:51:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 20:51:11,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-08-30 20:51:11,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 267 [2023-08-30 20:51:11,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 979 transitions, 15252 flow. Second operand has 15 states, 15 states have (on average 112.66666666666667) internal successors, (1690), 15 states have internal predecessors, (1690), 0 states have call successors, (0), 0 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-30 20:51:11,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:11,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 267 [2023-08-30 20:51:11,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:14,783 INFO L130 PetriNetUnfolder]: 6659/11117 cut-off events. [2023-08-30 20:51:14,783 INFO L131 PetriNetUnfolder]: For 170896/170955 co-relation queries the response was YES. [2023-08-30 20:51:14,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79310 conditions, 11117 events. 6659/11117 cut-off events. For 170896/170955 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 79480 event pairs, 727 based on Foata normal form. 839/11937 useless extension candidates. Maximal degree in co-relation 79193. Up to 6590 conditions per place. [2023-08-30 20:51:14,877 INFO L137 encePairwiseOnDemand]: 260/267 looper letters, 843 selfloop transitions, 103 changer transitions 27/989 dead transitions. [2023-08-30 20:51:14,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 989 transitions, 15897 flow [2023-08-30 20:51:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 20:51:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 20:51:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1062 transitions. [2023-08-30 20:51:14,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4419475655430712 [2023-08-30 20:51:14,880 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1062 transitions. [2023-08-30 20:51:14,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1062 transitions. [2023-08-30 20:51:14,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:14,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1062 transitions. [2023-08-30 20:51:14,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.0) internal successors, (1062), 9 states have internal predecessors, (1062), 0 states have call successors, (0), 0 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-30 20:51:14,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 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-30 20:51:14,884 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 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-30 20:51:14,884 INFO L175 Difference]: Start difference. First operand has 278 places, 979 transitions, 15252 flow. Second operand 9 states and 1062 transitions. [2023-08-30 20:51:14,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 989 transitions, 15897 flow [2023-08-30 20:51:16,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 989 transitions, 15714 flow, removed 89 selfloop flow, removed 8 redundant places. [2023-08-30 20:51:16,018 INFO L231 Difference]: Finished difference. Result has 272 places, 713 transitions, 10933 flow [2023-08-30 20:51:16,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=10883, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10933, PETRI_PLACES=272, PETRI_TRANSITIONS=713} [2023-08-30 20:51:16,019 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2023-08-30 20:51:16,020 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 713 transitions, 10933 flow [2023-08-30 20:51:16,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 112.66666666666667) internal successors, (1690), 15 states have internal predecessors, (1690), 0 states have call successors, (0), 0 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-30 20:51:16,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:16,020 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:16,028 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-30 20:51:16,228 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,SelfDestructingSolverStorable11 [2023-08-30 20:51:16,229 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:16,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:16,229 INFO L85 PathProgramCache]: Analyzing trace with hash 86136784, now seen corresponding path program 9 times [2023-08-30 20:51:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516426440] [2023-08-30 20:51:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:16,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516426440] [2023-08-30 20:51:16,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516426440] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:16,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320974121] [2023-08-30 20:51:16,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:51:16,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:16,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:16,321 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-30 20:51:16,346 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-30 20:51:16,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:51:16,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:16,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 20:51:16,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:16,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:16,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320974121] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:16,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:16,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-30 20:51:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440333956] [2023-08-30 20:51:16,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:16,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 20:51:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:16,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 20:51:16,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-30 20:51:16,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-30 20:51:16,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 713 transitions, 10933 flow. Second operand has 14 states, 14 states have (on average 117.5) internal successors, (1645), 14 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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-30 20:51:16,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:16,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-30 20:51:16,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:18,600 INFO L130 PetriNetUnfolder]: 4279/7342 cut-off events. [2023-08-30 20:51:18,600 INFO L131 PetriNetUnfolder]: For 133451/134529 co-relation queries the response was YES. [2023-08-30 20:51:18,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54468 conditions, 7342 events. 4279/7342 cut-off events. For 133451/134529 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 52507 event pairs, 966 based on Foata normal form. 934/8067 useless extension candidates. Maximal degree in co-relation 54356. Up to 4194 conditions per place. [2023-08-30 20:51:18,664 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 484 selfloop transitions, 27 changer transitions 32/639 dead transitions. [2023-08-30 20:51:18,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 639 transitions, 11036 flow [2023-08-30 20:51:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 20:51:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 20:51:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 989 transitions. [2023-08-30 20:51:18,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46301498127340823 [2023-08-30 20:51:18,666 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 989 transitions. [2023-08-30 20:51:18,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 989 transitions. [2023-08-30 20:51:18,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:18,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 989 transitions. [2023-08-30 20:51:18,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.625) internal successors, (989), 8 states have internal predecessors, (989), 0 states have call successors, (0), 0 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-30 20:51:18,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 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-30 20:51:18,669 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 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-30 20:51:18,670 INFO L175 Difference]: Start difference. First operand has 272 places, 713 transitions, 10933 flow. Second operand 8 states and 989 transitions. [2023-08-30 20:51:18,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 639 transitions, 11036 flow [2023-08-30 20:51:19,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 639 transitions, 10681 flow, removed 133 selfloop flow, removed 18 redundant places. [2023-08-30 20:51:19,325 INFO L231 Difference]: Finished difference. Result has 246 places, 541 transitions, 8510 flow [2023-08-30 20:51:19,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=8642, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8510, PETRI_PLACES=246, PETRI_TRANSITIONS=541} [2023-08-30 20:51:19,326 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2023-08-30 20:51:19,327 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 541 transitions, 8510 flow [2023-08-30 20:51:19,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 117.5) internal successors, (1645), 14 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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-30 20:51:19,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:19,328 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:19,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:19,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-30 20:51:19,537 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:19,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:19,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1080724745, now seen corresponding path program 10 times [2023-08-30 20:51:19,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:19,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321951325] [2023-08-30 20:51:19,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:19,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:19,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:19,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321951325] [2023-08-30 20:51:19,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321951325] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:19,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675147827] [2023-08-30 20:51:19,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 20:51:19,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:19,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:19,669 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:51:19,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-30 20:51:19,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 20:51:19,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:19,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 20:51:19,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:19,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:19,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675147827] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:19,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:19,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2023-08-30 20:51:19,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434904424] [2023-08-30 20:51:19,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:19,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 20:51:19,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:19,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 20:51:19,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-08-30 20:51:20,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-08-30 20:51:20,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 541 transitions, 8510 flow. Second operand has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 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-30 20:51:20,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:20,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-08-30 20:51:20,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:21,641 INFO L130 PetriNetUnfolder]: 3274/5647 cut-off events. [2023-08-30 20:51:21,641 INFO L131 PetriNetUnfolder]: For 90160/90567 co-relation queries the response was YES. [2023-08-30 20:51:21,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42040 conditions, 5647 events. 3274/5647 cut-off events. For 90160/90567 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 38492 event pairs, 445 based on Foata normal form. 508/6108 useless extension candidates. Maximal degree in co-relation 41940. Up to 1862 conditions per place. [2023-08-30 20:51:21,685 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 261 selfloop transitions, 120 changer transitions 260/653 dead transitions. [2023-08-30 20:51:21,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 653 transitions, 10998 flow [2023-08-30 20:51:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-30 20:51:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-30 20:51:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2240 transitions. [2023-08-30 20:51:21,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155332150601223 [2023-08-30 20:51:21,688 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2240 transitions. [2023-08-30 20:51:21,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2240 transitions. [2023-08-30 20:51:21,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:21,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2240 transitions. [2023-08-30 20:51:21,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 117.89473684210526) internal successors, (2240), 19 states have internal predecessors, (2240), 0 states have call successors, (0), 0 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-30 20:51:21,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 267.0) internal successors, (5340), 20 states have internal predecessors, (5340), 0 states have call successors, (0), 0 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-30 20:51:21,694 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 267.0) internal successors, (5340), 20 states have internal predecessors, (5340), 0 states have call successors, (0), 0 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-30 20:51:21,694 INFO L175 Difference]: Start difference. First operand has 246 places, 541 transitions, 8510 flow. Second operand 19 states and 2240 transitions. [2023-08-30 20:51:21,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 653 transitions, 10998 flow [2023-08-30 20:51:22,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 653 transitions, 10624 flow, removed 66 selfloop flow, removed 14 redundant places. [2023-08-30 20:51:22,092 INFO L231 Difference]: Finished difference. Result has 245 places, 333 transitions, 4452 flow [2023-08-30 20:51:22,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=7921, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4452, PETRI_PLACES=245, PETRI_TRANSITIONS=333} [2023-08-30 20:51:22,093 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2023-08-30 20:51:22,093 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 333 transitions, 4452 flow [2023-08-30 20:51:22,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 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-30 20:51:22,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:22,094 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:22,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:22,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-30 20:51:22,300 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:22,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1545026317, now seen corresponding path program 11 times [2023-08-30 20:51:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087503735] [2023-08-30 20:51:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:22,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087503735] [2023-08-30 20:51:22,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087503735] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:22,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249472373] [2023-08-30 20:51:22,462 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 20:51:22,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:22,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:22,463 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:51:22,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-30 20:51:22,561 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:51:22,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:22,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 20:51:22,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:22,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:22,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249472373] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:22,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:22,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-08-30 20:51:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28478895] [2023-08-30 20:51:22,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:22,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 20:51:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 20:51:22,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-08-30 20:51:23,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 267 [2023-08-30 20:51:23,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 333 transitions, 4452 flow. Second operand has 19 states, 19 states have (on average 107.52631578947368) internal successors, (2043), 19 states have internal predecessors, (2043), 0 states have call successors, (0), 0 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-30 20:51:23,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:23,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 267 [2023-08-30 20:51:23,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:25,120 INFO L130 PetriNetUnfolder]: 3075/4688 cut-off events. [2023-08-30 20:51:25,120 INFO L131 PetriNetUnfolder]: For 75414/75414 co-relation queries the response was YES. [2023-08-30 20:51:25,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38447 conditions, 4688 events. 3075/4688 cut-off events. For 75414/75414 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 24276 event pairs, 156 based on Foata normal form. 28/4716 useless extension candidates. Maximal degree in co-relation 38369. Up to 1638 conditions per place. [2023-08-30 20:51:25,163 INFO L137 encePairwiseOnDemand]: 257/267 looper letters, 423 selfloop transitions, 383 changer transitions 0/806 dead transitions. [2023-08-30 20:51:25,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 806 transitions, 12339 flow [2023-08-30 20:51:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-30 20:51:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-30 20:51:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 5134 transitions. [2023-08-30 20:51:25,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4180100960755577 [2023-08-30 20:51:25,169 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 5134 transitions. [2023-08-30 20:51:25,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 5134 transitions. [2023-08-30 20:51:25,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:25,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 5134 transitions. [2023-08-30 20:51:25,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 111.6086956521739) internal successors, (5134), 46 states have internal predecessors, (5134), 0 states have call successors, (0), 0 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-30 20:51:25,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 267.0) internal successors, (12549), 47 states have internal predecessors, (12549), 0 states have call successors, (0), 0 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-30 20:51:25,186 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 267.0) internal successors, (12549), 47 states have internal predecessors, (12549), 0 states have call successors, (0), 0 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-30 20:51:25,186 INFO L175 Difference]: Start difference. First operand has 245 places, 333 transitions, 4452 flow. Second operand 46 states and 5134 transitions. [2023-08-30 20:51:25,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 806 transitions, 12339 flow [2023-08-30 20:51:25,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 806 transitions, 10727 flow, removed 585 selfloop flow, removed 24 redundant places. [2023-08-30 20:51:25,526 INFO L231 Difference]: Finished difference. Result has 225 places, 547 transitions, 8107 flow [2023-08-30 20:51:25,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=3818, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=8107, PETRI_PLACES=225, PETRI_TRANSITIONS=547} [2023-08-30 20:51:25,527 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2023-08-30 20:51:25,527 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 547 transitions, 8107 flow [2023-08-30 20:51:25,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 107.52631578947368) internal successors, (2043), 19 states have internal predecessors, (2043), 0 states have call successors, (0), 0 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-30 20:51:25,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:25,528 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:25,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:25,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:25,729 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:25,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:25,729 INFO L85 PathProgramCache]: Analyzing trace with hash 41038503, now seen corresponding path program 12 times [2023-08-30 20:51:25,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:25,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123277606] [2023-08-30 20:51:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:25,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:25,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123277606] [2023-08-30 20:51:25,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123277606] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588709360] [2023-08-30 20:51:25,854 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:51:25,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:25,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:25,857 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:51:25,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-30 20:51:25,977 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 20:51:25,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:25,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 20:51:25,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:26,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:26,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588709360] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:26,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-08-30 20:51:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537005657] [2023-08-30 20:51:26,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:26,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 20:51:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 20:51:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-08-30 20:51:26,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 267 [2023-08-30 20:51:26,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 547 transitions, 8107 flow. Second operand has 19 states, 19 states have (on average 111.15789473684211) internal successors, (2112), 19 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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-30 20:51:26,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:26,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 267 [2023-08-30 20:51:26,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:27,376 INFO L130 PetriNetUnfolder]: 3032/4629 cut-off events. [2023-08-30 20:51:27,376 INFO L131 PetriNetUnfolder]: For 94965/94990 co-relation queries the response was YES. [2023-08-30 20:51:27,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40019 conditions, 4629 events. 3032/4629 cut-off events. For 94965/94990 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 24212 event pairs, 450 based on Foata normal form. 75/4695 useless extension candidates. Maximal degree in co-relation 39940. Up to 2264 conditions per place. [2023-08-30 20:51:27,418 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 499 selfloop transitions, 155 changer transitions 0/681 dead transitions. [2023-08-30 20:51:27,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 681 transitions, 11433 flow [2023-08-30 20:51:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 20:51:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 20:51:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1049 transitions. [2023-08-30 20:51:27,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43653766125676235 [2023-08-30 20:51:27,420 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1049 transitions. [2023-08-30 20:51:27,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1049 transitions. [2023-08-30 20:51:27,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:27,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1049 transitions. [2023-08-30 20:51:27,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 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-30 20:51:27,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 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-30 20:51:27,422 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 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-30 20:51:27,422 INFO L175 Difference]: Start difference. First operand has 225 places, 547 transitions, 8107 flow. Second operand 9 states and 1049 transitions. [2023-08-30 20:51:27,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 681 transitions, 11433 flow [2023-08-30 20:51:27,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 681 transitions, 10311 flow, removed 552 selfloop flow, removed 7 redundant places. [2023-08-30 20:51:27,810 INFO L231 Difference]: Finished difference. Result has 222 places, 536 transitions, 7803 flow [2023-08-30 20:51:27,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=6911, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7803, PETRI_PLACES=222, PETRI_TRANSITIONS=536} [2023-08-30 20:51:27,811 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2023-08-30 20:51:27,811 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 536 transitions, 7803 flow [2023-08-30 20:51:27,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 111.15789473684211) internal successors, (2112), 19 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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-30 20:51:27,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:27,812 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:27,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:28,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-30 20:51:28,017 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:28,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash 594494739, now seen corresponding path program 13 times [2023-08-30 20:51:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:28,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753145608] [2023-08-30 20:51:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:28,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753145608] [2023-08-30 20:51:28,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753145608] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:28,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252494518] [2023-08-30 20:51:28,145 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 20:51:28,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:28,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:28,146 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:51:28,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-30 20:51:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:28,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 20:51:28,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:28,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252494518] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:28,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-08-30 20:51:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258472042] [2023-08-30 20:51:28,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:28,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 20:51:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 20:51:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-08-30 20:51:28,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 267 [2023-08-30 20:51:28,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 536 transitions, 7803 flow. Second operand has 21 states, 21 states have (on average 110.85714285714286) internal successors, (2328), 21 states have internal predecessors, (2328), 0 states have call successors, (0), 0 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-30 20:51:28,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:28,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 267 [2023-08-30 20:51:28,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:29,978 INFO L130 PetriNetUnfolder]: 3167/4862 cut-off events. [2023-08-30 20:51:29,978 INFO L131 PetriNetUnfolder]: For 100777/100817 co-relation queries the response was YES. [2023-08-30 20:51:29,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41520 conditions, 4862 events. 3167/4862 cut-off events. For 100777/100817 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 25972 event pairs, 443 based on Foata normal form. 44/4888 useless extension candidates. Maximal degree in co-relation 41441. Up to 2279 conditions per place. [2023-08-30 20:51:30,015 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 487 selfloop transitions, 235 changer transitions 0/749 dead transitions. [2023-08-30 20:51:30,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 749 transitions, 11826 flow [2023-08-30 20:51:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 20:51:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 20:51:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1641 transitions. [2023-08-30 20:51:30,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4390048154093098 [2023-08-30 20:51:30,017 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1641 transitions. [2023-08-30 20:51:30,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1641 transitions. [2023-08-30 20:51:30,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:30,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1641 transitions. [2023-08-30 20:51:30,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 117.21428571428571) internal successors, (1641), 14 states have internal predecessors, (1641), 0 states have call successors, (0), 0 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-30 20:51:30,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 267.0) internal successors, (4005), 15 states have internal predecessors, (4005), 0 states have call successors, (0), 0 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-30 20:51:30,022 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 267.0) internal successors, (4005), 15 states have internal predecessors, (4005), 0 states have call successors, (0), 0 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-30 20:51:30,023 INFO L175 Difference]: Start difference. First operand has 222 places, 536 transitions, 7803 flow. Second operand 14 states and 1641 transitions. [2023-08-30 20:51:30,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 749 transitions, 11826 flow [2023-08-30 20:51:30,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 749 transitions, 11522 flow, removed 79 selfloop flow, removed 6 redundant places. [2023-08-30 20:51:30,390 INFO L231 Difference]: Finished difference. Result has 234 places, 603 transitions, 9433 flow [2023-08-30 20:51:30,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=7568, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=9433, PETRI_PLACES=234, PETRI_TRANSITIONS=603} [2023-08-30 20:51:30,391 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2023-08-30 20:51:30,391 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 603 transitions, 9433 flow [2023-08-30 20:51:30,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 110.85714285714286) internal successors, (2328), 21 states have internal predecessors, (2328), 0 states have call successors, (0), 0 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-30 20:51:30,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:30,392 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:30,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:30,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-30 20:51:30,597 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:30,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1361094559, now seen corresponding path program 14 times [2023-08-30 20:51:30,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:30,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653576691] [2023-08-30 20:51:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:30,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:30,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:30,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653576691] [2023-08-30 20:51:30,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653576691] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:30,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474568446] [2023-08-30 20:51:30,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:51:30,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:30,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:30,719 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:51:30,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-30 20:51:30,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:51:30,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:30,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 20:51:30,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:30,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:30,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474568446] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:30,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:30,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-08-30 20:51:30,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629306784] [2023-08-30 20:51:30,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:31,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 20:51:31,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:31,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 20:51:31,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-08-30 20:51:31,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 267 [2023-08-30 20:51:31,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 603 transitions, 9433 flow. Second operand has 20 states, 20 states have (on average 111.0) internal successors, (2220), 20 states have internal predecessors, (2220), 0 states have call successors, (0), 0 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-30 20:51:31,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:31,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 267 [2023-08-30 20:51:31,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:32,347 INFO L130 PetriNetUnfolder]: 3125/4781 cut-off events. [2023-08-30 20:51:32,348 INFO L131 PetriNetUnfolder]: For 87641/87687 co-relation queries the response was YES. [2023-08-30 20:51:32,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40972 conditions, 4781 events. 3125/4781 cut-off events. For 87641/87687 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 25283 event pairs, 497 based on Foata normal form. 48/4808 useless extension candidates. Maximal degree in co-relation 40890. Up to 2397 conditions per place. [2023-08-30 20:51:32,391 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 484 selfloop transitions, 168 changer transitions 0/679 dead transitions. [2023-08-30 20:51:32,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 679 transitions, 11526 flow [2023-08-30 20:51:32,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 20:51:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 20:51:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1049 transitions. [2023-08-30 20:51:32,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43653766125676235 [2023-08-30 20:51:32,392 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1049 transitions. [2023-08-30 20:51:32,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1049 transitions. [2023-08-30 20:51:32,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:32,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1049 transitions. [2023-08-30 20:51:32,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 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-30 20:51:32,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 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-30 20:51:32,395 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 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-30 20:51:32,395 INFO L175 Difference]: Start difference. First operand has 234 places, 603 transitions, 9433 flow. Second operand 9 states and 1049 transitions. [2023-08-30 20:51:32,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 679 transitions, 11526 flow [2023-08-30 20:51:32,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 679 transitions, 11114 flow, removed 133 selfloop flow, removed 6 redundant places. [2023-08-30 20:51:32,858 INFO L231 Difference]: Finished difference. Result has 234 places, 598 transitions, 9313 flow [2023-08-30 20:51:32,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=8818, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9313, PETRI_PLACES=234, PETRI_TRANSITIONS=598} [2023-08-30 20:51:32,859 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2023-08-30 20:51:32,859 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 598 transitions, 9313 flow [2023-08-30 20:51:32,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 111.0) internal successors, (2220), 20 states have internal predecessors, (2220), 0 states have call successors, (0), 0 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-30 20:51:32,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:32,860 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:32,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:33,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-30 20:51:33,066 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:33,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 649905999, now seen corresponding path program 15 times [2023-08-30 20:51:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916720701] [2023-08-30 20:51:33,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:33,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:33,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:33,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916720701] [2023-08-30 20:51:33,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916720701] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:33,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365537396] [2023-08-30 20:51:33,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:51:33,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:33,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:33,209 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:51:33,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-30 20:51:33,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:51:33,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:33,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 20:51:33,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:33,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:33,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365537396] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:33,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:33,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-08-30 20:51:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081385307] [2023-08-30 20:51:33,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:33,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 20:51:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:33,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 20:51:33,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-08-30 20:51:33,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 267 [2023-08-30 20:51:33,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 598 transitions, 9313 flow. Second operand has 22 states, 22 states have (on average 110.81818181818181) internal successors, (2438), 22 states have internal predecessors, (2438), 0 states have call successors, (0), 0 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-30 20:51:33,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:33,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 267 [2023-08-30 20:51:33,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:34,912 INFO L130 PetriNetUnfolder]: 3095/4720 cut-off events. [2023-08-30 20:51:34,912 INFO L131 PetriNetUnfolder]: For 79505/79551 co-relation queries the response was YES. [2023-08-30 20:51:34,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40081 conditions, 4720 events. 3095/4720 cut-off events. For 79505/79551 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 24784 event pairs, 461 based on Foata normal form. 42/4744 useless extension candidates. Maximal degree in co-relation 40000. Up to 2279 conditions per place. [2023-08-30 20:51:34,960 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 435 selfloop transitions, 226 changer transitions 0/688 dead transitions. [2023-08-30 20:51:34,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 688 transitions, 11564 flow [2023-08-30 20:51:34,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 20:51:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 20:51:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1169 transitions. [2023-08-30 20:51:34,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4378277153558052 [2023-08-30 20:51:34,962 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1169 transitions. [2023-08-30 20:51:34,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1169 transitions. [2023-08-30 20:51:34,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:34,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1169 transitions. [2023-08-30 20:51:34,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.9) internal successors, (1169), 10 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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-30 20:51:34,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 267.0) internal successors, (2937), 11 states have internal predecessors, (2937), 0 states have call successors, (0), 0 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-30 20:51:34,965 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 267.0) internal successors, (2937), 11 states have internal predecessors, (2937), 0 states have call successors, (0), 0 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-30 20:51:34,965 INFO L175 Difference]: Start difference. First operand has 234 places, 598 transitions, 9313 flow. Second operand 10 states and 1169 transitions. [2023-08-30 20:51:34,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 688 transitions, 11564 flow [2023-08-30 20:51:35,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 688 transitions, 11374 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-30 20:51:35,390 INFO L231 Difference]: Finished difference. Result has 236 places, 597 transitions, 9561 flow [2023-08-30 20:51:35,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9109, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9561, PETRI_PLACES=236, PETRI_TRANSITIONS=597} [2023-08-30 20:51:35,392 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2023-08-30 20:51:35,392 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 597 transitions, 9561 flow [2023-08-30 20:51:35,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 110.81818181818181) internal successors, (2438), 22 states have internal predecessors, (2438), 0 states have call successors, (0), 0 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-30 20:51:35,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:35,392 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:35,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:35,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:35,599 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:35,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:35,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1481117643, now seen corresponding path program 16 times [2023-08-30 20:51:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344156182] [2023-08-30 20:51:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:35,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:35,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344156182] [2023-08-30 20:51:35,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344156182] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:35,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871873000] [2023-08-30 20:51:35,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 20:51:35,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:35,745 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:51:35,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-30 20:51:35,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 20:51:35,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:35,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 20:51:35,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:35,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:35,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871873000] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:35,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:35,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-08-30 20:51:35,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776232671] [2023-08-30 20:51:35,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:35,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 20:51:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:35,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 20:51:35,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2023-08-30 20:51:36,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 267 [2023-08-30 20:51:36,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 597 transitions, 9561 flow. Second operand has 20 states, 20 states have (on average 107.35) internal successors, (2147), 20 states have internal predecessors, (2147), 0 states have call successors, (0), 0 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-30 20:51:36,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:36,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 267 [2023-08-30 20:51:36,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:38,209 INFO L130 PetriNetUnfolder]: 3115/4754 cut-off events. [2023-08-30 20:51:38,209 INFO L131 PetriNetUnfolder]: For 83888/83888 co-relation queries the response was YES. [2023-08-30 20:51:38,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40845 conditions, 4754 events. 3115/4754 cut-off events. For 83888/83888 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24753 event pairs, 180 based on Foata normal form. 26/4780 useless extension candidates. Maximal degree in co-relation 40764. Up to 1696 conditions per place. [2023-08-30 20:51:38,259 INFO L137 encePairwiseOnDemand]: 257/267 looper letters, 407 selfloop transitions, 416 changer transitions 0/823 dead transitions. [2023-08-30 20:51:38,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 823 transitions, 13878 flow [2023-08-30 20:51:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-30 20:51:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-30 20:51:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 4154 transitions. [2023-08-30 20:51:38,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42048790363397104 [2023-08-30 20:51:38,264 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 4154 transitions. [2023-08-30 20:51:38,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 4154 transitions. [2023-08-30 20:51:38,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:38,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 4154 transitions. [2023-08-30 20:51:38,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 112.27027027027027) internal successors, (4154), 37 states have internal predecessors, (4154), 0 states have call successors, (0), 0 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-30 20:51:38,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 267.0) internal successors, (10146), 38 states have internal predecessors, (10146), 0 states have call successors, (0), 0 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-30 20:51:38,275 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 267.0) internal successors, (10146), 38 states have internal predecessors, (10146), 0 states have call successors, (0), 0 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-30 20:51:38,275 INFO L175 Difference]: Start difference. First operand has 236 places, 597 transitions, 9561 flow. Second operand 37 states and 4154 transitions. [2023-08-30 20:51:38,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 823 transitions, 13878 flow [2023-08-30 20:51:38,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 823 transitions, 13390 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-08-30 20:51:38,679 INFO L231 Difference]: Finished difference. Result has 263 places, 604 transitions, 10054 flow [2023-08-30 20:51:38,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9050, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=405, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10054, PETRI_PLACES=263, PETRI_TRANSITIONS=604} [2023-08-30 20:51:38,680 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 233 predicate places. [2023-08-30 20:51:38,680 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 604 transitions, 10054 flow [2023-08-30 20:51:38,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 107.35) internal successors, (2147), 20 states have internal predecessors, (2147), 0 states have call successors, (0), 0 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-30 20:51:38,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:38,681 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:38,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:38,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:38,889 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:38,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1869960955, now seen corresponding path program 17 times [2023-08-30 20:51:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:38,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774576070] [2023-08-30 20:51:38,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:38,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:39,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774576070] [2023-08-30 20:51:39,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774576070] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:39,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568898991] [2023-08-30 20:51:39,039 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 20:51:39,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:39,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:39,040 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:51:39,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-30 20:51:39,135 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:51:39,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:39,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 20:51:39,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:39,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:51:39,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568898991] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:39,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:39,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-08-30 20:51:39,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224618250] [2023-08-30 20:51:39,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:39,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 20:51:39,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:39,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 20:51:39,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-08-30 20:51:39,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 267 [2023-08-30 20:51:39,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 604 transitions, 10054 flow. Second operand has 18 states, 18 states have (on average 107.55555555555556) internal successors, (1936), 18 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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-30 20:51:39,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:39,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 267 [2023-08-30 20:51:39,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:41,081 INFO L130 PetriNetUnfolder]: 3081/4688 cut-off events. [2023-08-30 20:51:41,082 INFO L131 PetriNetUnfolder]: For 84903/84903 co-relation queries the response was YES. [2023-08-30 20:51:41,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41245 conditions, 4688 events. 3081/4688 cut-off events. For 84903/84903 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 24287 event pairs, 315 based on Foata normal form. 26/4714 useless extension candidates. Maximal degree in co-relation 41164. Up to 2764 conditions per place. [2023-08-30 20:51:41,130 INFO L137 encePairwiseOnDemand]: 257/267 looper letters, 438 selfloop transitions, 274 changer transitions 0/712 dead transitions. [2023-08-30 20:51:41,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 712 transitions, 12793 flow [2023-08-30 20:51:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-30 20:51:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-30 20:51:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2116 transitions. [2023-08-30 20:51:41,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41711019120835796 [2023-08-30 20:51:41,134 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2116 transitions. [2023-08-30 20:51:41,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2116 transitions. [2023-08-30 20:51:41,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:41,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2116 transitions. [2023-08-30 20:51:41,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 111.36842105263158) internal successors, (2116), 19 states have internal predecessors, (2116), 0 states have call successors, (0), 0 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-30 20:51:41,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 267.0) internal successors, (5340), 20 states have internal predecessors, (5340), 0 states have call successors, (0), 0 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-30 20:51:41,140 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 267.0) internal successors, (5340), 20 states have internal predecessors, (5340), 0 states have call successors, (0), 0 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-30 20:51:41,140 INFO L175 Difference]: Start difference. First operand has 263 places, 604 transitions, 10054 flow. Second operand 19 states and 2116 transitions. [2023-08-30 20:51:41,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 712 transitions, 12793 flow [2023-08-30 20:51:41,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 712 transitions, 11927 flow, removed 27 selfloop flow, removed 28 redundant places. [2023-08-30 20:51:41,548 INFO L231 Difference]: Finished difference. Result has 256 places, 607 transitions, 9860 flow [2023-08-30 20:51:41,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9169, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9860, PETRI_PLACES=256, PETRI_TRANSITIONS=607} [2023-08-30 20:51:41,549 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2023-08-30 20:51:41,549 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 607 transitions, 9860 flow [2023-08-30 20:51:41,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 107.55555555555556) internal successors, (1936), 18 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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-30 20:51:41,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:41,549 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:41,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:41,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-30 20:51:41,750 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:41,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash 166044145, now seen corresponding path program 18 times [2023-08-30 20:51:41,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:41,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575467161] [2023-08-30 20:51:41,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575467161] [2023-08-30 20:51:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575467161] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966932543] [2023-08-30 20:51:41,890 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:51:41,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:41,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:41,893 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:51:41,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-30 20:51:42,009 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-30 20:51:42,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:42,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 20:51:42,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:42,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:51:42,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966932543] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:51:42,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:51:42,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-08-30 20:51:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932482326] [2023-08-30 20:51:42,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:51:42,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 20:51:42,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:51:42,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 20:51:42,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-08-30 20:51:42,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 267 [2023-08-30 20:51:42,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 607 transitions, 9860 flow. Second operand has 20 states, 20 states have (on average 111.1) internal successors, (2222), 20 states have internal predecessors, (2222), 0 states have call successors, (0), 0 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-30 20:51:42,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:51:42,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 267 [2023-08-30 20:51:42,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:51:43,611 INFO L130 PetriNetUnfolder]: 2991/4549 cut-off events. [2023-08-30 20:51:43,611 INFO L131 PetriNetUnfolder]: For 77876/77916 co-relation queries the response was YES. [2023-08-30 20:51:43,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38574 conditions, 4549 events. 2991/4549 cut-off events. For 77876/77916 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 23612 event pairs, 402 based on Foata normal form. 50/4588 useless extension candidates. Maximal degree in co-relation 38490. Up to 1849 conditions per place. [2023-08-30 20:51:43,659 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 349 selfloop transitions, 285 changer transitions 0/662 dead transitions. [2023-08-30 20:51:43,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 662 transitions, 11656 flow [2023-08-30 20:51:43,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 20:51:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 20:51:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1048 transitions. [2023-08-30 20:51:43,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43612151477320016 [2023-08-30 20:51:43,661 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1048 transitions. [2023-08-30 20:51:43,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1048 transitions. [2023-08-30 20:51:43,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:51:43,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1048 transitions. [2023-08-30 20:51:43,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.44444444444444) internal successors, (1048), 9 states have internal predecessors, (1048), 0 states have call successors, (0), 0 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-30 20:51:43,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 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-30 20:51:43,666 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 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-30 20:51:43,666 INFO L175 Difference]: Start difference. First operand has 256 places, 607 transitions, 9860 flow. Second operand 9 states and 1048 transitions. [2023-08-30 20:51:43,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 662 transitions, 11656 flow [2023-08-30 20:51:44,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 662 transitions, 11209 flow, removed 0 selfloop flow, removed 16 redundant places. [2023-08-30 20:51:44,066 INFO L231 Difference]: Finished difference. Result has 245 places, 599 transitions, 9876 flow [2023-08-30 20:51:44,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9306, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9876, PETRI_PLACES=245, PETRI_TRANSITIONS=599} [2023-08-30 20:51:44,067 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2023-08-30 20:51:44,067 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 599 transitions, 9876 flow [2023-08-30 20:51:44,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 111.1) internal successors, (2222), 20 states have internal predecessors, (2222), 0 states have call successors, (0), 0 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-30 20:51:44,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:51:44,068 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:51:44,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-30 20:51:44,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-30 20:51:44,268 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:51:44,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:51:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash -567491001, now seen corresponding path program 3 times [2023-08-30 20:51:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:51:44,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947718401] [2023-08-30 20:51:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:51:44,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:51:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:51:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:51:46,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:51:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947718401] [2023-08-30 20:51:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947718401] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:51:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897957597] [2023-08-30 20:51:46,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:51:46,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:51:46,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:51:46,667 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:51:46,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-30 20:51:46,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:51:46,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:51:46,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-30 20:51:46,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:51:46,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 20:51:46,957 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-30 20:51:47,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:51:47,307 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 86 treesize of output 70 [2023-08-30 20:51:47,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:51:47,505 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 86 treesize of output 70 [2023-08-30 20:51:48,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:51:48,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 89 [2023-08-30 20:51:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:51:49,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:51:52,846 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~min1~0 1))) (let ((.cse2 (<= c_~min3~0 c_~min1~0)) (.cse3 (<= c_~min1~0 c_~min3~0)) (.cse1 (<= c_~min1~0 c_~min2~0)) (.cse0 (< c_~min2~0 .cse8))) (and (or (and (<= c_~min2~0 c_~min3~0) .cse0 .cse1) (and .cse2 .cse1 .cse3) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (select .cse4 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (< (select .cse4 c_~A~0.offset) c_~min2~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse7 (select .cse6 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse5) (<= .cse5 c_~min1~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0)))) (<= c_~min2~0 .cse7) (< .cse7 .cse8))))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse9 (select .cse10 c_~A~0.offset))) (or (<= c_~min2~0 .cse9) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (select .cse10 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (< .cse9 .cse8) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) .cse2) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse11 (select .cse12 c_~A~0.offset))) (or (<= c_~min2~0 .cse11) (<= .cse11 c_~min3~0) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (select .cse12 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) .cse3) (or .cse1 (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 (select .cse13 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4)))) (< (select .cse13 c_~A~0.offset) c_~min2~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse14 (select .cse15 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse14) (< (select .cse15 c_~A~0.offset) c_~min2~0) (<= .cse14 c_~min1~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) .cse0) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse16 (select .cse18 c_~A~0.offset))) (or (<= c_~min2~0 .cse16) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse17 (select .cse18 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (<= c_~min1~0 .cse17) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse17) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0) (<= .cse16 .cse17)))))))) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset))) (or (<= c_~min2~0 .cse19) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 (select .cse20 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4)))) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))) (<= c_~min1~0 .cse19))))) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (or (< (select .cse21 c_~A~0.offset) c_~min2~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse22 (select .cse21 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (<= c_~min1~0 .cse22) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse22) (<= c_~min2~0 .cse22) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))))) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1040 (Array Int Int))) (or (forall ((v_ArrVal_1041 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (<= c_~min2~0 .cse23) (< (select .cse24 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (<= c_~min1~0 .cse23))))) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0)))))) is different from false [2023-08-30 20:52:01,745 WARN L222 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:52:27,449 WARN L222 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 250 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:52:29,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:29,284 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 182 treesize of output 110 [2023-08-30 20:52:29,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:29,304 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 1303 treesize of output 1167 [2023-08-30 20:52:29,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:29,352 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 258 treesize of output 246 [2023-08-30 20:52:29,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:29,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 210 treesize of output 190 [2023-08-30 20:52:29,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:29,410 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 242 treesize of output 210 [2023-08-30 20:52:31,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:31,588 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 201 treesize of output 117 [2023-08-30 20:52:31,623 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-08-30 20:52:31,623 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 5101 treesize of output 4548 [2023-08-30 20:52:31,685 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:31,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:31,696 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 291 treesize of output 261 [2023-08-30 20:52:31,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:31,730 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 170 treesize of output 158 [2023-08-30 20:52:31,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:31,800 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 187 treesize of output 155 [2023-08-30 20:52:32,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:32,230 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 156 treesize of output 96 [2023-08-30 20:52:32,261 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:32,262 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 2414 treesize of output 2136 [2023-08-30 20:52:32,348 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:52:32,348 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 180 treesize of output 164 [2023-08-30 20:52:32,393 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:32,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 214 [2023-08-30 20:52:32,433 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:52:32,434 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 179 treesize of output 143 [2023-08-30 20:52:32,756 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:32,756 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 148 treesize of output 1 [2023-08-30 20:52:32,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:32,771 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 148 treesize of output 88 [2023-08-30 20:52:32,777 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:32,778 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:32,791 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:32,791 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 124 treesize of output 98 [2023-08-30 20:52:32,806 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:32,807 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 54 treesize of output 40 [2023-08-30 20:52:32,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:32,850 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 131 treesize of output 83 [2023-08-30 20:52:32,856 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:32,856 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:32,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:32,870 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 122 treesize of output 110 [2023-08-30 20:52:32,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:32,890 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 54 treesize of output 52 [2023-08-30 20:52:33,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:33,298 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 107 treesize of output 71 [2023-08-30 20:52:33,304 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:33,305 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:33,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:33,324 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 97 treesize of output 91 [2023-08-30 20:52:33,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:33,345 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 43 treesize of output 45 [2023-08-30 20:52:33,489 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:33,489 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 217 treesize of output 1 [2023-08-30 20:52:33,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:33,506 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 150 treesize of output 90 [2023-08-30 20:52:33,511 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:33,512 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:33,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:33,528 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 128 treesize of output 112 [2023-08-30 20:52:33,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:33,557 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 56 treesize of output 52 [2023-08-30 20:52:33,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:33,792 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 150 treesize of output 90 [2023-08-30 20:52:33,799 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:33,800 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:33,815 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:33,815 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 128 treesize of output 100 [2023-08-30 20:52:33,860 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:33,861 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 56 treesize of output 40 [2023-08-30 20:52:33,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:33,904 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 230 treesize of output 134 [2023-08-30 20:52:33,912 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:33,912 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:33,932 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-08-30 20:52:33,932 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 273 treesize of output 206 [2023-08-30 20:52:33,956 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:33,957 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 77 treesize of output 49 [2023-08-30 20:52:34,012 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:34,012 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 234 treesize of output 1 [2023-08-30 20:52:34,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:34,040 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 135 treesize of output 87 [2023-08-30 20:52:34,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,062 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,062 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 118 treesize of output 96 [2023-08-30 20:52:34,097 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,097 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 52 treesize of output 40 [2023-08-30 20:52:34,141 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:34,142 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 157 treesize of output 1 [2023-08-30 20:52:34,162 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:34,163 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 172 treesize of output 1 [2023-08-30 20:52:34,187 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:34,187 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 150 treesize of output 1 [2023-08-30 20:52:34,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:34,205 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 137 treesize of output 89 [2023-08-30 20:52:34,212 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,228 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,228 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 122 treesize of output 100 [2023-08-30 20:52:34,252 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,253 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 54 treesize of output 42 [2023-08-30 20:52:34,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:34,315 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 178 treesize of output 106 [2023-08-30 20:52:34,323 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,324 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,341 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,341 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 149 treesize of output 117 [2023-08-30 20:52:34,395 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,396 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 65 treesize of output 47 [2023-08-30 20:52:34,449 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:34,449 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 156 treesize of output 1 [2023-08-30 20:52:34,472 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:34,472 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 172 treesize of output 1 [2023-08-30 20:52:34,490 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:34,490 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 150 treesize of output 1 [2023-08-30 20:52:34,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:34,515 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 148 treesize of output 88 [2023-08-30 20:52:34,523 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,523 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,541 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,542 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 124 treesize of output 98 [2023-08-30 20:52:34,581 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,582 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 54 treesize of output 40 [2023-08-30 20:52:34,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:34,629 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 139 treesize of output 91 [2023-08-30 20:52:34,637 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,638 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,655 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,655 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 126 treesize of output 100 [2023-08-30 20:52:34,679 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,679 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 56 treesize of output 40 [2023-08-30 20:52:34,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:34,741 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 176 treesize of output 104 [2023-08-30 20:52:34,750 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,750 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,768 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,768 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 124 treesize of output 98 [2023-08-30 20:52:34,792 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,793 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 54 treesize of output 40 [2023-08-30 20:52:34,865 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:34,865 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 169 treesize of output 1 [2023-08-30 20:52:34,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:52:34,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 71 [2023-08-30 20:52:34,939 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,940 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:52:34,963 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:34,964 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 97 treesize of output 79 [2023-08-30 20:52:35,003 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 20:52:35,003 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 43 treesize of output 33 [2023-08-30 20:52:35,087 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,087 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 226 treesize of output 1 [2023-08-30 20:52:35,119 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,120 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 155 treesize of output 1 [2023-08-30 20:52:35,144 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,145 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 173 treesize of output 1 [2023-08-30 20:52:35,178 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,178 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 205 treesize of output 1 [2023-08-30 20:52:35,202 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,203 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 176 treesize of output 1 [2023-08-30 20:52:35,226 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,227 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 135 treesize of output 1 [2023-08-30 20:52:35,263 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,263 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 131 treesize of output 1 [2023-08-30 20:52:35,283 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,284 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 175 treesize of output 1 [2023-08-30 20:52:35,312 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 1 [2023-08-30 20:52:35,333 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,333 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 196 treesize of output 1 [2023-08-30 20:52:35,361 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 1 [2023-08-30 20:52:35,390 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,391 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 174 treesize of output 1 [2023-08-30 20:52:35,412 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,413 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 155 treesize of output 1 [2023-08-30 20:52:35,442 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,442 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 201 treesize of output 1 [2023-08-30 20:52:35,470 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,471 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 157 treesize of output 1 [2023-08-30 20:52:35,494 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,495 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 176 treesize of output 1 [2023-08-30 20:52:35,524 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,525 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 211 treesize of output 1 [2023-08-30 20:52:35,555 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,555 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 131 treesize of output 1 [2023-08-30 20:52:35,583 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,584 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 173 treesize of output 1 [2023-08-30 20:52:35,605 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,606 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 174 treesize of output 1 [2023-08-30 20:52:35,628 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,629 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 148 treesize of output 1 [2023-08-30 20:52:35,660 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,660 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 192 treesize of output 1 [2023-08-30 20:52:35,693 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,693 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 209 treesize of output 1 [2023-08-30 20:52:35,725 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,725 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 175 treesize of output 1 [2023-08-30 20:52:35,749 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,749 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 159 treesize of output 1 [2023-08-30 20:52:35,782 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,782 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 197 treesize of output 1 [2023-08-30 20:52:35,813 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,813 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 211 treesize of output 1 [2023-08-30 20:52:35,844 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,844 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 186 treesize of output 1 [2023-08-30 20:52:35,868 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,868 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 131 treesize of output 1 [2023-08-30 20:52:35,895 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:52:35,895 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 135 treesize of output 1 [2023-08-30 20:52:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:52:36,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897957597] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:52:36,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:52:36,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2023-08-30 20:52:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64185430] [2023-08-30 20:52:36,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:52:36,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-30 20:52:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:52:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-30 20:52:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1395, Unknown=17, NotChecked=76, Total=1640 [2023-08-30 20:52:37,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 267 [2023-08-30 20:52:37,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 599 transitions, 9876 flow. Second operand has 41 states, 41 states have (on average 70.82926829268293) internal successors, (2904), 41 states have internal predecessors, (2904), 0 states have call successors, (0), 0 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-30 20:52:37,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:52:37,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 267 [2023-08-30 20:52:37,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:52:56,533 WARN L222 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 268 DAG size of output: 124 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:53:07,635 WARN L222 SmtUtils]: Spent 6.66s on a formula simplification. DAG size of input: 297 DAG size of output: 123 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:53:17,193 WARN L222 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 232 DAG size of output: 107 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:53:19,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:53:28,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:53:31,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:53:32,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:53:34,991 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-30 20:53:37,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-30 20:53:39,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:53:42,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:53:48,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:53:51,054 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-30 20:53:53,121 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-30 20:53:55,163 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-30 20:53:57,269 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-30 20:53:59,315 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-30 20:54:01,351 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-30 20:54:05,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:54:07,481 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-30 20:54:10,236 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-30 20:54:12,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:56:00,039 WARN L222 SmtUtils]: Spent 1.67m on a formula simplification. DAG size of input: 326 DAG size of output: 192 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:56:02,697 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-30 20:56:04,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:56:07,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:57:56,431 WARN L222 SmtUtils]: Spent 1.64m on a formula simplification. DAG size of input: 279 DAG size of output: 159 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:57:58,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:58:04,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:58:13,356 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-30 20:58:15,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:58:16,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:58:19,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:58:21,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:58:24,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:58:33,530 WARN L222 SmtUtils]: Spent 5.98s on a formula simplification. DAG size of input: 336 DAG size of output: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:58:35,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-30 20:58:37,619 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-30 20:58:55,932 WARN L222 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 300 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:58:57,959 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-30 20:59:00,012 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-30 20:59:02,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:59:18,669 WARN L222 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 301 DAG size of output: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:59:29,651 WARN L222 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 297 DAG size of output: 125 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:59:32,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:59:34,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:59:37,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:59:39,652 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-30 20:59:42,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:59:42,243 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~min1~0 1))) (let ((.cse13 (<= c_~min3~0 c_~min1~0)) (.cse16 (<= c_~min1~0 c_~min3~0)) (.cse2 (< c_~min2~0 .cse10)) (.cse1 (<= c_~min1~0 c_~min2~0))) (let ((.cse4 (and (<= c_~min2~0 c_~min3~0) .cse2 .cse1)) (.cse5 (and .cse13 .cse1 .cse16)) (.cse0 (select |c_#memory_int| c_~A~0.base))) (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 (select .cse0 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4)))) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))) .cse1) (or .cse2 (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse3 (select .cse0 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse3) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0) (<= .cse3 c_~min1~0))))) (or .cse4 .cse5 (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (select .cse6 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (< (select .cse6 c_~A~0.offset) c_~min2~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse9 (select .cse8 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse7 (select .cse8 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse7) (<= .cse7 c_~min1~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0)))) (<= c_~min2~0 .cse9) (< .cse9 .cse10))))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse11 (select .cse12 c_~A~0.offset))) (or (<= c_~min2~0 .cse11) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (select .cse12 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (< .cse11 .cse10) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) .cse13) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse14 (select .cse15 c_~A~0.offset))) (or (<= c_~min2~0 .cse14) (<= .cse14 c_~min3~0) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (select .cse15 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) .cse16) (or .cse1 (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 (select .cse17 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4)))) (< (select .cse17 c_~A~0.offset) c_~min2~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse18 (select .cse19 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse18) (< (select .cse19 c_~A~0.offset) c_~min2~0) (<= .cse18 c_~min1~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) .cse2) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse20 (select .cse22 c_~A~0.offset))) (or (<= c_~min2~0 .cse20) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse21 (select .cse22 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (<= c_~min1~0 .cse21) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse21) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0) (<= .cse20 .cse21)))))))) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (<= c_~min2~0 .cse23) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 (select .cse24 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4)))) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))) (<= c_~min1~0 .cse23))))) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (or (< (select .cse25 c_~A~0.offset) c_~min2~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse26 (select .cse25 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (<= c_~min1~0 .cse26) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse26) (<= c_~min2~0 .cse26) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))))) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse27 (select .cse0 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse27) (<= c_~min1~0 .cse27) (<= c_~min2~0 .cse27) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0)))) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1040 (Array Int Int))) (or (forall ((v_ArrVal_1041 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse28 (select .cse29 c_~A~0.offset))) (or (<= c_~min2~0 .cse28) (< (select .cse29 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (<= c_~min1~0 .cse28))))) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))) (or .cse4 .cse5 (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0) (< (select .cse0 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0)))))))) is different from false [2023-08-30 20:59:45,360 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-30 20:59:47,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:59:56,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 21:03:08,775 WARN L222 SmtUtils]: Spent 2.91m on a formula simplification. DAG size of input: 326 DAG size of output: 217 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 21:03:10,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 21:03:12,752 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-30 21:03:15,244 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-30 21:03:17,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 21:03:19,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 21:03:20,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 21:03:22,891 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] Killed by 15