./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --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-29 19:29:15,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:29:15,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:29:15,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:29:15,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:29:15,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:29:15,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:29:15,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:29:15,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:29:15,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:29:15,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:29:15,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:29:15,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:29:15,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:29:15,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:29:15,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:29:15,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:29:15,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:29:15,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:29:15,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:29:15,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:29:15,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:29:15,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:29:15,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:29:15,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:29:15,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:29:15,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:29:15,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:29:15,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:29:15,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:29:15,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:29:15,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:29:15,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:29:15,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:29:15,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:29:15,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:29:15,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:29:15,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:29:15,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:29:15,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:29:15,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:29:15,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 19:29:15,247 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:29:15,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:29:15,248 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:29:15,248 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:29:15,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:29:15,249 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:29:15,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:29:15,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:29:15,249 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:29:15,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:29:15,250 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:29:15,250 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:29:15,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:29:15,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:29:15,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:29:15,251 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:29:15,251 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:29:15,251 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:29:15,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:29:15,251 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:29:15,252 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:29:15,252 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:29:15,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:29:15,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:29:15,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:29:15,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:29:15,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:29:15,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:29:15,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 19:29:15,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 19:29:15,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:29:15,253 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:29:15,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:29:15,254 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:29:15,254 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 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-29 19:29:15,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:29:15,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:29:15,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:29:15,505 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:29:15,505 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:29:15,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-08-29 19:29:16,445 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:29:16,603 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:29:16,610 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-08-29 19:29:16,622 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76817c65/f395ef103e7f48ddbc64e1bc1add799d/FLAG17fafca23 [2023-08-29 19:29:16,637 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76817c65/f395ef103e7f48ddbc64e1bc1add799d [2023-08-29 19:29:16,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:29:16,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:29:16,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:29:16,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:29:16,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:29:16,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:29:16" (1/1) ... [2023-08-29 19:29:16,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197d45a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:16, skipping insertion in model container [2023-08-29 19:29:16,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:29:16" (1/1) ... [2023-08-29 19:29:16,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:29:16,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:29:17,022 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-08-29 19:29:17,024 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-08-29 19:29:17,028 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:29:17,036 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:29:17,066 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-08-29 19:29:17,068 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-08-29 19:29:17,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:29:17,108 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:29:17,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17 WrapperNode [2023-08-29 19:29:17,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:29:17,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:29:17,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:29:17,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:29:17,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,163 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-08-29 19:29:17,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:29:17,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:29:17,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:29:17,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:29:17,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,187 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:29:17,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:29:17,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:29:17,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:29:17,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:29:17,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:17,224 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-29 19:29:17,226 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-29 19:29:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-29 19:29:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-29 19:29:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-29 19:29:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-29 19:29:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:29:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:29:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 19:29:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 19:29:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 19:29:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:29:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 19:29:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:29:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:29:17,255 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 19:29:17,359 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:29:17,360 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:29:17,683 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:29:17,689 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:29:17,689 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-29 19:29:17,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:29:17 BoogieIcfgContainer [2023-08-29 19:29:17,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:29:17,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:29:17,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:29:17,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:29:17,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:29:16" (1/3) ... [2023-08-29 19:29:17,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715edf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:29:17, skipping insertion in model container [2023-08-29 19:29:17,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (2/3) ... [2023-08-29 19:29:17,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715edf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:29:17, skipping insertion in model container [2023-08-29 19:29:17,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:29:17" (3/3) ... [2023-08-29 19:29:17,696 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-08-29 19:29:17,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:29:17,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-29 19:29:17,706 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:29:17,816 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 19:29:17,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 278 transitions, 572 flow [2023-08-29 19:29:17,965 INFO L130 PetriNetUnfolder]: 13/276 cut-off events. [2023-08-29 19:29:17,965 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:29:17,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 276 events. 13/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 677 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 185. Up to 3 conditions per place. [2023-08-29 19:29:17,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 278 transitions, 572 flow [2023-08-29 19:29:17,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 272 transitions, 556 flow [2023-08-29 19:29:17,982 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:29:17,992 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-29 19:29:17,995 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-29 19:29:17,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 272 transitions, 556 flow [2023-08-29 19:29:18,036 INFO L130 PetriNetUnfolder]: 13/272 cut-off events. [2023-08-29 19:29:18,037 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:29:18,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 272 events. 13/272 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 660 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 185. Up to 3 conditions per place. [2023-08-29 19:29:18,046 INFO L119 LiptonReduction]: Number of co-enabled transitions 17820 [2023-08-29 19:29:28,869 INFO L134 LiptonReduction]: Checked pairs total: 64286 [2023-08-29 19:29:28,869 INFO L136 LiptonReduction]: Total number of compositions: 358 [2023-08-29 19:29:28,878 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:29:28,881 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@34501efb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:29:28,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-08-29 19:29:28,883 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 19:29:28,883 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:29:28,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:28,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 19:29:28,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:28,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1161, now seen corresponding path program 1 times [2023-08-29 19:29:28,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:28,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468219648] [2023-08-29 19:29:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:28,985 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-29 19:29:28,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468219648] [2023-08-29 19:29:28,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468219648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:28,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:28,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 19:29:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994656826] [2023-08-29 19:29:28,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:28,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:29:28,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:29,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:29:29,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:29:29,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 636 [2023-08-29 19:29:29,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 267.5) internal successors, (535), 2 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-29 19:29:29,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:29,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 636 [2023-08-29 19:29:29,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:29,458 INFO L130 PetriNetUnfolder]: 3797/6059 cut-off events. [2023-08-29 19:29:29,458 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-29 19:29:29,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11913 conditions, 6059 events. 3797/6059 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 34868 event pairs, 3185 based on Foata normal form. 0/3159 useless extension candidates. Maximal degree in co-relation 11458. Up to 5786 conditions per place. [2023-08-29 19:29:29,481 INFO L137 encePairwiseOnDemand]: 600/636 looper letters, 61 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2023-08-29 19:29:29,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 274 flow [2023-08-29 19:29:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:29:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:29:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 631 transitions. [2023-08-29 19:29:29,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960691823899371 [2023-08-29 19:29:29,495 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 631 transitions. [2023-08-29 19:29:29,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 631 transitions. [2023-08-29 19:29:29,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:29,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 631 transitions. [2023-08-29 19:29:29,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 315.5) internal successors, (631), 2 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:29,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 0 states have call successors, (0), 0 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-29 19:29:29,508 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 0 states have call successors, (0), 0 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-29 19:29:29,509 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 224 flow. Second operand 2 states and 631 transitions. [2023-08-29 19:29:29,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 274 flow [2023-08-29 19:29:29,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 266 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 19:29:29,514 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2023-08-29 19:29:29,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2023-08-29 19:29:29,517 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-29 19:29:29,518 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2023-08-29 19:29:29,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 267.5) internal successors, (535), 2 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-29 19:29:29,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:29,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:29:29,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 19:29:29,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:29,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:29,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1154497, now seen corresponding path program 1 times [2023-08-29 19:29:29,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:29,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407456251] [2023-08-29 19:29:29,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:29,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:29,680 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-29 19:29:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:29,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407456251] [2023-08-29 19:29:29,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407456251] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:29:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226016852] [2023-08-29 19:29:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:29,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:29,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:29,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:29,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:29,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 636 [2023-08-29 19:29:29,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-29 19:29:29,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:29,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 636 [2023-08-29 19:29:29,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:30,151 INFO L130 PetriNetUnfolder]: 3749/5963 cut-off events. [2023-08-29 19:29:30,152 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 19:29:30,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11680 conditions, 5963 events. 3749/5963 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 34055 event pairs, 3144 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 11677. Up to 5693 conditions per place. [2023-08-29 19:29:30,171 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 57 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-29 19:29:30,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 258 flow [2023-08-29 19:29:30,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2023-08-29 19:29:30,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43763102725366876 [2023-08-29 19:29:30,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2023-08-29 19:29:30,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2023-08-29 19:29:30,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:30,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2023-08-29 19:29:30,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 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-29 19:29:30,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:30,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:30,180 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 144 flow. Second operand 3 states and 835 transitions. [2023-08-29 19:29:30,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 258 flow [2023-08-29 19:29:30,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:29:30,181 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2023-08-29 19:29:30,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-08-29 19:29:30,182 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-29 19:29:30,182 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2023-08-29 19:29:30,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-29 19:29:30,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:30,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:29:30,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 19:29:30,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:30,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1154498, now seen corresponding path program 1 times [2023-08-29 19:29:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:30,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287361937] [2023-08-29 19:29:30,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:30,263 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-29 19:29:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:30,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287361937] [2023-08-29 19:29:30,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287361937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:30,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:29:30,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53730651] [2023-08-29 19:29:30,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:30,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:30,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:30,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:30,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:29:30,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 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-29 19:29:30,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:30,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:29:30,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:30,721 INFO L130 PetriNetUnfolder]: 3701/5867 cut-off events. [2023-08-29 19:29:30,721 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 19:29:30,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11496 conditions, 5867 events. 3701/5867 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 33381 event pairs, 3103 based on Foata normal form. 0/3097 useless extension candidates. Maximal degree in co-relation 11492. Up to 5602 conditions per place. [2023-08-29 19:29:30,741 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 55 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-29 19:29:30,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 254 flow [2023-08-29 19:29:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2023-08-29 19:29:30,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44287211740041926 [2023-08-29 19:29:30,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 845 transitions. [2023-08-29 19:29:30,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 845 transitions. [2023-08-29 19:29:30,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:30,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 845 transitions. [2023-08-29 19:29:30,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 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-29 19:29:30,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:30,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:30,749 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 144 flow. Second operand 3 states and 845 transitions. [2023-08-29 19:29:30,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 254 flow [2023-08-29 19:29:30,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:30,750 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2023-08-29 19:29:30,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-29 19:29:30,751 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2023-08-29 19:29:30,751 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2023-08-29 19:29:30,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 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-29 19:29:30,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:30,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:29:30,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 19:29:30,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:30,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496233, now seen corresponding path program 1 times [2023-08-29 19:29:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433585588] [2023-08-29 19:29:30,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:31,118 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-29 19:29:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433585588] [2023-08-29 19:29:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433585588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:31,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:31,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:29:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20107307] [2023-08-29 19:29:31,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:31,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:31,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:31,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-29 19:29:31,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 0 states have call successors, (0), 0 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-29 19:29:31,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:31,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-29 19:29:31,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:31,608 INFO L130 PetriNetUnfolder]: 3800/6080 cut-off events. [2023-08-29 19:29:31,608 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 19:29:31,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11915 conditions, 6080 events. 3800/6080 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 35011 event pairs, 2674 based on Foata normal form. 0/3121 useless extension candidates. Maximal degree in co-relation 11911. Up to 5801 conditions per place. [2023-08-29 19:29:31,629 INFO L137 encePairwiseOnDemand]: 630/636 looper letters, 63 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-08-29 19:29:31,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 292 flow [2023-08-29 19:29:31,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-08-29 19:29:31,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-29 19:29:31,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-08-29 19:29:31,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-08-29 19:29:31,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:31,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-08-29 19:29:31,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 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-29 19:29:31,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:31,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:31,642 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 140 flow. Second operand 3 states and 831 transitions. [2023-08-29 19:29:31,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 292 flow [2023-08-29 19:29:31,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:31,645 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 164 flow [2023-08-29 19:29:31,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2023-08-29 19:29:31,647 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2023-08-29 19:29:31,647 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 164 flow [2023-08-29 19:29:31,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 0 states have call successors, (0), 0 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-29 19:29:31,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:31,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:29:31,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 19:29:31,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:31,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496236, now seen corresponding path program 1 times [2023-08-29 19:29:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:31,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938187324] [2023-08-29 19:29:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:31,717 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-29 19:29:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938187324] [2023-08-29 19:29:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938187324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:31,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:29:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658351175] [2023-08-29 19:29:31,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:31,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:31,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:31,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:31,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:31,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 636 [2023-08-29 19:29:31,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 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-29 19:29:31,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:31,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 636 [2023-08-29 19:29:31,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:32,107 INFO L130 PetriNetUnfolder]: 3253/5163 cut-off events. [2023-08-29 19:29:32,108 INFO L131 PetriNetUnfolder]: For 213/296 co-relation queries the response was YES. [2023-08-29 19:29:32,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10409 conditions, 5163 events. 3253/5163 cut-off events. For 213/296 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 28741 event pairs, 2677 based on Foata normal form. 0/2957 useless extension candidates. Maximal degree in co-relation 10404. Up to 4914 conditions per place. [2023-08-29 19:29:32,122 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 54 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-29 19:29:32,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 270 flow [2023-08-29 19:29:32,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2023-08-29 19:29:32,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449685534591195 [2023-08-29 19:29:32,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2023-08-29 19:29:32,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2023-08-29 19:29:32,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:32,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2023-08-29 19:29:32,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 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-29 19:29:32,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:32,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:32,129 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 164 flow. Second operand 3 states and 849 transitions. [2023-08-29 19:29:32,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 270 flow [2023-08-29 19:29:32,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:29:32,131 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 158 flow [2023-08-29 19:29:32,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2023-08-29 19:29:32,131 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-29 19:29:32,132 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 158 flow [2023-08-29 19:29:32,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 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-29 19:29:32,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:32,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:29:32,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 19:29:32,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:32,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495978, now seen corresponding path program 1 times [2023-08-29 19:29:32,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:32,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033254831] [2023-08-29 19:29:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:32,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:32,179 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-29 19:29:32,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:32,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033254831] [2023-08-29 19:29:32,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033254831] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:32,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:32,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:29:32,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683362714] [2023-08-29 19:29:32,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:32,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:32,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:32,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:32,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:32,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:29:32,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-29 19:29:32,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:32,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:29:32,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:32,469 INFO L130 PetriNetUnfolder]: 2363/3821 cut-off events. [2023-08-29 19:29:32,470 INFO L131 PetriNetUnfolder]: For 169/231 co-relation queries the response was YES. [2023-08-29 19:29:32,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7709 conditions, 3821 events. 2363/3821 cut-off events. For 169/231 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 20578 event pairs, 1925 based on Foata normal form. 0/2357 useless extension candidates. Maximal degree in co-relation 7704. Up to 3628 conditions per place. [2023-08-29 19:29:32,479 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 53 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-29 19:29:32,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 266 flow [2023-08-29 19:29:32,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-08-29 19:29:32,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2023-08-29 19:29:32,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-08-29 19:29:32,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-08-29 19:29:32,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:32,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-08-29 19:29:32,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 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-29 19:29:32,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:32,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:32,487 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 158 flow. Second operand 3 states and 840 transitions. [2023-08-29 19:29:32,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 266 flow [2023-08-29 19:29:32,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:32,488 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 156 flow [2023-08-29 19:29:32,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-29 19:29:32,489 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-29 19:29:32,489 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 156 flow [2023-08-29 19:29:32,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-29 19:29:32,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:32,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:29:32,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 19:29:32,490 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:32,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495977, now seen corresponding path program 1 times [2023-08-29 19:29:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:32,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706620506] [2023-08-29 19:29:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:32,551 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-29 19:29:32,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:32,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706620506] [2023-08-29 19:29:32,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706620506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:32,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:32,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:29:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175589819] [2023-08-29 19:29:32,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:32,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:29:32,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:32,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:29:32,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:29:32,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-29 19:29:32,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 255.25) internal successors, (1021), 4 states have internal predecessors, (1021), 0 states have call successors, (0), 0 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-29 19:29:32,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:32,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-29 19:29:32,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:32,836 INFO L130 PetriNetUnfolder]: 1473/2479 cut-off events. [2023-08-29 19:29:32,836 INFO L131 PetriNetUnfolder]: For 125/166 co-relation queries the response was YES. [2023-08-29 19:29:32,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 2479 events. 1473/2479 cut-off events. For 125/166 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12930 event pairs, 1173 based on Foata normal form. 0/1757 useless extension candidates. Maximal degree in co-relation 5010. Up to 2342 conditions per place. [2023-08-29 19:29:32,843 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 52 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-29 19:29:32,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 262 flow [2023-08-29 19:29:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2023-08-29 19:29:32,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271488469601677 [2023-08-29 19:29:32,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2023-08-29 19:29:32,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2023-08-29 19:29:32,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:32,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2023-08-29 19:29:32,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 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-29 19:29:32,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:32,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:32,850 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 156 flow. Second operand 3 states and 815 transitions. [2023-08-29 19:29:32,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 262 flow [2023-08-29 19:29:32,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:32,851 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 154 flow [2023-08-29 19:29:32,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2023-08-29 19:29:32,852 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2023-08-29 19:29:32,852 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 154 flow [2023-08-29 19:29:32,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 255.25) internal successors, (1021), 4 states have internal predecessors, (1021), 0 states have call successors, (0), 0 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-29 19:29:32,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:32,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:29:32,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 19:29:32,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:32,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash 34798183, now seen corresponding path program 1 times [2023-08-29 19:29:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:32,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588708] [2023-08-29 19:29:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:32,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:33,341 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-29 19:29:33,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:33,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588708] [2023-08-29 19:29:33,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:33,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:33,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:29:33,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120214100] [2023-08-29 19:29:33,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:33,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:29:33,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:33,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:29:33,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:29:34,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 636 [2023-08-29 19:29:34,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 253.5) internal successors, (1014), 4 states have internal predecessors, (1014), 0 states have call successors, (0), 0 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-29 19:29:34,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:34,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 636 [2023-08-29 19:29:34,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:34,562 INFO L130 PetriNetUnfolder]: 1853/3134 cut-off events. [2023-08-29 19:29:34,562 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2023-08-29 19:29:34,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6363 conditions, 3134 events. 1853/3134 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17498 event pairs, 443 based on Foata normal form. 25/2258 useless extension candidates. Maximal degree in co-relation 6358. Up to 2495 conditions per place. [2023-08-29 19:29:34,571 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 75 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2023-08-29 19:29:34,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 383 flow [2023-08-29 19:29:34,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:29:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:29:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1094 transitions. [2023-08-29 19:29:34,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4300314465408805 [2023-08-29 19:29:34,574 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1094 transitions. [2023-08-29 19:29:34,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1094 transitions. [2023-08-29 19:29:34,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:34,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1094 transitions. [2023-08-29 19:29:34,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 273.5) internal successors, (1094), 4 states have internal predecessors, (1094), 0 states have call successors, (0), 0 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-29 19:29:34,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 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-29 19:29:34,579 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 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-29 19:29:34,579 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 154 flow. Second operand 4 states and 1094 transitions. [2023-08-29 19:29:34,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 383 flow [2023-08-29 19:29:34,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:34,582 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 208 flow [2023-08-29 19:29:34,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=64, PETRI_TRANSITIONS=69} [2023-08-29 19:29:34,584 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-29 19:29:34,584 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 208 flow [2023-08-29 19:29:34,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 253.5) internal successors, (1014), 4 states have internal predecessors, (1014), 0 states have call successors, (0), 0 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-29 19:29:34,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:34,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:29:34,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 19:29:34,585 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:34,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash 34645865, now seen corresponding path program 1 times [2023-08-29 19:29:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:34,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612507848] [2023-08-29 19:29:34,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:34,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:34,662 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-29 19:29:34,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:34,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612507848] [2023-08-29 19:29:34,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612507848] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:34,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:34,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:29:34,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202635225] [2023-08-29 19:29:34,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:34,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:29:34,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:34,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:29:34,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:29:34,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 636 [2023-08-29 19:29:34,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 69 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 256.5) internal successors, (1026), 4 states have internal predecessors, (1026), 0 states have call successors, (0), 0 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-29 19:29:34,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:34,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 636 [2023-08-29 19:29:34,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:35,076 INFO L130 PetriNetUnfolder]: 1643/2806 cut-off events. [2023-08-29 19:29:35,076 INFO L131 PetriNetUnfolder]: For 423/423 co-relation queries the response was YES. [2023-08-29 19:29:35,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 2806 events. 1643/2806 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 15124 event pairs, 600 based on Foata normal form. 150/2328 useless extension candidates. Maximal degree in co-relation 5858. Up to 1639 conditions per place. [2023-08-29 19:29:35,084 INFO L137 encePairwiseOnDemand]: 627/636 looper letters, 81 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-08-29 19:29:35,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 425 flow [2023-08-29 19:29:35,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:29:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:29:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1108 transitions. [2023-08-29 19:29:35,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-29 19:29:35,087 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1108 transitions. [2023-08-29 19:29:35,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1108 transitions. [2023-08-29 19:29:35,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:35,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1108 transitions. [2023-08-29 19:29:35,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:35,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 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-29 19:29:35,092 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 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-29 19:29:35,092 INFO L175 Difference]: Start difference. First operand has 64 places, 69 transitions, 208 flow. Second operand 4 states and 1108 transitions. [2023-08-29 19:29:35,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 425 flow [2023-08-29 19:29:35,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:29:35,094 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 184 flow [2023-08-29 19:29:35,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2023-08-29 19:29:35,095 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-29 19:29:35,095 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 184 flow [2023-08-29 19:29:35,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 256.5) internal successors, (1026), 4 states have internal predecessors, (1026), 0 states have call successors, (0), 0 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-29 19:29:35,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:35,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:35,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 19:29:35,096 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:35,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843232, now seen corresponding path program 1 times [2023-08-29 19:29:35,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:35,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383273533] [2023-08-29 19:29:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:35,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:35,132 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-29 19:29:35,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383273533] [2023-08-29 19:29:35,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383273533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:35,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:35,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:29:35,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167524108] [2023-08-29 19:29:35,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:35,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:35,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:35,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:35,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:29:35,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 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-29 19:29:35,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:35,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:29:35,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:35,248 INFO L130 PetriNetUnfolder]: 533/1074 cut-off events. [2023-08-29 19:29:35,249 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-08-29 19:29:35,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 1074 events. 533/1074 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5574 event pairs, 318 based on Foata normal form. 38/941 useless extension candidates. Maximal degree in co-relation 2231. Up to 597 conditions per place. [2023-08-29 19:29:35,252 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 61 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-29 19:29:35,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 339 flow [2023-08-29 19:29:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2023-08-29 19:29:35,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44234800838574423 [2023-08-29 19:29:35,255 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 844 transitions. [2023-08-29 19:29:35,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 844 transitions. [2023-08-29 19:29:35,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:35,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 844 transitions. [2023-08-29 19:29:35,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 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-29 19:29:35,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:35,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:35,259 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 184 flow. Second operand 3 states and 844 transitions. [2023-08-29 19:29:35,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 339 flow [2023-08-29 19:29:35,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:29:35,264 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 185 flow [2023-08-29 19:29:35,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2023-08-29 19:29:35,266 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-29 19:29:35,266 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 185 flow [2023-08-29 19:29:35,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 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-29 19:29:35,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:35,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:35,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 19:29:35,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:35,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781159, now seen corresponding path program 1 times [2023-08-29 19:29:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:35,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962445857] [2023-08-29 19:29:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:35,356 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-29 19:29:35,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:35,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962445857] [2023-08-29 19:29:35,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962445857] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:35,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:35,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:29:35,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889519695] [2023-08-29 19:29:35,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:35,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:35,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:35,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:35,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:35,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 636 [2023-08-29 19:29:35,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 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-29 19:29:35,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:35,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 636 [2023-08-29 19:29:35,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:35,526 INFO L130 PetriNetUnfolder]: 506/1041 cut-off events. [2023-08-29 19:29:35,526 INFO L131 PetriNetUnfolder]: For 131/133 co-relation queries the response was YES. [2023-08-29 19:29:35,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 1041 events. 506/1041 cut-off events. For 131/133 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5453 event pairs, 423 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 2193. Up to 938 conditions per place. [2023-08-29 19:29:35,529 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 47 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-29 19:29:35,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 281 flow [2023-08-29 19:29:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2023-08-29 19:29:35,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4334381551362683 [2023-08-29 19:29:35,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2023-08-29 19:29:35,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2023-08-29 19:29:35,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:35,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2023-08-29 19:29:35,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 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-29 19:29:35,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:35,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:35,535 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 185 flow. Second operand 3 states and 827 transitions. [2023-08-29 19:29:35,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 281 flow [2023-08-29 19:29:35,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:35,538 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 181 flow [2023-08-29 19:29:35,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-08-29 19:29:35,538 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-29 19:29:35,539 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 181 flow [2023-08-29 19:29:35,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 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-29 19:29:35,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:35,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:35,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 19:29:35,548 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:35,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781158, now seen corresponding path program 1 times [2023-08-29 19:29:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:35,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944952805] [2023-08-29 19:29:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:35,660 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-29 19:29:35,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:35,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944952805] [2023-08-29 19:29:35,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944952805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:35,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:35,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:29:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324331744] [2023-08-29 19:29:35,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:35,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:29:35,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:35,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:29:35,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:29:35,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 636 [2023-08-29 19:29:35,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 263.5) internal successors, (1054), 4 states have internal predecessors, (1054), 0 states have call successors, (0), 0 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-29 19:29:35,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:35,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 636 [2023-08-29 19:29:35,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:35,907 INFO L130 PetriNetUnfolder]: 354/719 cut-off events. [2023-08-29 19:29:35,908 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-29 19:29:35,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 719 events. 354/719 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3320 event pairs, 226 based on Foata normal form. 8/652 useless extension candidates. Maximal degree in co-relation 1544. Up to 514 conditions per place. [2023-08-29 19:29:35,910 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 59 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-29 19:29:35,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 330 flow [2023-08-29 19:29:35,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:29:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:29:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1105 transitions. [2023-08-29 19:29:35,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343553459119497 [2023-08-29 19:29:35,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1105 transitions. [2023-08-29 19:29:35,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1105 transitions. [2023-08-29 19:29:35,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:35,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1105 transitions. [2023-08-29 19:29:35,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 276.25) internal successors, (1105), 4 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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-29 19:29:35,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 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-29 19:29:35,919 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 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-29 19:29:35,919 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 181 flow. Second operand 4 states and 1105 transitions. [2023-08-29 19:29:35,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 330 flow [2023-08-29 19:29:35,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 320 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:35,921 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 179 flow [2023-08-29 19:29:35,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-29 19:29:35,921 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-29 19:29:35,921 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 179 flow [2023-08-29 19:29:35,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.5) internal successors, (1054), 4 states have internal predecessors, (1054), 0 states have call successors, (0), 0 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-29 19:29:35,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:35,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:35,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 19:29:35,922 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:35,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:35,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1250363540, now seen corresponding path program 1 times [2023-08-29 19:29:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:35,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556552420] [2023-08-29 19:29:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556552420] [2023-08-29 19:29:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556552420] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:36,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:29:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197667162] [2023-08-29 19:29:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:36,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:29:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:36,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:29:36,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:29:36,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 636 [2023-08-29 19:29:36,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 253.4) internal successors, (1267), 5 states have internal predecessors, (1267), 0 states have call successors, (0), 0 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-29 19:29:36,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:36,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 636 [2023-08-29 19:29:36,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:36,491 INFO L130 PetriNetUnfolder]: 368/732 cut-off events. [2023-08-29 19:29:36,492 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-29 19:29:36,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 732 events. 368/732 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3372 event pairs, 286 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 1620. Up to 678 conditions per place. [2023-08-29 19:29:36,494 INFO L137 encePairwiseOnDemand]: 629/636 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-29 19:29:36,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 343 flow [2023-08-29 19:29:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:29:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:29:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1567 transitions. [2023-08-29 19:29:36,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106394129979036 [2023-08-29 19:29:36,497 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1567 transitions. [2023-08-29 19:29:36,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1567 transitions. [2023-08-29 19:29:36,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:36,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1567 transitions. [2023-08-29 19:29:36,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 261.1666666666667) internal successors, (1567), 6 states have internal predecessors, (1567), 0 states have call successors, (0), 0 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-29 19:29:36,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 0 states have call successors, (0), 0 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-29 19:29:36,503 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 0 states have call successors, (0), 0 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-29 19:29:36,504 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 179 flow. Second operand 6 states and 1567 transitions. [2023-08-29 19:29:36,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 343 flow [2023-08-29 19:29:36,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:36,505 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 233 flow [2023-08-29 19:29:36,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2023-08-29 19:29:36,506 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -37 predicate places. [2023-08-29 19:29:36,506 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 233 flow [2023-08-29 19:29:36,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 253.4) internal successors, (1267), 5 states have internal predecessors, (1267), 0 states have call successors, (0), 0 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-29 19:29:36,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:36,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:36,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 19:29:36,507 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:36,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1718251328, now seen corresponding path program 1 times [2023-08-29 19:29:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:36,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443453892] [2023-08-29 19:29:36,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:36,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443453892] [2023-08-29 19:29:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443453892] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:37,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:37,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 19:29:37,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073279499] [2023-08-29 19:29:37,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:37,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 19:29:37,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:37,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 19:29:37,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:29:38,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 636 [2023-08-29 19:29:38,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 248.85714285714286) internal successors, (1742), 7 states have internal predecessors, (1742), 0 states have call successors, (0), 0 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-29 19:29:38,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:38,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 636 [2023-08-29 19:29:38,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:38,452 INFO L130 PetriNetUnfolder]: 416/820 cut-off events. [2023-08-29 19:29:38,452 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2023-08-29 19:29:38,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 820 events. 416/820 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3858 event pairs, 103 based on Foata normal form. 7/772 useless extension candidates. Maximal degree in co-relation 1916. Up to 600 conditions per place. [2023-08-29 19:29:38,455 INFO L137 encePairwiseOnDemand]: 628/636 looper letters, 70 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2023-08-29 19:29:38,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 467 flow [2023-08-29 19:29:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:29:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:29:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1809 transitions. [2023-08-29 19:29:38,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4063342318059299 [2023-08-29 19:29:38,462 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1809 transitions. [2023-08-29 19:29:38,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1809 transitions. [2023-08-29 19:29:38,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:38,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1809 transitions. [2023-08-29 19:29:38,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 258.42857142857144) internal successors, (1809), 7 states have internal predecessors, (1809), 0 states have call successors, (0), 0 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-29 19:29:38,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 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-29 19:29:38,469 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 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-29 19:29:38,469 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 233 flow. Second operand 7 states and 1809 transitions. [2023-08-29 19:29:38,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 467 flow [2023-08-29 19:29:38,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 459 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 19:29:38,472 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 283 flow [2023-08-29 19:29:38,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2023-08-29 19:29:38,472 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -30 predicate places. [2023-08-29 19:29:38,472 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 283 flow [2023-08-29 19:29:38,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 248.85714285714286) internal successors, (1742), 7 states have internal predecessors, (1742), 0 states have call successors, (0), 0 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-29 19:29:38,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:38,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:38,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 19:29:38,473 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:38,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:38,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1250219982, now seen corresponding path program 2 times [2023-08-29 19:29:38,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:38,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379706149] [2023-08-29 19:29:38,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:38,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:38,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379706149] [2023-08-29 19:29:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379706149] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:38,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:29:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129153860] [2023-08-29 19:29:38,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:38,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:29:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:38,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:29:38,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:29:39,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 636 [2023-08-29 19:29:39,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 250.16666666666666) internal successors, (1501), 6 states have internal predecessors, (1501), 0 states have call successors, (0), 0 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-29 19:29:39,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:39,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 636 [2023-08-29 19:29:39,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:39,301 INFO L130 PetriNetUnfolder]: 448/892 cut-off events. [2023-08-29 19:29:39,301 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2023-08-29 19:29:39,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 892 events. 448/892 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4343 event pairs, 271 based on Foata normal form. 7/838 useless extension candidates. Maximal degree in co-relation 2173. Up to 585 conditions per place. [2023-08-29 19:29:39,305 INFO L137 encePairwiseOnDemand]: 628/636 looper letters, 72 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2023-08-29 19:29:39,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 93 transitions, 519 flow [2023-08-29 19:29:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:29:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:29:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1567 transitions. [2023-08-29 19:29:39,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106394129979036 [2023-08-29 19:29:39,308 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1567 transitions. [2023-08-29 19:29:39,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1567 transitions. [2023-08-29 19:29:39,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:39,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1567 transitions. [2023-08-29 19:29:39,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 261.1666666666667) internal successors, (1567), 6 states have internal predecessors, (1567), 0 states have call successors, (0), 0 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-29 19:29:39,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 0 states have call successors, (0), 0 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-29 19:29:39,314 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 0 states have call successors, (0), 0 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-29 19:29:39,315 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 283 flow. Second operand 6 states and 1567 transitions. [2023-08-29 19:29:39,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 93 transitions, 519 flow [2023-08-29 19:29:39,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 93 transitions, 498 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:39,317 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 321 flow [2023-08-29 19:29:39,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2023-08-29 19:29:39,318 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -25 predicate places. [2023-08-29 19:29:39,318 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 321 flow [2023-08-29 19:29:39,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 250.16666666666666) internal successors, (1501), 6 states have internal predecessors, (1501), 0 states have call successors, (0), 0 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-29 19:29:39,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:39,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:39,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 19:29:39,318 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:39,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash 223203624, now seen corresponding path program 3 times [2023-08-29 19:29:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784256197] [2023-08-29 19:29:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:39,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:39,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784256197] [2023-08-29 19:29:39,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784256197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:39,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:39,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:29:39,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609331693] [2023-08-29 19:29:39,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:39,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:29:39,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:39,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:29:39,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:29:39,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 636 [2023-08-29 19:29:39,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 248.16666666666666) internal successors, (1489), 6 states have internal predecessors, (1489), 0 states have call successors, (0), 0 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-29 19:29:39,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:39,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 636 [2023-08-29 19:29:39,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:40,037 INFO L130 PetriNetUnfolder]: 433/864 cut-off events. [2023-08-29 19:29:40,038 INFO L131 PetriNetUnfolder]: For 403/403 co-relation queries the response was YES. [2023-08-29 19:29:40,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 864 events. 433/864 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4131 event pairs, 132 based on Foata normal form. 7/813 useless extension candidates. Maximal degree in co-relation 2166. Up to 506 conditions per place. [2023-08-29 19:29:40,041 INFO L137 encePairwiseOnDemand]: 629/636 looper letters, 73 selfloop transitions, 14 changer transitions 0/94 dead transitions. [2023-08-29 19:29:40,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 94 transitions, 553 flow [2023-08-29 19:29:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:29:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:29:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1555 transitions. [2023-08-29 19:29:40,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40749475890985326 [2023-08-29 19:29:40,052 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1555 transitions. [2023-08-29 19:29:40,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1555 transitions. [2023-08-29 19:29:40,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:40,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1555 transitions. [2023-08-29 19:29:40,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 259.1666666666667) internal successors, (1555), 6 states have internal predecessors, (1555), 0 states have call successors, (0), 0 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-29 19:29:40,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 0 states have call successors, (0), 0 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-29 19:29:40,059 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 0 states have call successors, (0), 0 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-29 19:29:40,059 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 321 flow. Second operand 6 states and 1555 transitions. [2023-08-29 19:29:40,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 94 transitions, 553 flow [2023-08-29 19:29:40,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 94 transitions, 536 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:40,061 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 349 flow [2023-08-29 19:29:40,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2023-08-29 19:29:40,062 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -21 predicate places. [2023-08-29 19:29:40,062 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 349 flow [2023-08-29 19:29:40,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 248.16666666666666) internal successors, (1489), 6 states have internal predecessors, (1489), 0 states have call successors, (0), 0 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-29 19:29:40,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:40,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:40,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 19:29:40,063 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:40,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash 99588272, now seen corresponding path program 1 times [2023-08-29 19:29:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796312161] [2023-08-29 19:29:40,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796312161] [2023-08-29 19:29:40,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796312161] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:29:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121437574] [2023-08-29 19:29:40,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:40,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:40,543 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-29 19:29:40,547 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-29 19:29:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:40,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-29 19:29:40,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:29:40,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:40,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:40,794 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:29:40,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 29 [2023-08-29 19:29:40,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:40,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-29 19:29:40,814 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 10 treesize of output 8 [2023-08-29 19:29:40,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-29 19:29:40,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:40,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-29 19:29:41,012 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 19 treesize of output 18 [2023-08-29 19:29:41,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-08-29 19:29:41,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:41,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:29:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:41,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:29:41,144 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_546 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse0)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_546 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse0))))))) is different from false [2023-08-29 19:29:41,226 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_542) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_542) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2023-08-29 19:29:41,244 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_ArrVal_540 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_540))) (store (store .cse0 .cse1 v_ArrVal_542) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_ArrVal_540 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_540))) (store (store .cse6 .cse1 v_ArrVal_542) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-29 19:29:47,417 WARN L222 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:29:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:47,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121437574] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:29:47,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:29:47,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2023-08-29 19:29:47,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614807192] [2023-08-29 19:29:47,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:29:47,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-29 19:29:47,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:47,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-29 19:29:47,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=246, Unknown=8, NotChecked=108, Total=462 [2023-08-29 19:29:47,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 636 [2023-08-29 19:29:47,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 349 flow. Second operand has 22 states, 22 states have (on average 172.77272727272728) internal successors, (3801), 22 states have internal predecessors, (3801), 0 states have call successors, (0), 0 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-29 19:29:47,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:47,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 636 [2023-08-29 19:29:47,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:54,805 INFO L130 PetriNetUnfolder]: 591/1195 cut-off events. [2023-08-29 19:29:54,805 INFO L131 PetriNetUnfolder]: For 705/705 co-relation queries the response was YES. [2023-08-29 19:29:54,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3006 conditions, 1195 events. 591/1195 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6436 event pairs, 390 based on Foata normal form. 10/1109 useless extension candidates. Maximal degree in co-relation 2988. Up to 850 conditions per place. [2023-08-29 19:29:54,809 INFO L137 encePairwiseOnDemand]: 623/636 looper letters, 101 selfloop transitions, 31 changer transitions 0/138 dead transitions. [2023-08-29 19:29:54,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 138 transitions, 848 flow [2023-08-29 19:29:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 19:29:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 19:29:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2690 transitions. [2023-08-29 19:29:54,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28197064989517817 [2023-08-29 19:29:54,816 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2690 transitions. [2023-08-29 19:29:54,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2690 transitions. [2023-08-29 19:29:54,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:54,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2690 transitions. [2023-08-29 19:29:54,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 179.33333333333334) internal successors, (2690), 15 states have internal predecessors, (2690), 0 states have call successors, (0), 0 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-29 19:29:54,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 636.0) internal successors, (10176), 16 states have internal predecessors, (10176), 0 states have call successors, (0), 0 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-29 19:29:54,828 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 636.0) internal successors, (10176), 16 states have internal predecessors, (10176), 0 states have call successors, (0), 0 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-29 19:29:54,828 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 349 flow. Second operand 15 states and 2690 transitions. [2023-08-29 19:29:54,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 138 transitions, 848 flow [2023-08-29 19:29:54,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 138 transitions, 818 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-29 19:29:54,832 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 561 flow [2023-08-29 19:29:54,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=561, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2023-08-29 19:29:54,832 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -3 predicate places. [2023-08-29 19:29:54,833 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 561 flow [2023-08-29 19:29:54,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 172.77272727272728) internal successors, (3801), 22 states have internal predecessors, (3801), 0 states have call successors, (0), 0 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-29 19:29:54,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:54,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:54,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 19:29:55,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-29 19:29:55,038 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:29:55,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1733159420, now seen corresponding path program 1 times [2023-08-29 19:29:55,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:55,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488868882] [2023-08-29 19:29:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:55,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:55,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488868882] [2023-08-29 19:29:55,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488868882] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:29:55,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6086308] [2023-08-29 19:29:55,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:55,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:55,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:55,721 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-29 19:29:55,723 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-29 19:29:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:55,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 77 conjunts are in the unsatisfiable core [2023-08-29 19:29:55,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:29:55,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:55,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:55,867 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:29:55,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-29 19:29:55,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:55,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-29 19:29:55,882 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 10 treesize of output 8 [2023-08-29 19:29:55,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:55,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-08-29 19:29:56,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 29 [2023-08-29 19:29:56,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 27 [2023-08-29 19:29:56,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 34 [2023-08-29 19:29:56,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:56,429 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 52 treesize of output 54 [2023-08-29 19:29:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:56,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:29:56,552 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_645 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_645 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:29:56,635 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_642) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_642) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-29 19:29:56,663 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_640))) (store (store .cse0 .cse1 v_ArrVal_642) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_640))) (store (store .cse6 .cse1 v_ArrVal_642) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:29:58,684 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_640))) (store (store .cse1 .cse2 v_ArrVal_642) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_640))) (store (store .cse5 .cse2 v_ArrVal_642) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))))))) is different from false [2023-08-29 19:29:58,721 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_638 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_638))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_640))) (store (store .cse1 .cse2 v_ArrVal_642) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|))))) (forall ((v_ArrVal_638 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_638))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_640))) (store (store .cse6 .cse2 v_ArrVal_642) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|))))))) is different from false [2023-08-29 19:29:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-29 19:29:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6086308] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:29:58,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:29:58,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2023-08-29 19:29:58,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883479489] [2023-08-29 19:29:58,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:29:58,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-29 19:29:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:58,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-29 19:29:58,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=348, Unknown=17, NotChecked=220, Total=702 [2023-08-29 19:29:59,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:29:59,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 561 flow. Second operand has 27 states, 27 states have (on average 167.55555555555554) internal successors, (4524), 27 states have internal predecessors, (4524), 0 states have call successors, (0), 0 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-29 19:29:59,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:59,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:29:59,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:00,619 INFO L130 PetriNetUnfolder]: 723/1463 cut-off events. [2023-08-29 19:30:00,619 INFO L131 PetriNetUnfolder]: For 1468/1468 co-relation queries the response was YES. [2023-08-29 19:30:00,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3939 conditions, 1463 events. 723/1463 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8328 event pairs, 214 based on Foata normal form. 7/1381 useless extension candidates. Maximal degree in co-relation 3913. Up to 562 conditions per place. [2023-08-29 19:30:00,625 INFO L137 encePairwiseOnDemand]: 618/636 looper letters, 126 selfloop transitions, 44 changer transitions 0/176 dead transitions. [2023-08-29 19:30:00,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 176 transitions, 1169 flow [2023-08-29 19:30:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 19:30:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 19:30:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2630 transitions. [2023-08-29 19:30:00,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27568134171907754 [2023-08-29 19:30:00,631 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2630 transitions. [2023-08-29 19:30:00,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2630 transitions. [2023-08-29 19:30:00,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:00,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2630 transitions. [2023-08-29 19:30:00,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 175.33333333333334) internal successors, (2630), 15 states have internal predecessors, (2630), 0 states have call successors, (0), 0 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-29 19:30:00,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 636.0) internal successors, (10176), 16 states have internal predecessors, (10176), 0 states have call successors, (0), 0 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-29 19:30:00,641 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 636.0) internal successors, (10176), 16 states have internal predecessors, (10176), 0 states have call successors, (0), 0 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-29 19:30:00,641 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 561 flow. Second operand 15 states and 2630 transitions. [2023-08-29 19:30:00,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 176 transitions, 1169 flow [2023-08-29 19:30:00,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 176 transitions, 1081 flow, removed 33 selfloop flow, removed 4 redundant places. [2023-08-29 19:30:00,648 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 765 flow [2023-08-29 19:30:00,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=765, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2023-08-29 19:30:00,649 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 13 predicate places. [2023-08-29 19:30:00,649 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 765 flow [2023-08-29 19:30:00,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 167.55555555555554) internal successors, (4524), 27 states have internal predecessors, (4524), 0 states have call successors, (0), 0 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-29 19:30:00,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:00,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:00,655 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-29 19:30:00,855 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,SelfDestructingSolverStorable17 [2023-08-29 19:30:00,855 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:00,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1207730986, now seen corresponding path program 2 times [2023-08-29 19:30:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:00,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675414931] [2023-08-29 19:30:00,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:00,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:30:01,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:01,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675414931] [2023-08-29 19:30:01,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675414931] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:30:01,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688310092] [2023-08-29 19:30:01,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:30:01,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:30:01,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:30:01,456 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-29 19:30:01,458 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-29 19:30:01,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:30:01,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:30:01,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 71 conjunts are in the unsatisfiable core [2023-08-29 19:30:01,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:30:01,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:01,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:01,628 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:30:01,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-29 19:30:01,643 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:30:01,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-08-29 19:30:01,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 29 [2023-08-29 19:30:01,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 27 [2023-08-29 19:30:02,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 34 [2023-08-29 19:30:02,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:02,081 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 52 treesize of output 54 [2023-08-29 19:30:02,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:02,131 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 52 treesize of output 54 [2023-08-29 19:30:02,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:30:02,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:30:02,200 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_742 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_742 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-29 19:30:04,359 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-29 19:30:04,368 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:30:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:30:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688310092] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:30:12,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:30:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2023-08-29 19:30:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11360834] [2023-08-29 19:30:12,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:30:12,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-29 19:30:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:12,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-29 19:30:12,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=411, Unknown=13, NotChecked=138, Total=702 [2023-08-29 19:30:13,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:30:13,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 765 flow. Second operand has 27 states, 27 states have (on average 167.55555555555554) internal successors, (4524), 27 states have internal predecessors, (4524), 0 states have call successors, (0), 0 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-29 19:30:13,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:13,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:30:13,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:17,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:30:19,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:30:25,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:30:27,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:30:29,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:30:31,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:30:35,963 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-29 19:30:36,177 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse5 .cse6))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ .cse2 1)))) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))) (.cse1 (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ (* (select (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (and .cse0 .cse1 (or (and .cse0 .cse1) (= .cse2 20))))))) is different from false [2023-08-29 19:30:39,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:30:41,603 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-29 19:30:43,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:44,322 INFO L130 PetriNetUnfolder]: 1097/2184 cut-off events. [2023-08-29 19:30:44,322 INFO L131 PetriNetUnfolder]: For 6499/6663 co-relation queries the response was YES. [2023-08-29 19:30:44,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8363 conditions, 2184 events. 1097/2184 cut-off events. For 6499/6663 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 13017 event pairs, 326 based on Foata normal form. 32/2091 useless extension candidates. Maximal degree in co-relation 8331. Up to 709 conditions per place. [2023-08-29 19:30:44,332 INFO L137 encePairwiseOnDemand]: 614/636 looper letters, 175 selfloop transitions, 87 changer transitions 0/268 dead transitions. [2023-08-29 19:30:44,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 268 transitions, 2228 flow [2023-08-29 19:30:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-29 19:30:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-29 19:30:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3693 transitions. [2023-08-29 19:30:44,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27650494159928124 [2023-08-29 19:30:44,339 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3693 transitions. [2023-08-29 19:30:44,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3693 transitions. [2023-08-29 19:30:44,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:44,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3693 transitions. [2023-08-29 19:30:44,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 175.85714285714286) internal successors, (3693), 21 states have internal predecessors, (3693), 0 states have call successors, (0), 0 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-29 19:30:44,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 636.0) internal successors, (13992), 22 states have internal predecessors, (13992), 0 states have call successors, (0), 0 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-29 19:30:44,352 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 636.0) internal successors, (13992), 22 states have internal predecessors, (13992), 0 states have call successors, (0), 0 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-29 19:30:44,352 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 765 flow. Second operand 21 states and 3693 transitions. [2023-08-29 19:30:44,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 268 transitions, 2228 flow [2023-08-29 19:30:44,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 268 transitions, 2191 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-29 19:30:44,363 INFO L231 Difference]: Finished difference. Result has 144 places, 173 transitions, 1452 flow [2023-08-29 19:30:44,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1452, PETRI_PLACES=144, PETRI_TRANSITIONS=173} [2023-08-29 19:30:44,364 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 38 predicate places. [2023-08-29 19:30:44,364 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 173 transitions, 1452 flow [2023-08-29 19:30:44,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 167.55555555555554) internal successors, (4524), 27 states have internal predecessors, (4524), 0 states have call successors, (0), 0 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-29 19:30:44,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:44,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:44,370 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-29 19:30:44,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:30:44,570 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:44,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash -688789608, now seen corresponding path program 1 times [2023-08-29 19:30:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:44,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050109094] [2023-08-29 19:30:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:44,622 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-29 19:30:44,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:44,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050109094] [2023-08-29 19:30:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050109094] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:44,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:30:44,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878720616] [2023-08-29 19:30:44,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:44,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:30:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:30:44,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:30:44,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:30:44,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 173 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-29 19:30:44,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:44,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:30:44,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:44,958 INFO L130 PetriNetUnfolder]: 1086/2181 cut-off events. [2023-08-29 19:30:44,958 INFO L131 PetriNetUnfolder]: For 17393/17824 co-relation queries the response was YES. [2023-08-29 19:30:44,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11576 conditions, 2181 events. 1086/2181 cut-off events. For 17393/17824 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 13073 event pairs, 480 based on Foata normal form. 13/2089 useless extension candidates. Maximal degree in co-relation 11534. Up to 1023 conditions per place. [2023-08-29 19:30:44,972 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 159 selfloop transitions, 5 changer transitions 0/182 dead transitions. [2023-08-29 19:30:44,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 182 transitions, 1866 flow [2023-08-29 19:30:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:30:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:30:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2023-08-29 19:30:44,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418238993710692 [2023-08-29 19:30:44,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2023-08-29 19:30:44,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2023-08-29 19:30:44,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:44,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2023-08-29 19:30:44,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 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-29 19:30:44,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:30:44,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:30:44,977 INFO L175 Difference]: Start difference. First operand has 144 places, 173 transitions, 1452 flow. Second operand 3 states and 843 transitions. [2023-08-29 19:30:44,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 182 transitions, 1866 flow [2023-08-29 19:30:44,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 182 transitions, 1641 flow, removed 91 selfloop flow, removed 9 redundant places. [2023-08-29 19:30:44,996 INFO L231 Difference]: Finished difference. Result has 134 places, 169 transitions, 1217 flow [2023-08-29 19:30:44,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1217, PETRI_PLACES=134, PETRI_TRANSITIONS=169} [2023-08-29 19:30:44,997 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 28 predicate places. [2023-08-29 19:30:44,997 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 169 transitions, 1217 flow [2023-08-29 19:30:44,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-29 19:30:44,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:44,997 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:44,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 19:30:44,997 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:44,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:44,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2042297759, now seen corresponding path program 1 times [2023-08-29 19:30:44,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:44,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977346679] [2023-08-29 19:30:44,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:44,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:30:45,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977346679] [2023-08-29 19:30:45,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977346679] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:30:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482730643] [2023-08-29 19:30:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:30:45,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:30:45,169 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-29 19:30:45,170 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-29 19:30:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:45,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-29 19:30:45,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:30:45,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:45,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:45,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:45,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:30:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:30:45,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:30:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:30:45,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482730643] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:30:45,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:30:45,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:30:45,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258965920] [2023-08-29 19:30:45,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:30:45,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:30:45,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:45,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:30:45,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:30:46,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-29 19:30:46,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 169 transitions, 1217 flow. Second operand has 11 states, 11 states have (on average 261.6363636363636) internal successors, (2878), 11 states have internal predecessors, (2878), 0 states have call successors, (0), 0 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-29 19:30:46,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:46,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-29 19:30:46,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:47,290 INFO L130 PetriNetUnfolder]: 927/1826 cut-off events. [2023-08-29 19:30:47,291 INFO L131 PetriNetUnfolder]: For 18061/18462 co-relation queries the response was YES. [2023-08-29 19:30:47,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10860 conditions, 1826 events. 927/1826 cut-off events. For 18061/18462 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8915 event pairs, 300 based on Foata normal form. 118/1890 useless extension candidates. Maximal degree in co-relation 10819. Up to 720 conditions per place. [2023-08-29 19:30:47,302 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 207 selfloop transitions, 12 changer transitions 0/238 dead transitions. [2023-08-29 19:30:47,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 238 transitions, 2313 flow [2023-08-29 19:30:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:30:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:30:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1906 transitions. [2023-08-29 19:30:47,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281221922731357 [2023-08-29 19:30:47,304 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1906 transitions. [2023-08-29 19:30:47,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1906 transitions. [2023-08-29 19:30:47,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:47,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1906 transitions. [2023-08-29 19:30:47,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 272.2857142857143) internal successors, (1906), 7 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-29 19:30:47,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 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-29 19:30:47,309 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 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-29 19:30:47,309 INFO L175 Difference]: Start difference. First operand has 134 places, 169 transitions, 1217 flow. Second operand 7 states and 1906 transitions. [2023-08-29 19:30:47,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 238 transitions, 2313 flow [2023-08-29 19:30:47,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 238 transitions, 2275 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-29 19:30:47,329 INFO L231 Difference]: Finished difference. Result has 137 places, 162 transitions, 1187 flow [2023-08-29 19:30:47,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1187, PETRI_PLACES=137, PETRI_TRANSITIONS=162} [2023-08-29 19:30:47,329 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 31 predicate places. [2023-08-29 19:30:47,330 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 162 transitions, 1187 flow [2023-08-29 19:30:47,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 261.6363636363636) internal successors, (2878), 11 states have internal predecessors, (2878), 0 states have call successors, (0), 0 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-29 19:30:47,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:47,330 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:47,337 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-29 19:30:47,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:30:47,530 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:47,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1495673483, now seen corresponding path program 3 times [2023-08-29 19:30:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:47,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190675733] [2023-08-29 19:30:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:30:49,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:49,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190675733] [2023-08-29 19:30:49,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190675733] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:30:49,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114313826] [2023-08-29 19:30:49,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 19:30:49,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:30:49,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:30:49,833 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-29 19:30:49,840 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-29 19:30:50,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-29 19:30:50,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:30:50,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 106 conjunts are in the unsatisfiable core [2023-08-29 19:30:50,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:30:50,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:50,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:50,063 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:30:50,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-29 19:30:50,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:50,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:50,102 INFO L321 Elim1Store]: treesize reduction 20, result has 20.0 percent of original size [2023-08-29 19:30:50,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:30:50,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 10 treesize of output 8 [2023-08-29 19:30:50,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:50,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-08-29 19:30:50,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 29 [2023-08-29 19:30:50,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 27 [2023-08-29 19:30:50,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 34 [2023-08-29 19:30:50,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:50,931 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 52 treesize of output 54 [2023-08-29 19:30:51,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 76 treesize of output 67 [2023-08-29 19:30:51,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 81 treesize of output 76 [2023-08-29 19:30:51,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 87 treesize of output 80 [2023-08-29 19:30:51,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:51,683 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 147 treesize of output 149 [2023-08-29 19:30:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:30:51,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:31:18,124 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:31:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:26,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114313826] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:31:26,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:31:26,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 16] total 41 [2023-08-29 19:31:26,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774921898] [2023-08-29 19:31:26,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:31:26,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-08-29 19:31:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:31:26,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-08-29 19:31:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1417, Unknown=35, NotChecked=0, Total=1806 [2023-08-29 19:31:30,406 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-29 19:31:31,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:31:31,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 162 transitions, 1187 flow. Second operand has 43 states, 43 states have (on average 167.53488372093022) internal successors, (7204), 43 states have internal predecessors, (7204), 0 states have call successors, (0), 0 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-29 19:31:31,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:31:31,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:31:31,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:31:35,175 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 [0, 1] [2023-08-29 19:31:37,633 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-29 19:31:39,666 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-29 19:31:41,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:43,674 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-29 19:31:45,681 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-29 19:31:47,683 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-29 19:31:49,685 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-29 19:31:51,689 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-29 19:31:53,697 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-29 19:31:55,756 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-29 19:31:57,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:59,828 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-29 19:32:01,860 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-29 19:32:03,868 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-29 19:32:06,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:32:24,927 WARN L222 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 104 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:32:26,946 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-29 19:32:29,160 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-29 19:32:31,168 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-29 19:32:33,169 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-29 19:32:35,171 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-29 19:32:37,175 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-29 19:32:39,179 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-29 19:32:41,240 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-29 19:32:43,252 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-29 19:32:45,257 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-29 19:32:47,260 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-29 19:32:49,296 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-29 19:32:51,311 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-29 19:32:53,314 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-29 19:32:55,563 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-29 19:32:57,580 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-29 19:32:59,589 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-29 19:33:01,591 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-29 19:33:03,603 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-29 19:33:06,079 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-29 19:33:08,097 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-29 19:33:10,107 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-29 19:33:12,109 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-29 19:33:14,127 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-29 19:33:16,376 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-29 19:33:18,395 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-29 19:33:20,404 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-29 19:33:22,407 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-29 19:33:24,726 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-29 19:33:26,728 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-29 19:33:28,730 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-29 19:33:30,734 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-29 19:33:32,738 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-29 19:33:35,320 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-29 19:33:37,337 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-29 19:33:39,346 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-29 19:33:41,348 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-29 19:33:43,362 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-29 19:34:07,118 WARN L222 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 107 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:34:08,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:10,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:12,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:27,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:35:15,287 WARN L222 SmtUtils]: Spent 47.48s on a formula simplification. DAG size of input: 188 DAG size of output: 133 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:35:26,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:35:29,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:35:31,792 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 [0, 1] [2023-08-29 19:35:33,803 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 [0, 1] [2023-08-29 19:35:35,821 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 [0, 1] [2023-08-29 19:35:37,839 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 [0, 1] [2023-08-29 19:35:39,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:35:41,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:35:43,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:35:50,938 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-29 19:37:28,790 WARN L222 SmtUtils]: Spent 1.52m on a formula simplification. DAG size of input: 247 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:37:30,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:37:33,592 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-29 19:37:35,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:37:37,509 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-29 19:37:39,549 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-29 19:37:41,580 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-29 19:37:43,832 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-29 19:37:46,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:37:58,704 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-29 19:38:07,832 WARN L222 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 80 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:38:29,332 WARN L222 SmtUtils]: Spent 11.35s on a formula simplification. DAG size of input: 129 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:38:32,045 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-29 19:38:34,104 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-29 19:38:36,148 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-29 19:38:38,170 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-29 19:38:40,741 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-29 19:38:43,002 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-29 19:38:45,131 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-29 19:38:46,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:38:49,519 INFO L130 PetriNetUnfolder]: 1459/2808 cut-off events. [2023-08-29 19:38:49,519 INFO L131 PetriNetUnfolder]: For 31543/31930 co-relation queries the response was YES. [2023-08-29 19:38:49,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17175 conditions, 2808 events. 1459/2808 cut-off events. For 31543/31930 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 15255 event pairs, 198 based on Foata normal form. 69/2786 useless extension candidates. Maximal degree in co-relation 17132. Up to 1258 conditions per place. [2023-08-29 19:38:49,533 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 299 selfloop transitions, 113 changer transitions 0/417 dead transitions. [2023-08-29 19:38:49,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 417 transitions, 5113 flow [2023-08-29 19:38:49,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-29 19:38:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-29 19:38:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 6947 transitions. [2023-08-29 19:38:49,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2730738993710692 [2023-08-29 19:38:49,540 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 6947 transitions. [2023-08-29 19:38:49,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 6947 transitions. [2023-08-29 19:38:49,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:49,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 6947 transitions. [2023-08-29 19:38:49,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 173.675) internal successors, (6947), 40 states have internal predecessors, (6947), 0 states have call successors, (0), 0 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-29 19:38:49,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 636.0) internal successors, (26076), 41 states have internal predecessors, (26076), 0 states have call successors, (0), 0 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-29 19:38:49,562 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 636.0) internal successors, (26076), 41 states have internal predecessors, (26076), 0 states have call successors, (0), 0 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-29 19:38:49,562 INFO L175 Difference]: Start difference. First operand has 137 places, 162 transitions, 1187 flow. Second operand 40 states and 6947 transitions. [2023-08-29 19:38:49,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 417 transitions, 5113 flow [2023-08-29 19:38:49,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 417 transitions, 5048 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-08-29 19:38:49,588 INFO L231 Difference]: Finished difference. Result has 187 places, 220 transitions, 2035 flow [2023-08-29 19:38:49,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=2035, PETRI_PLACES=187, PETRI_TRANSITIONS=220} [2023-08-29 19:38:49,589 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 81 predicate places. [2023-08-29 19:38:49,589 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 220 transitions, 2035 flow [2023-08-29 19:38:49,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 167.53488372093022) internal successors, (7204), 43 states have internal predecessors, (7204), 0 states have call successors, (0), 0 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-29 19:38:49,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:49,590 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:49,597 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-29 19:38:49,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-29 19:38:49,798 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:38:49,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash -686359299, now seen corresponding path program 1 times [2023-08-29 19:38:49,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:38:49,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671230207] [2023-08-29 19:38:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:49,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:38:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 19:38:50,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:38:50,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671230207] [2023-08-29 19:38:50,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671230207] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:38:50,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165213611] [2023-08-29 19:38:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:50,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:38:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:38:50,193 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-29 19:38:50,195 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-29 19:38:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:50,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 19:38:50,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:50,595 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 13 treesize of output 9 [2023-08-29 19:38:50,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:50,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 19:38:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 19:38:50,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:38:50,711 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1080 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:38:50,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:38:50,719 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 26 treesize of output 27 [2023-08-29 19:38:50,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:38:50,730 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 44 treesize of output 43 [2023-08-29 19:38:50,748 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 11 treesize of output 7 [2023-08-29 19:38:50,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:38:50,758 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 29 treesize of output 30 [2023-08-29 19:38:50,761 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 19:38:50,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:50,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-29 19:38:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-29 19:38:50,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165213611] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:38:50,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:38:50,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2023-08-29 19:38:50,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661094985] [2023-08-29 19:38:50,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:38:50,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-29 19:38:50,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:38:50,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-29 19:38:50,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=139, Unknown=1, NotChecked=24, Total=210 [2023-08-29 19:38:51,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 636 [2023-08-29 19:38:51,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 220 transitions, 2035 flow. Second operand has 15 states, 15 states have (on average 178.2) internal successors, (2673), 15 states have internal predecessors, (2673), 0 states have call successors, (0), 0 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-29 19:38:51,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:51,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 636 [2023-08-29 19:38:51,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:51,969 INFO L130 PetriNetUnfolder]: 1651/3261 cut-off events. [2023-08-29 19:38:51,969 INFO L131 PetriNetUnfolder]: For 55461/55491 co-relation queries the response was YES. [2023-08-29 19:38:51,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22974 conditions, 3261 events. 1651/3261 cut-off events. For 55461/55491 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 18774 event pairs, 687 based on Foata normal form. 29/3179 useless extension candidates. Maximal degree in co-relation 22918. Up to 2509 conditions per place. [2023-08-29 19:38:51,992 INFO L137 encePairwiseOnDemand]: 628/636 looper letters, 237 selfloop transitions, 18 changer transitions 0/260 dead transitions. [2023-08-29 19:38:51,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 260 transitions, 2933 flow [2023-08-29 19:38:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:38:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:38:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1309 transitions. [2023-08-29 19:38:51,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2940251572327044 [2023-08-29 19:38:51,994 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1309 transitions. [2023-08-29 19:38:51,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1309 transitions. [2023-08-29 19:38:51,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:51,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1309 transitions. [2023-08-29 19:38:51,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 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-29 19:38:51,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 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-29 19:38:51,998 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 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-29 19:38:51,998 INFO L175 Difference]: Start difference. First operand has 187 places, 220 transitions, 2035 flow. Second operand 7 states and 1309 transitions. [2023-08-29 19:38:51,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 260 transitions, 2933 flow [2023-08-29 19:38:52,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 260 transitions, 2561 flow, removed 165 selfloop flow, removed 8 redundant places. [2023-08-29 19:38:52,042 INFO L231 Difference]: Finished difference. Result has 186 places, 223 transitions, 1741 flow [2023-08-29 19:38:52,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1741, PETRI_PLACES=186, PETRI_TRANSITIONS=223} [2023-08-29 19:38:52,042 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 80 predicate places. [2023-08-29 19:38:52,043 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 223 transitions, 1741 flow [2023-08-29 19:38:52,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 178.2) internal successors, (2673), 15 states have internal predecessors, (2673), 0 states have call successors, (0), 0 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-29 19:38:52,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:52,043 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:52,048 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-29 19:38:52,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:38:52,245 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:38:52,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 190722407, now seen corresponding path program 4 times [2023-08-29 19:38:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:38:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299030896] [2023-08-29 19:38:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:38:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:38:53,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299030896] [2023-08-29 19:38:53,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299030896] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:38:53,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014125969] [2023-08-29 19:38:53,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 19:38:53,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:38:53,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:38:53,366 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-29 19:38:53,367 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-29 19:38:53,488 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 19:38:53,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:38:53,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 97 conjunts are in the unsatisfiable core [2023-08-29 19:38:53,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:53,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:53,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:53,530 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:38:53,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-29 19:38:53,545 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:38:53,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-08-29 19:38:53,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 26 [2023-08-29 19:38:53,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 25 [2023-08-29 19:38:53,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:53,937 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 28 treesize of output 30 [2023-08-29 19:38:54,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 32 [2023-08-29 19:38:54,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:54,148 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 31 treesize of output 33 [2023-08-29 19:38:54,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 49 treesize of output 40 [2023-08-29 19:38:54,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 34 [2023-08-29 19:38:54,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 38 [2023-08-29 19:38:54,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:54,562 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 37 treesize of output 39 [2023-08-29 19:38:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:54,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:38:54,928 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1200 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1200 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-08-29 19:38:54,952 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1196) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4))))) (forall ((v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1196) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4)) 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-29 19:38:59,834 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1193 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1193))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 0) (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_1194))) (store (store .cse2 .cse3 v_ArrVal_1196) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((v_ArrVal_1193 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1193))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (let ((.cse9 (+ |c_~#queue~0.offset| (* (select .cse8 .cse4) 4)))) (or (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 .cse9 v_ArrVal_1194))) (store (store .cse7 .cse3 v_ArrVal_1196) .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4) 4)))) (< .cse9 0)))))))) is different from false [2023-08-29 19:38:59,872 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1193 (Array Int Int))) (let ((.cse1 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1193))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ (* 4 (select .cse5 .cse4)) |c_~#queue~0.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_1194))) (store (store .cse2 .cse3 v_ArrVal_1196) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((v_ArrVal_1193 (Array Int Int))) (let ((.cse8 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1193))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (+ (* 4 (select .cse10 .cse4)) |c_~#queue~0.offset|))) (or (< .cse7 0) (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1194))) (store (store .cse9 .cse3 v_ArrVal_1196) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))))) is different from false [2023-08-29 19:38:59,903 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_1193 (Array Int Int))) (let ((.cse1 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1193))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 0) (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_1194))) (store (store .cse2 .cse3 v_ArrVal_1196) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))) (forall ((v_ArrVal_1193 (Array Int Int))) (let ((.cse8 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1193))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (+ |c_~#queue~0.offset| (* (select .cse10 .cse4) 4)))) (or (< .cse7 0) (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1194))) (store (store .cse9 .cse3 v_ArrVal_1196) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false [2023-08-29 19:38:59,938 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse1 (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1190))) (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1193))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_1194))) (store (store .cse2 .cse3 v_ArrVal_1196) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse9 (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1190))) (store .cse13 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse14 (select .cse13 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse14 .cse8 (+ (select .cse14 .cse8) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1193))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse12 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 v_ArrVal_1194))) (store (store .cse10 .cse3 v_ArrVal_1196) .cse4 (+ (select .cse10 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4) 4)))) (< .cse12 0)))))))) is different from false [2023-08-29 19:39:02,824 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1186 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_1186))) (or (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse1 (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_1188)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1190))) (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1193))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 0) (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_1194))) (store (store .cse2 .cse3 v_ArrVal_1196) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))) (= (select .cse9 .cse8) 20)))) (forall ((v_ArrVal_1186 Int)) (let ((.cse13 (store .cse11 .cse12 v_ArrVal_1186))) (or (= (select .cse13 .cse8) 20) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse15 (store (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse10 v_ArrVal_1188)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1190))) (store .cse18 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse19 (select .cse18 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse19 .cse8 (+ (select .cse19 .cse8) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1193))) (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (let ((.cse14 (+ |c_~#queue~0.offset| (* (select .cse17 .cse4) 4)))) (or (< .cse14 0) (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= (+ (* (select (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse17 .cse14 v_ArrVal_1194))) (store (store .cse16 .cse3 v_ArrVal_1196) .cse4 (+ (select .cse16 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))))))) is different from false [2023-08-29 19:39:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-08-29 19:39:09,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014125969] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:39:09,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:39:09,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 39 [2023-08-29 19:39:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301491556] [2023-08-29 19:39:09,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:39:09,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-29 19:39:09,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:39:09,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-29 19:39:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=931, Unknown=23, NotChecked=490, Total=1640 [2023-08-29 19:39:11,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:39:11,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 223 transitions, 1741 flow. Second operand has 41 states, 41 states have (on average 167.609756097561) internal successors, (6872), 41 states have internal predecessors, (6872), 0 states have call successors, (0), 0 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-29 19:39:11,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:39:11,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:39:11,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:39:27,184 WARN L222 SmtUtils]: Spent 13.38s on a formula simplification. DAG size of input: 197 DAG size of output: 164 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:39:34,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:39:53,515 WARN L222 SmtUtils]: Spent 11.53s on a formula simplification. DAG size of input: 171 DAG size of output: 158 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:39:56,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:40:10,485 WARN L222 SmtUtils]: Spent 10.90s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:40:15,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:40:21,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:40:24,438 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-29 19:40:32,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:40:36,967 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-29 19:41:01,023 WARN L222 SmtUtils]: Spent 19.10s on a formula simplification. DAG size of input: 134 DAG size of output: 126 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:41:04,400 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-29 19:41:06,413 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-29 19:41:28,130 WARN L222 SmtUtils]: Spent 20.98s on a formula simplification. DAG size of input: 53 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:41:35,118 WARN L222 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 29 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:41:35,889 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse13 (* (select .cse10 .cse5) 4))) (let ((.cse11 (+ .cse13 |c_~#queue~0.offset|)) (.cse7 (select |c_#length| |c_~#queue~0.base|))) (and (let ((.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (and (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1194))) (store (store .cse0 .cse1 v_ArrVal_1196) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1194))) (store (store .cse6 .cse1 v_ArrVal_1196) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse5) 4) 4) .cse7)))) (< .cse4 0))) (or (let ((.cse9 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store .cse10 .cse11 v_ArrVal_1194))) (store (store .cse8 .cse9 v_ArrVal_1196) .cse5 (+ (select .cse8 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse7)) (forall ((v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1200 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse10 .cse11 v_ArrVal_1194))) (store (store .cse12 .cse9 v_ArrVal_1196) .cse5 (+ (select .cse12 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) (< .cse11 0)) (forall ((v_ArrVal_1200 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (<= 0 .cse11) (forall ((v_ArrVal_1200 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1200) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse7)) (<= (+ .cse13 |c_~#queue~0.offset| 4) .cse7))))) is different from false [2023-08-29 19:41:38,960 INFO L130 PetriNetUnfolder]: 2232/4436 cut-off events. [2023-08-29 19:41:38,960 INFO L131 PetriNetUnfolder]: For 72971/73013 co-relation queries the response was YES. [2023-08-29 19:41:38,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30451 conditions, 4436 events. 2232/4436 cut-off events. For 72971/73013 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 27485 event pairs, 717 based on Foata normal form. 47/4375 useless extension candidates. Maximal degree in co-relation 30396. Up to 2071 conditions per place. [2023-08-29 19:41:38,987 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 291 selfloop transitions, 160 changer transitions 0/456 dead transitions. [2023-08-29 19:41:38,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 456 transitions, 5989 flow [2023-08-29 19:41:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-29 19:41:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-29 19:41:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6083 transitions. [2023-08-29 19:41:38,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2732704402515723 [2023-08-29 19:41:38,993 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 6083 transitions. [2023-08-29 19:41:38,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 6083 transitions. [2023-08-29 19:41:38,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:41:38,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 6083 transitions. [2023-08-29 19:41:38,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 173.8) internal successors, (6083), 35 states have internal predecessors, (6083), 0 states have call successors, (0), 0 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-29 19:41:39,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 636.0) internal successors, (22896), 36 states have internal predecessors, (22896), 0 states have call successors, (0), 0 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-29 19:41:39,009 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 636.0) internal successors, (22896), 36 states have internal predecessors, (22896), 0 states have call successors, (0), 0 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-29 19:41:39,009 INFO L175 Difference]: Start difference. First operand has 186 places, 223 transitions, 1741 flow. Second operand 35 states and 6083 transitions. [2023-08-29 19:41:39,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 456 transitions, 5989 flow [2023-08-29 19:41:39,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 456 transitions, 5932 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-29 19:41:39,053 INFO L231 Difference]: Finished difference. Result has 234 places, 306 transitions, 3344 flow [2023-08-29 19:41:39,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=3344, PETRI_PLACES=234, PETRI_TRANSITIONS=306} [2023-08-29 19:41:39,053 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 128 predicate places. [2023-08-29 19:41:39,053 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 306 transitions, 3344 flow [2023-08-29 19:41:39,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 167.609756097561) internal successors, (6872), 41 states have internal predecessors, (6872), 0 states have call successors, (0), 0 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-29 19:41:39,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:41:39,055 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 19:41:39,060 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-29 19:41:39,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:41:39,260 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:41:39,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:41:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash -267529355, now seen corresponding path program 5 times [2023-08-29 19:41:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:41:39,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227179334] [2023-08-29 19:41:39,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:41:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:41:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:41:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:41:40,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:41:40,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227179334] [2023-08-29 19:41:40,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227179334] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:41:40,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454667660] [2023-08-29 19:41:40,799 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 19:41:40,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:41:40,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:41:40,800 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-29 19:41:40,801 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-29 19:41:40,944 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-29 19:41:40,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:41:40,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 101 conjunts are in the unsatisfiable core [2023-08-29 19:41:40,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:41:40,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:41:41,039 INFO L321 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2023-08-29 19:41:41,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2023-08-29 19:41:41,113 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-08-29 19:41:41,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 26 [2023-08-29 19:41:41,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 41 [2023-08-29 19:41:41,687 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 19:41:41,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 24 [2023-08-29 19:41:42,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 27 [2023-08-29 19:41:42,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 34 [2023-08-29 19:41:42,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:41:42,724 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 52 treesize of output 54 [2023-08-29 19:41:42,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 76 treesize of output 67 [2023-08-29 19:41:43,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 81 treesize of output 76 [2023-08-29 19:41:43,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:41:43,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 81 [2023-08-29 19:41:43,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-29 19:41:43,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 87 treesize of output 80 [2023-08-29 19:41:44,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:41:44,172 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 147 treesize of output 149 [2023-08-29 19:41:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:41:44,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:42:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:42:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454667660] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:42:06,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:42:06,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 16] total 40 [2023-08-29 19:42:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229081946] [2023-08-29 19:42:06,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:42:06,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-08-29 19:42:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:42:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-08-29 19:42:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1382, Unknown=30, NotChecked=0, Total=1722 [2023-08-29 19:42:08,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:42:08,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 306 transitions, 3344 flow. Second operand has 42 states, 42 states have (on average 167.57142857142858) internal successors, (7038), 42 states have internal predecessors, (7038), 0 states have call successors, (0), 0 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-29 19:42:08,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:42:08,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:42:08,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:42:16,154 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse77 (select .cse21 .cse22))) (let ((.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse13 (select |c_#length| |c_~#queue~0.base|)) (.cse37 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse23 (+ .cse77 1)) (.cse28 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse33 (select .cse28 .cse7)) (.cse0 (and (forall ((v_ArrVal_1308 Int) (v_ArrVal_1312 (Array Int Int))) (let ((.cse82 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 .cse37 v_ArrVal_1308) .cse22 .cse23)) |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse83 (select .cse82 |c_~#queue~0.base|))) (let ((.cse78 (* (select .cse83 .cse7) 4))) (or (< .cse13 (+ .cse78 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ (* (select (select (store (let ((.cse79 (let ((.cse81 (store .cse82 |c_~#queue~0.base| (store (store .cse83 (+ .cse78 |c_~#queue~0.offset|) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse81 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse81 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse79 |c_~#queue~0.base| (let ((.cse80 (select .cse79 |c_~#queue~0.base|))) (store .cse80 .cse7 (+ (select .cse80 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|)))))))) (forall ((v_ArrVal_1308 Int) (v_ArrVal_1312 (Array Int Int))) (let ((.cse88 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 .cse37 v_ArrVal_1308) .cse22 .cse23)) |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse89 (select .cse88 |c_~#queue~0.base|))) (let ((.cse84 (* (select .cse89 .cse7) 4))) (or (< .cse13 (+ .cse84 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ (* (select (select (store (let ((.cse85 (let ((.cse87 (store .cse88 |c_~#queue~0.base| (store (store .cse89 (+ .cse84 |c_~#queue~0.offset|) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse87 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse87 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse85 |c_~#queue~0.base| (let ((.cse86 (select .cse85 |c_~#queue~0.base|))) (store .cse86 .cse7 (+ (select .cse86 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset| 4) .cse13))))))))) (.cse1 (= .cse77 20)) (.cse2 (< .cse13 .cse12)) (.cse3 (< |c_ULTIMATE.start_main_~#id2~0#1.offset| 0)) (.cse4 (select |c_#length| 5))) (and (or .cse0 .cse1 .cse2 .cse3) (<= .cse4 92) (<= |c_~#stored_elements~0.base| 4) (or (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse22 .cse23)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse9 (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (let ((.cse11 (* (select .cse10 .cse7) 4))) (or (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse5 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse10 (+ |c_~#queue~0.offset| .cse11) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7)) 4) .cse13)) (< .cse13 (+ |c_~#queue~0.offset| 4 .cse11))))))) (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse18 (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (let ((.cse20 (* (select .cse19 .cse7) 4))) (or (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse15 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse19 (+ |c_~#queue~0.offset| .cse20) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse17 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse15 |c_~#queue~0.base| (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store .cse16 .cse7 (+ (select .cse16 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7))))) (< .cse13 (+ |c_~#queue~0.offset| 4 .cse20))))))))) .cse2 .cse3) (exists ((|ULTIMATE.start_main_~#id2~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_main_~#id2~0#1.base|) 4)) (= |c_~#queue~0.offset| 0) (= 5 |c_~#queue~0.base|) (let ((.cse24 (* .cse33 4))) (or (< .cse13 (+ .cse24 |c_~#queue~0.offset| 4)) .cse2 .cse3 (let ((.cse29 (+ .cse24 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse25 (let ((.cse27 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse28 .cse29 v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse27 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse25 |c_~#queue~0.base| (let ((.cse26 (select .cse25 |c_~#queue~0.base|))) (store .cse26 .cse7 (+ (select .cse26 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) 4) .cse13)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse30 (let ((.cse32 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse28 .cse29 v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse32 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse30 |c_~#queue~0.base| (let ((.cse31 (select .cse30 |c_~#queue~0.base|))) (store .cse31 .cse7 (+ (select .cse31 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)))))))) (or .cse2 .cse3 (and (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse34 (let ((.cse36 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse37 v_ArrVal_1315)))) (store .cse36 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse34 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse35 (select .cse34 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse35 .cse22 (+ (select .cse35 .cse22) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)) .cse13)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse38 (let ((.cse40 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse37 v_ArrVal_1315)))) (store .cse40 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse38 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse39 (select .cse38 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse39 .cse22 (+ (select .cse39 .cse22) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)))))) (or .cse2 .cse3 (and (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse45 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse46 (select .cse45 |c_~#queue~0.base|))) (let ((.cse41 (* (select .cse46 .cse7) 4))) (or (< .cse13 (+ .cse41 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ (* (select (select (store (let ((.cse42 (let ((.cse44 (store .cse45 |c_~#queue~0.base| (store (store .cse46 (+ .cse41 |c_~#queue~0.offset|) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse44 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse44 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse42 |c_~#queue~0.base| (let ((.cse43 (select .cse42 |c_~#queue~0.base|))) (store .cse43 .cse7 (+ (select .cse43 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset| 4) .cse13))))))) (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse50 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse51 (select .cse50 |c_~#queue~0.base|))) (let ((.cse52 (* (select .cse51 .cse7) 4))) (or (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ (* (select (select (store (let ((.cse47 (let ((.cse49 (store .cse50 |c_~#queue~0.base| (store (store .cse51 (+ .cse52 |c_~#queue~0.offset|) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse49 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse49 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse47 |c_~#queue~0.base| (let ((.cse48 (select .cse47 |c_~#queue~0.base|))) (store .cse48 .cse7 (+ (select .cse48 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|))) (< .cse13 (+ .cse52 |c_~#queue~0.offset| 4))))))))) (or (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int)) (or (< .cse33 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (forall ((v_ArrVal_1306 Int)) (let ((.cse60 (store .cse28 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1306))) (let ((.cse53 (select .cse60 .cse7))) (or (= .cse53 20) (forall ((v_ArrVal_1308 Int) (v_ArrVal_1312 (Array Int Int))) (let ((.cse58 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse60 .cse12 v_ArrVal_1308) .cse7 (+ .cse53 1))) |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse59 (select .cse58 |c_~#queue~0.base|))) (let ((.cse54 (* (select .cse59 .cse7) 4))) (or (< .cse13 (+ |c_~#queue~0.offset| .cse54 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse55 (let ((.cse57 (store .cse58 |c_~#queue~0.base| (store (store .cse59 (+ |c_~#queue~0.offset| .cse54) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse57 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse57 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse55 |c_~#queue~0.base| (let ((.cse56 (select .cse55 |c_~#queue~0.base|))) (store .cse56 .cse7 (+ (select .cse56 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) 4) .cse13))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int)) (or (< .cse33 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (forall ((v_ArrVal_1306 Int)) (let ((.cse68 (store .cse28 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1306))) (let ((.cse61 (select .cse68 .cse7))) (or (= .cse61 20) (forall ((v_ArrVal_1308 Int) (v_ArrVal_1312 (Array Int Int))) (let ((.cse66 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse68 .cse12 v_ArrVal_1308) .cse7 (+ .cse61 1))) |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse67 (select .cse66 |c_~#queue~0.base|))) (let ((.cse62 (* (select .cse67 .cse7) 4))) (or (< .cse13 (+ |c_~#queue~0.offset| .cse62 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse63 (let ((.cse65 (store .cse66 |c_~#queue~0.base| (store (store .cse67 (+ |c_~#queue~0.offset| .cse62) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse65 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse65 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse63 |c_~#queue~0.base| (let ((.cse64 (select .cse63 |c_~#queue~0.base|))) (store .cse64 .cse7 (+ (select .cse64 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)))))))))))))))) .cse3 (< .cse13 (+ 92 |c_~#queue~0.offset|))) (or (let ((.cse71 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1317 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317)))) (store .cse69 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse70 (select .cse69 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse70 .cse22 (+ (select .cse70 .cse22) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)))) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1317 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317)))) (store .cse72 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse73 (select .cse72 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse73 .cse22 (+ (select .cse73 .cse22) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)) .cse13)))) .cse2 .cse3) (or (< (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 92 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) .cse0 .cse1 .cse2 .cse3) (exists ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1308 Int) (v_ArrVal_1313 Int) (v_ArrVal_1306 Int)) (and (= (let ((.cse74 (let ((.cse75 (store (store (store (store ((as const (Array Int Int)) 0) 80 0) 84 0) 88 0) (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) v_ArrVal_1306))) (let ((.cse76 (select .cse75 84))) (store (store (store .cse75 88 v_ArrVal_1308) 84 (+ .cse76 1)) (+ (* .cse76 4) 4) v_ArrVal_1313))))) (store .cse74 84 (+ (select .cse74 84) 1))) (select |c_#memory_int| 5)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 0))) (<= 92 .cse4)))))) is different from true [2023-08-29 19:42:25,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:42:28,070 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse103 (select .cse21 .cse22))) (let ((.cse24 (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse25 (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse13 (select |c_#length| |c_~#queue~0.base|)) (.cse30 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse23 (+ .cse103 1)) (.cse38 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse43 (select .cse38 .cse7)) (.cse0 (and (forall ((v_ArrVal_1308 Int) (v_ArrVal_1312 (Array Int Int))) (let ((.cse108 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 .cse30 v_ArrVal_1308) .cse22 .cse23)) |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse109 (select .cse108 |c_~#queue~0.base|))) (let ((.cse104 (* (select .cse109 .cse7) 4))) (or (< .cse13 (+ .cse104 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ (* (select (select (store (let ((.cse105 (let ((.cse107 (store .cse108 |c_~#queue~0.base| (store (store .cse109 (+ .cse104 |c_~#queue~0.offset|) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse107 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse107 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse105 |c_~#queue~0.base| (let ((.cse106 (select .cse105 |c_~#queue~0.base|))) (store .cse106 .cse7 (+ (select .cse106 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|)))))))) (forall ((v_ArrVal_1308 Int) (v_ArrVal_1312 (Array Int Int))) (let ((.cse114 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 .cse30 v_ArrVal_1308) .cse22 .cse23)) |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse115 (select .cse114 |c_~#queue~0.base|))) (let ((.cse110 (* (select .cse115 .cse7) 4))) (or (< .cse13 (+ .cse110 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ (* (select (select (store (let ((.cse111 (let ((.cse113 (store .cse114 |c_~#queue~0.base| (store (store .cse115 (+ .cse110 |c_~#queue~0.offset|) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse113 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse113 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse111 |c_~#queue~0.base| (let ((.cse112 (select .cse111 |c_~#queue~0.base|))) (store .cse112 .cse7 (+ (select .cse112 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset| 4) .cse13))))))))) (.cse1 (= .cse103 20)) (.cse29 (+ .cse25 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse83 (< .cse24 (+ 92 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (.cse2 (< .cse13 .cse12)) (.cse3 (< |c_ULTIMATE.start_main_~#id2~0#1.offset| 0)) (.cse4 (select |c_#length| 5))) (and (or .cse0 .cse1 .cse2 .cse3) (<= .cse4 92) (or (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse22 .cse23)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse9 (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (let ((.cse11 (* (select .cse10 .cse7) 4))) (or (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse5 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse10 (+ |c_~#queue~0.offset| .cse11) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7)) 4) .cse13)) (< .cse13 (+ |c_~#queue~0.offset| 4 .cse11))))))) (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse18 (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (let ((.cse20 (* (select .cse19 .cse7) 4))) (or (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse15 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse19 (+ |c_~#queue~0.offset| .cse20) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse17 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse15 |c_~#queue~0.base| (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store .cse16 .cse7 (+ (select .cse16 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7))))) (< .cse13 (+ |c_~#queue~0.offset| 4 .cse20))))))))) .cse2 .cse3) (exists ((|ULTIMATE.start_main_~#id2~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_main_~#id2~0#1.base|) 4)) (= |c_~#queue~0.offset| 0) (= 5 |c_~#queue~0.base|) (or (< .cse24 (+ .cse25 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) .cse2 .cse3 (and (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ (* (select (select (store (let ((.cse26 (let ((.cse28 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 .cse29 v_ArrVal_1313) .cse30 v_ArrVal_1315)))) (store .cse28 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse26 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse27 (select .cse26 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse27 .cse22 (+ 1 (select .cse27 .cse22)))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset| 4) .cse13)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ (* (select (select (store (let ((.cse31 (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 .cse29 v_ArrVal_1313) .cse30 v_ArrVal_1315)))) (store .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse31 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse32 (select .cse31 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse32 .cse22 (+ 1 (select .cse32 .cse22)))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|))))) (let ((.cse34 (* .cse43 4))) (or (< .cse13 (+ .cse34 |c_~#queue~0.offset| 4)) .cse2 .cse3 (let ((.cse39 (+ .cse34 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse35 (let ((.cse37 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse38 .cse39 v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse37 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse35 |c_~#queue~0.base| (let ((.cse36 (select .cse35 |c_~#queue~0.base|))) (store .cse36 .cse7 (+ (select .cse36 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) 4) .cse13)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse40 (let ((.cse42 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse38 .cse39 v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse42 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse42 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse40 |c_~#queue~0.base| (let ((.cse41 (select .cse40 |c_~#queue~0.base|))) (store .cse41 .cse7 (+ (select .cse41 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)))))))) (or .cse2 .cse3 (and (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse44 (let ((.cse46 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse30 v_ArrVal_1315)))) (store .cse46 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse46 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse44 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse45 (select .cse44 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse45 .cse22 (+ (select .cse45 .cse22) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)) .cse13)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse47 (let ((.cse49 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse30 v_ArrVal_1315)))) (store .cse49 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse49 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse47 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse48 (select .cse47 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse48 .cse22 (+ (select .cse48 .cse22) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)))))) (or .cse2 .cse3 (and (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse54 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse55 (select .cse54 |c_~#queue~0.base|))) (let ((.cse50 (* (select .cse55 .cse7) 4))) (or (< .cse13 (+ .cse50 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ (* (select (select (store (let ((.cse51 (let ((.cse53 (store .cse54 |c_~#queue~0.base| (store (store .cse55 (+ .cse50 |c_~#queue~0.offset|) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse53 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse53 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse51 |c_~#queue~0.base| (let ((.cse52 (select .cse51 |c_~#queue~0.base|))) (store .cse52 .cse7 (+ (select .cse52 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset| 4) .cse13))))))) (forall ((v_ArrVal_1312 (Array Int Int))) (let ((.cse59 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse60 (select .cse59 |c_~#queue~0.base|))) (let ((.cse61 (* (select .cse60 .cse7) 4))) (or (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ (* (select (select (store (let ((.cse56 (let ((.cse58 (store .cse59 |c_~#queue~0.base| (store (store .cse60 (+ .cse61 |c_~#queue~0.offset|) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse58 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse58 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse56 |c_~#queue~0.base| (let ((.cse57 (select .cse56 |c_~#queue~0.base|))) (store .cse57 .cse7 (+ (select .cse57 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|))) (< .cse13 (+ .cse61 |c_~#queue~0.offset| 4))))))))) (or (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int)) (or (< .cse43 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (forall ((v_ArrVal_1306 Int)) (let ((.cse69 (store .cse38 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1306))) (let ((.cse62 (select .cse69 .cse7))) (or (= .cse62 20) (forall ((v_ArrVal_1308 Int) (v_ArrVal_1312 (Array Int Int))) (let ((.cse67 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse69 .cse12 v_ArrVal_1308) .cse7 (+ .cse62 1))) |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse68 (select .cse67 |c_~#queue~0.base|))) (let ((.cse63 (* (select .cse68 .cse7) 4))) (or (< .cse13 (+ |c_~#queue~0.offset| .cse63 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse64 (let ((.cse66 (store .cse67 |c_~#queue~0.base| (store (store .cse68 (+ |c_~#queue~0.offset| .cse63) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse66 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse66 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse64 |c_~#queue~0.base| (let ((.cse65 (select .cse64 |c_~#queue~0.base|))) (store .cse65 .cse7 (+ (select .cse65 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) 4) .cse13))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int)) (or (< .cse43 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (forall ((v_ArrVal_1306 Int)) (let ((.cse77 (store .cse38 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1306))) (let ((.cse70 (select .cse77 .cse7))) (or (= .cse70 20) (forall ((v_ArrVal_1308 Int) (v_ArrVal_1312 (Array Int Int))) (let ((.cse75 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse77 .cse12 v_ArrVal_1308) .cse7 (+ .cse70 1))) |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse76 (select .cse75 |c_~#queue~0.base|))) (let ((.cse71 (* (select .cse76 .cse7) 4))) (or (< .cse13 (+ |c_~#queue~0.offset| .cse71 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse72 (let ((.cse74 (store .cse75 |c_~#queue~0.base| (store (store .cse76 (+ |c_~#queue~0.offset| .cse71) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse74 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse74 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse72 |c_~#queue~0.base| (let ((.cse73 (select .cse72 |c_~#queue~0.base|))) (store .cse73 .cse7 (+ (select .cse73 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)))))))))))))))) .cse3 (< .cse13 (+ 92 |c_~#queue~0.offset|))) (or (let ((.cse80 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1317 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317)))) (store .cse78 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse79 (select .cse78 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse79 .cse22 (+ (select .cse79 .cse22) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)))) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1317 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317)))) (store .cse81 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse82 (select .cse81 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse82 .cse22 (+ (select .cse82 .cse22) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4)) .cse13)))) .cse2 .cse3) (or .cse83 .cse0 .cse1 .cse2 .cse3) (exists ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1308 Int) (v_ArrVal_1313 Int) (v_ArrVal_1306 Int)) (and (= (let ((.cse84 (let ((.cse85 (store (store (store (store ((as const (Array Int Int)) 0) 80 0) 84 0) 88 0) (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) v_ArrVal_1306))) (let ((.cse86 (select .cse85 84))) (store (store (store .cse85 88 v_ArrVal_1308) 84 (+ .cse86 1)) (+ (* .cse86 4) 4) v_ArrVal_1313))))) (store .cse84 84 (+ (select .cse84 84) 1))) (select |c_#memory_int| 5)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 0))) (or (and (forall ((v_ArrVal_1306 Int)) (let ((.cse93 (store .cse21 .cse29 v_ArrVal_1306))) (let ((.cse94 (select .cse93 .cse22))) (or (forall ((v_ArrVal_1308 Int) (v_ArrVal_1312 (Array Int Int))) (let ((.cse91 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse93 .cse30 v_ArrVal_1308) .cse22 (+ .cse94 1))) |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse92 (select .cse91 |c_~#queue~0.base|))) (let ((.cse87 (* (select .cse92 .cse7) 4))) (or (< .cse13 (+ .cse87 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= (+ (* (select (select (store (let ((.cse88 (let ((.cse90 (store .cse91 |c_~#queue~0.base| (store (store .cse92 (+ .cse87 |c_~#queue~0.offset|) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse90 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse90 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse88 |c_~#queue~0.base| (let ((.cse89 (select .cse88 |c_~#queue~0.base|))) (store .cse89 .cse7 (+ (select .cse89 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset| 4) .cse13))))))) (= .cse94 20))))) (forall ((v_ArrVal_1306 Int)) (let ((.cse101 (store .cse21 .cse29 v_ArrVal_1306))) (let ((.cse102 (select .cse101 .cse22))) (or (forall ((v_ArrVal_1308 Int) (v_ArrVal_1312 (Array Int Int))) (let ((.cse99 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse101 .cse30 v_ArrVal_1308) .cse22 (+ .cse102 1))) |c_~#stored_elements~0.base| v_ArrVal_1312))) (let ((.cse100 (select .cse99 |c_~#queue~0.base|))) (let ((.cse95 (* (select .cse100 .cse7) 4))) (or (< .cse13 (+ .cse95 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1315 Int) (v_ArrVal_1317 Int)) (<= 0 (+ (* (select (select (store (let ((.cse96 (let ((.cse98 (store .cse99 |c_~#queue~0.base| (store (store .cse100 (+ .cse95 |c_~#queue~0.offset|) v_ArrVal_1313) .cse12 v_ArrVal_1315)))) (store .cse98 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse98 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_1317))))) (store .cse96 |c_~#queue~0.base| (let ((.cse97 (select .cse96 |c_~#queue~0.base|))) (store .cse97 .cse7 (+ (select .cse97 .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|)))))))) (= .cse102 20)))))) .cse83 .cse2 .cse3) (<= 92 .cse4)))))) is different from true [2023-08-29 19:42:30,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:42:32,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:42:35,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:42:37,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Killed by 15