./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longest.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_longest.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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --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:36:25,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:36:25,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:36:25,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:36:25,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:36:25,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:36:25,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:36:25,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:36:25,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:36:25,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:36:25,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:36:25,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:36:25,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:36:25,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:36:25,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:36:25,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:36:25,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:36:25,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:36:25,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:36:25,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:36:25,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:36:25,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:36:25,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:36:25,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:36:25,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:36:25,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:36:25,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:36:25,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:36:25,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:36:25,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:36:25,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:36:25,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:36:25,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:36:25,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:36:25,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:36:25,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:36:25,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:36:25,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:36:25,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:36:25,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:36:25,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:36:25,568 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:36:25,601 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:36:25,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:36:25,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:36:25,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:36:25,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:36:25,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:36:25,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:36:25,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:36:25,604 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:36:25,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:36:25,605 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:36:25,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:36:25,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:36:25,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:36:25,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:36:25,606 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:36:25,606 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:36:25,606 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:36:25,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:36:25,607 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:36:25,607 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:36:25,607 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:36:25,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:36:25,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:36:25,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:36:25,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:36:25,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:36:25,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:36:25,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 19:36:25,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 19:36:25,609 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:36:25,609 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:36:25,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:36:25,610 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:36:25,610 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d 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:36:25,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:36:25,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:36:25,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:36:25,947 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:36:25,947 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:36:25,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-29 19:36:27,127 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:36:27,425 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:36:27,427 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-29 19:36:27,438 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ef150c5/b4f50f0a479746059ec4633a838ee396/FLAG8f7907c2a [2023-08-29 19:36:27,458 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ef150c5/b4f50f0a479746059ec4633a838ee396 [2023-08-29 19:36:27,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:36:27,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:36:27,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:36:27,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:36:27,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:36:27,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:36:27" (1/1) ... [2023-08-29 19:36:27,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4914058e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:27, skipping insertion in model container [2023-08-29 19:36:27,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:36:27" (1/1) ... [2023-08-29 19:36:27,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:36:27,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:36:27,969 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_longest.i[43280,43293] [2023-08-29 19:36:27,977 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_longest.i[43553,43566] [2023-08-29 19:36:27,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:36:28,004 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:36:28,037 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_longest.i[43280,43293] [2023-08-29 19:36:28,049 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_longest.i[43553,43566] [2023-08-29 19:36:28,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:36:28,124 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:36:28,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28 WrapperNode [2023-08-29 19:36:28,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:36:28,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:36:28,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:36:28,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:36:28,131 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:36:28" (1/1) ... [2023-08-29 19:36:28,163 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:36:28" (1/1) ... [2023-08-29 19:36:28,198 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-08-29 19:36:28,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:36:28,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:36:28,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:36:28,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:36:28,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28" (1/1) ... [2023-08-29 19:36:28,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28" (1/1) ... [2023-08-29 19:36:28,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28" (1/1) ... [2023-08-29 19:36:28,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28" (1/1) ... [2023-08-29 19:36:28,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28" (1/1) ... [2023-08-29 19:36:28,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28" (1/1) ... [2023-08-29 19:36:28,249 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28" (1/1) ... [2023-08-29 19:36:28,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28" (1/1) ... [2023-08-29 19:36:28,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:36:28,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:36:28,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:36:28,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:36:28,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28" (1/1) ... [2023-08-29 19:36:28,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:36:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:36:28,285 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:36:28,292 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:36:28,316 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-29 19:36:28,317 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-29 19:36:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-29 19:36:28,318 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-29 19:36:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:36:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:36:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 19:36:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 19:36:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 19:36:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:36:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 19:36:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:36:28,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:36:28,320 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:36:28,499 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:36:28,500 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:36:28,916 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:36:28,924 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:36:28,936 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-29 19:36:28,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:36:28 BoogieIcfgContainer [2023-08-29 19:36:28,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:36:28,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:36:28,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:36:28,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:36:28,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:36:27" (1/3) ... [2023-08-29 19:36:28,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a19f61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:36:28, skipping insertion in model container [2023-08-29 19:36:28,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:36:28" (2/3) ... [2023-08-29 19:36:28,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a19f61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:36:28, skipping insertion in model container [2023-08-29 19:36:28,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:36:28" (3/3) ... [2023-08-29 19:36:28,960 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-08-29 19:36:28,974 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:36:28,974 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-29 19:36:28,975 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:36:29,131 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 19:36:29,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 278 transitions, 572 flow [2023-08-29 19:36:29,305 INFO L130 PetriNetUnfolder]: 13/276 cut-off events. [2023-08-29 19:36:29,305 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:36:29,320 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:36:29,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 278 transitions, 572 flow [2023-08-29 19:36:29,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 272 transitions, 556 flow [2023-08-29 19:36:29,335 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:36:29,348 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-29 19:36:29,350 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-29 19:36:29,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 272 transitions, 556 flow [2023-08-29 19:36:29,402 INFO L130 PetriNetUnfolder]: 13/272 cut-off events. [2023-08-29 19:36:29,403 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:36:29,407 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:36:29,415 INFO L119 LiptonReduction]: Number of co-enabled transitions 17820 [2023-08-29 19:36:41,387 INFO L134 LiptonReduction]: Checked pairs total: 64286 [2023-08-29 19:36:41,387 INFO L136 LiptonReduction]: Total number of compositions: 358 [2023-08-29 19:36:41,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:36:41,405 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;@48f62f6f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:36:41,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-08-29 19:36:41,407 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 19:36:41,407 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:36:41,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:41,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 19:36:41,408 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:36:41,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1161, now seen corresponding path program 1 times [2023-08-29 19:36:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:41,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530401246] [2023-08-29 19:36:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:41,525 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:36:41,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:41,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530401246] [2023-08-29 19:36:41,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530401246] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:41,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:41,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 19:36:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602560750] [2023-08-29 19:36:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:41,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:36:41,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:41,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:36:41,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:36:41,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 636 [2023-08-29 19:36:41,564 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:36:41,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:41,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 636 [2023-08-29 19:36:41,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:42,126 INFO L130 PetriNetUnfolder]: 3797/6059 cut-off events. [2023-08-29 19:36:42,127 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-29 19:36:42,131 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:36:42,156 INFO L137 encePairwiseOnDemand]: 600/636 looper letters, 61 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2023-08-29 19:36:42,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 274 flow [2023-08-29 19:36:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:36:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:36:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 631 transitions. [2023-08-29 19:36:42,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960691823899371 [2023-08-29 19:36:42,169 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 631 transitions. [2023-08-29 19:36:42,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 631 transitions. [2023-08-29 19:36:42,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:42,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 631 transitions. [2023-08-29 19:36:42,177 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:36:42,182 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:36:42,183 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:36:42,184 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:36:42,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 274 flow [2023-08-29 19:36:42,189 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:36:42,190 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2023-08-29 19:36:42,192 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:36:42,194 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-29 19:36:42,195 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2023-08-29 19:36:42,195 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:36:42,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:42,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:36:42,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 19:36:42,196 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:36:42,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1154497, now seen corresponding path program 1 times [2023-08-29 19:36:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:42,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272693643] [2023-08-29 19:36:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:42,376 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:36:42,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:42,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272693643] [2023-08-29 19:36:42,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272693643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:42,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:42,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:36:42,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887402048] [2023-08-29 19:36:42,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:42,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:36:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:42,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:36:42,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:36:42,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 636 [2023-08-29 19:36:42,495 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:36:42,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:42,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 636 [2023-08-29 19:36:42,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:43,020 INFO L130 PetriNetUnfolder]: 3749/5963 cut-off events. [2023-08-29 19:36:43,020 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 19:36:43,025 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:36:43,057 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 57 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-29 19:36:43,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 258 flow [2023-08-29 19:36:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:36:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:36:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2023-08-29 19:36:43,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43763102725366876 [2023-08-29 19:36:43,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2023-08-29 19:36:43,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2023-08-29 19:36:43,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:43,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2023-08-29 19:36:43,065 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:36:43,070 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:36:43,071 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:36:43,071 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:36:43,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 258 flow [2023-08-29 19:36:43,073 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:36:43,075 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2023-08-29 19:36:43,075 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:36:43,077 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-29 19:36:43,077 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2023-08-29 19:36:43,078 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:36:43,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:43,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:36:43,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 19:36:43,079 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:36:43,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1154498, now seen corresponding path program 1 times [2023-08-29 19:36:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:43,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367081166] [2023-08-29 19:36:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:43,195 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:36:43,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367081166] [2023-08-29 19:36:43,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367081166] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:43,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:43,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:36:43,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784493153] [2023-08-29 19:36:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:43,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:36:43,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:43,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:36:43,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:36:43,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:36:43,305 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:36:43,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:43,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:36:43,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:43,809 INFO L130 PetriNetUnfolder]: 3701/5867 cut-off events. [2023-08-29 19:36:43,809 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 19:36:43,814 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:36:43,833 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 55 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-29 19:36:43,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 254 flow [2023-08-29 19:36:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:36:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:36:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2023-08-29 19:36:43,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44287211740041926 [2023-08-29 19:36:43,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 845 transitions. [2023-08-29 19:36:43,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 845 transitions. [2023-08-29 19:36:43,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:43,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 845 transitions. [2023-08-29 19:36:43,839 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:36:43,842 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:36:43,844 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:36:43,844 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:36:43,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 254 flow [2023-08-29 19:36:43,845 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:36:43,846 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2023-08-29 19:36:43,846 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:36:43,847 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2023-08-29 19:36:43,847 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2023-08-29 19:36:43,847 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:36:43,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:43,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:36:43,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 19:36:43,848 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:36:43,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496233, now seen corresponding path program 1 times [2023-08-29 19:36:43,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:43,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169673294] [2023-08-29 19:36:43,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:43,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:44,355 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:36:44,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:44,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169673294] [2023-08-29 19:36:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169673294] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:44,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:44,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:36:44,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842395473] [2023-08-29 19:36:44,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:44,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:36:44,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:44,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:36:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:36:44,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-29 19:36:44,482 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:36:44,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:44,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-29 19:36:44,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:44,995 INFO L130 PetriNetUnfolder]: 3800/6080 cut-off events. [2023-08-29 19:36:44,996 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 19:36:45,004 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:36:45,027 INFO L137 encePairwiseOnDemand]: 630/636 looper letters, 63 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-08-29 19:36:45,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 292 flow [2023-08-29 19:36:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:36:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:36:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-08-29 19:36:45,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-29 19:36:45,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-08-29 19:36:45,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-08-29 19:36:45,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:45,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-08-29 19:36:45,038 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:36:45,042 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:36:45,043 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:36:45,043 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:36:45,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 292 flow [2023-08-29 19:36:45,046 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:36:45,048 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 164 flow [2023-08-29 19:36:45,048 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:36:45,050 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2023-08-29 19:36:45,050 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 164 flow [2023-08-29 19:36:45,051 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:36:45,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:45,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:36:45,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 19:36:45,052 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:36:45,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496236, now seen corresponding path program 1 times [2023-08-29 19:36:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:45,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058257774] [2023-08-29 19:36:45,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:45,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:45,114 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:36:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:45,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058257774] [2023-08-29 19:36:45,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058257774] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:45,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:45,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:36:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4714477] [2023-08-29 19:36:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:45,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:36:45,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:45,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:36:45,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:36:45,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 636 [2023-08-29 19:36:45,230 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:36:45,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:45,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 636 [2023-08-29 19:36:45,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:45,655 INFO L130 PetriNetUnfolder]: 3253/5163 cut-off events. [2023-08-29 19:36:45,655 INFO L131 PetriNetUnfolder]: For 213/296 co-relation queries the response was YES. [2023-08-29 19:36:45,660 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:36:45,674 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 54 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-29 19:36:45,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 270 flow [2023-08-29 19:36:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:36:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:36:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2023-08-29 19:36:45,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449685534591195 [2023-08-29 19:36:45,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2023-08-29 19:36:45,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2023-08-29 19:36:45,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:45,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2023-08-29 19:36:45,680 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:36:45,683 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:36:45,685 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:36:45,685 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:36:45,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 270 flow [2023-08-29 19:36:45,686 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:36:45,687 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 158 flow [2023-08-29 19:36:45,687 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:36:45,687 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-29 19:36:45,688 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 158 flow [2023-08-29 19:36:45,688 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:36:45,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:45,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:36:45,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 19:36:45,689 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:36:45,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:45,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495978, now seen corresponding path program 1 times [2023-08-29 19:36:45,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:45,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629931601] [2023-08-29 19:36:45,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:45,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:45,749 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:36:45,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:45,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629931601] [2023-08-29 19:36:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629931601] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:36:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562126691] [2023-08-29 19:36:45,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:45,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:36:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:36:45,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:36:45,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:36:45,849 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:36:45,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:45,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:36:45,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:46,119 INFO L130 PetriNetUnfolder]: 2363/3821 cut-off events. [2023-08-29 19:36:46,120 INFO L131 PetriNetUnfolder]: For 169/231 co-relation queries the response was YES. [2023-08-29 19:36:46,125 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:36:46,136 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 53 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-29 19:36:46,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 266 flow [2023-08-29 19:36:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:36:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:36:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-08-29 19:36:46,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2023-08-29 19:36:46,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-08-29 19:36:46,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-08-29 19:36:46,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:46,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-08-29 19:36:46,142 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:36:46,145 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:36:46,146 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:36:46,146 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:36:46,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 266 flow [2023-08-29 19:36:46,147 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:36:46,148 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 156 flow [2023-08-29 19:36:46,148 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:36:46,149 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-29 19:36:46,149 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 156 flow [2023-08-29 19:36:46,150 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:36:46,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:46,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:36:46,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 19:36:46,150 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:36:46,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495977, now seen corresponding path program 1 times [2023-08-29 19:36:46,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:46,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700356003] [2023-08-29 19:36:46,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:46,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:46,201 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:36:46,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700356003] [2023-08-29 19:36:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700356003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:46,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:46,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:36:46,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983050751] [2023-08-29 19:36:46,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:46,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:36:46,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:46,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:36:46,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:36:46,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-29 19:36:46,368 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:36:46,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:46,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-29 19:36:46,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:46,575 INFO L130 PetriNetUnfolder]: 1473/2479 cut-off events. [2023-08-29 19:36:46,576 INFO L131 PetriNetUnfolder]: For 125/166 co-relation queries the response was YES. [2023-08-29 19:36:46,578 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:36:46,585 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 52 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-29 19:36:46,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 262 flow [2023-08-29 19:36:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:36:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:36:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2023-08-29 19:36:46,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271488469601677 [2023-08-29 19:36:46,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2023-08-29 19:36:46,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2023-08-29 19:36:46,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:46,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2023-08-29 19:36:46,590 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:36:46,593 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:36:46,593 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:36:46,594 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:36:46,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 262 flow [2023-08-29 19:36:46,595 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:36:46,595 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 154 flow [2023-08-29 19:36:46,596 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:36:46,596 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2023-08-29 19:36:46,596 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 154 flow [2023-08-29 19:36:46,597 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:36:46,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:46,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:36:46,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 19:36:46,598 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:36:46,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash 34798183, now seen corresponding path program 1 times [2023-08-29 19:36:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:46,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147094842] [2023-08-29 19:36:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:47,254 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:36:47,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:47,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147094842] [2023-08-29 19:36:47,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147094842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:47,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:47,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:36:47,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108241478] [2023-08-29 19:36:47,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:47,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:36:47,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:47,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:36:47,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:36:48,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 636 [2023-08-29 19:36:48,122 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:36:48,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:48,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 636 [2023-08-29 19:36:48,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:48,752 INFO L130 PetriNetUnfolder]: 1853/3134 cut-off events. [2023-08-29 19:36:48,752 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2023-08-29 19:36:48,756 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:36:48,764 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 75 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2023-08-29 19:36:48,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 383 flow [2023-08-29 19:36:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:36:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:36:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1094 transitions. [2023-08-29 19:36:48,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4300314465408805 [2023-08-29 19:36:48,768 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1094 transitions. [2023-08-29 19:36:48,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1094 transitions. [2023-08-29 19:36:48,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:48,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1094 transitions. [2023-08-29 19:36:48,771 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:36:48,774 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:36:48,774 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:36:48,774 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:36:48,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 383 flow [2023-08-29 19:36:48,776 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:36:48,777 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 208 flow [2023-08-29 19:36:48,777 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:36:48,778 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-29 19:36:48,778 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 208 flow [2023-08-29 19:36:48,778 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:36:48,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:48,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:36:48,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 19:36:48,779 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:36:48,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash 34645865, now seen corresponding path program 1 times [2023-08-29 19:36:48,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:48,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580820944] [2023-08-29 19:36:48,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:48,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:48,921 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:36:48,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:48,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580820944] [2023-08-29 19:36:48,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580820944] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:48,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:48,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:36:48,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880778874] [2023-08-29 19:36:48,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:48,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:36:48,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:48,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:36:48,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:36:49,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 636 [2023-08-29 19:36:49,132 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:36:49,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:49,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 636 [2023-08-29 19:36:49,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:49,394 INFO L130 PetriNetUnfolder]: 1643/2806 cut-off events. [2023-08-29 19:36:49,394 INFO L131 PetriNetUnfolder]: For 423/423 co-relation queries the response was YES. [2023-08-29 19:36:49,398 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:36:49,406 INFO L137 encePairwiseOnDemand]: 627/636 looper letters, 81 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-08-29 19:36:49,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 425 flow [2023-08-29 19:36:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:36:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:36:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1108 transitions. [2023-08-29 19:36:49,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-29 19:36:49,410 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1108 transitions. [2023-08-29 19:36:49,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1108 transitions. [2023-08-29 19:36:49,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:49,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1108 transitions. [2023-08-29 19:36:49,413 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:36:49,417 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:36:49,418 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:36:49,418 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:36:49,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 425 flow [2023-08-29 19:36:49,420 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:36:49,421 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 184 flow [2023-08-29 19:36:49,421 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:36:49,422 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-29 19:36:49,422 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 184 flow [2023-08-29 19:36:49,423 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:36:49,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:49,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:36:49,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 19:36:49,425 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:36:49,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843232, now seen corresponding path program 1 times [2023-08-29 19:36:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:49,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972514665] [2023-08-29 19:36:49,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:49,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:49,470 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:36:49,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:49,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972514665] [2023-08-29 19:36:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972514665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:49,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:49,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:36:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435033818] [2023-08-29 19:36:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:49,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:36:49,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:36:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:36:49,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:36:49,480 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:36:49,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:49,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:36:49,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:49,622 INFO L130 PetriNetUnfolder]: 533/1074 cut-off events. [2023-08-29 19:36:49,622 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-08-29 19:36:49,624 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:36:49,627 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 61 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-29 19:36:49,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 339 flow [2023-08-29 19:36:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:36:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:36:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2023-08-29 19:36:49,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44234800838574423 [2023-08-29 19:36:49,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 844 transitions. [2023-08-29 19:36:49,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 844 transitions. [2023-08-29 19:36:49,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:49,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 844 transitions. [2023-08-29 19:36:49,633 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:36:49,635 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:36:49,636 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:36:49,636 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:36:49,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 339 flow [2023-08-29 19:36:49,639 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:36:49,640 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 185 flow [2023-08-29 19:36:49,640 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:36:49,642 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-29 19:36:49,642 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 185 flow [2023-08-29 19:36:49,643 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:36:49,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:49,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:36:49,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 19:36:49,643 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:36:49,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781159, now seen corresponding path program 1 times [2023-08-29 19:36:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679029164] [2023-08-29 19:36:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:49,777 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:36:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:49,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679029164] [2023-08-29 19:36:49,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679029164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:49,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:49,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:36:49,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608377019] [2023-08-29 19:36:49,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:49,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:36:49,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:49,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:36:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:36:49,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 636 [2023-08-29 19:36:49,885 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:36:49,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:49,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 636 [2023-08-29 19:36:49,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:50,017 INFO L130 PetriNetUnfolder]: 506/1041 cut-off events. [2023-08-29 19:36:50,017 INFO L131 PetriNetUnfolder]: For 131/133 co-relation queries the response was YES. [2023-08-29 19:36:50,019 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:36:50,023 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 47 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-29 19:36:50,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 281 flow [2023-08-29 19:36:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:36:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:36:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2023-08-29 19:36:50,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4334381551362683 [2023-08-29 19:36:50,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2023-08-29 19:36:50,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2023-08-29 19:36:50,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:50,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2023-08-29 19:36:50,029 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:36:50,031 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:36:50,032 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:36:50,032 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:36:50,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 281 flow [2023-08-29 19:36:50,034 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:36:50,034 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 181 flow [2023-08-29 19:36:50,035 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:36:50,035 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-29 19:36:50,035 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 181 flow [2023-08-29 19:36:50,036 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:36:50,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:50,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:36:50,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 19:36:50,037 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:36:50,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:50,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781158, now seen corresponding path program 1 times [2023-08-29 19:36:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:50,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125647757] [2023-08-29 19:36:50,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:50,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:50,182 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:36:50,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:50,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125647757] [2023-08-29 19:36:50,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125647757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:50,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:50,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:36:50,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471146382] [2023-08-29 19:36:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:50,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:36:50,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:50,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:36:50,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:36:50,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 636 [2023-08-29 19:36:50,357 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:36:50,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:50,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 636 [2023-08-29 19:36:50,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:50,484 INFO L130 PetriNetUnfolder]: 354/719 cut-off events. [2023-08-29 19:36:50,484 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-29 19:36:50,486 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:36:50,487 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 59 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-29 19:36:50,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 330 flow [2023-08-29 19:36:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:36:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:36:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1105 transitions. [2023-08-29 19:36:50,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343553459119497 [2023-08-29 19:36:50,491 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1105 transitions. [2023-08-29 19:36:50,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1105 transitions. [2023-08-29 19:36:50,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:50,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1105 transitions. [2023-08-29 19:36:50,494 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:36:50,497 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:36:50,497 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:36:50,498 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:36:50,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 330 flow [2023-08-29 19:36:50,499 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:36:50,500 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 179 flow [2023-08-29 19:36:50,500 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:36:50,501 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-29 19:36:50,501 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 179 flow [2023-08-29 19:36:50,501 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:36:50,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:50,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:36:50,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 19:36:50,502 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:36:50,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1250363540, now seen corresponding path program 1 times [2023-08-29 19:36:50,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:50,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536813957] [2023-08-29 19:36:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:50,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:50,816 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:36:50,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:50,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536813957] [2023-08-29 19:36:50,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536813957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:36:50,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:36:50,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:36:50,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389727160] [2023-08-29 19:36:50,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:36:50,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:36:50,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:50,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:36:50,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:36:50,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 636 [2023-08-29 19:36:50,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 254.4) internal successors, (1272), 5 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:36:50,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:50,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 636 [2023-08-29 19:36:50,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:51,113 INFO L130 PetriNetUnfolder]: 368/732 cut-off events. [2023-08-29 19:36:51,113 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-29 19:36:51,114 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:36:51,116 INFO L137 encePairwiseOnDemand]: 629/636 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-29 19:36:51,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 343 flow [2023-08-29 19:36:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:36:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:36:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1573 transitions. [2023-08-29 19:36:51,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41221174004192873 [2023-08-29 19:36:51,121 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1573 transitions. [2023-08-29 19:36:51,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1573 transitions. [2023-08-29 19:36:51,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:51,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1573 transitions. [2023-08-29 19:36:51,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 262.1666666666667) internal successors, (1573), 6 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states 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:36:51,129 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:36:51,130 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:36:51,130 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 179 flow. Second operand 6 states and 1573 transitions. [2023-08-29 19:36:51,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 343 flow [2023-08-29 19:36:51,131 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:36:51,132 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 233 flow [2023-08-29 19:36:51,132 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:36:51,133 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -37 predicate places. [2023-08-29 19:36:51,133 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 233 flow [2023-08-29 19:36:51,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 254.4) internal successors, (1272), 5 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:36:51,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:51,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:36:51,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 19:36:51,134 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:36:51,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:51,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1718251328, now seen corresponding path program 1 times [2023-08-29 19:36:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:51,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315302611] [2023-08-29 19:36:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:51,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:51,463 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:36:51,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:51,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315302611] [2023-08-29 19:36:51,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315302611] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:36:51,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512443620] [2023-08-29 19:36:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:51,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:36:51,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:36:51,472 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:36:51,480 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:36:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:51,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 19:36:51,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:36:51,837 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:36:51,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:51,870 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:36:51,889 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:36:51,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:36:51,923 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_423 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_423 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-29 19:36:51,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:36:51,934 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:36:51,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:36:51,943 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 50 treesize of output 49 [2023-08-29 19:36:51,963 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 14 treesize of output 10 [2023-08-29 19:36:51,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:36:51,969 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:36:51,971 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 19:36:51,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:51,974 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 24 treesize of output 12 [2023-08-29 19:36:52,062 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:36:52,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512443620] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:36:52,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:36:52,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-29 19:36:52,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640946934] [2023-08-29 19:36:52,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:36:52,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 19:36:52,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:36:52,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 19:36:52,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=1, NotChecked=22, Total=182 [2023-08-29 19:36:52,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 636 [2023-08-29 19:36:52,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 233 flow. Second operand has 14 states, 14 states have (on average 176.78571428571428) internal successors, (2475), 14 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states 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:36:52,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:52,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 636 [2023-08-29 19:36:52,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:52,561 INFO L130 PetriNetUnfolder]: 526/1050 cut-off events. [2023-08-29 19:36:52,561 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2023-08-29 19:36:52,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 1050 events. 526/1050 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5515 event pairs, 108 based on Foata normal form. 8/965 useless extension candidates. Maximal degree in co-relation 2415. Up to 607 conditions per place. [2023-08-29 19:36:52,566 INFO L137 encePairwiseOnDemand]: 628/636 looper letters, 91 selfloop transitions, 13 changer transitions 0/110 dead transitions. [2023-08-29 19:36:52,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 110 transitions, 567 flow [2023-08-29 19:36:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:36:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:36:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1315 transitions. [2023-08-29 19:36:52,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2953728661275831 [2023-08-29 19:36:52,571 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1315 transitions. [2023-08-29 19:36:52,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1315 transitions. [2023-08-29 19:36:52,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:52,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1315 transitions. [2023-08-29 19:36:52,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 187.85714285714286) internal successors, (1315), 7 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states 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:36:52,579 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:36:52,580 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:36:52,580 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 233 flow. Second operand 7 states and 1315 transitions. [2023-08-29 19:36:52,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 110 transitions, 567 flow [2023-08-29 19:36:52,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 110 transitions, 559 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 19:36:52,583 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 286 flow [2023-08-29 19:36:52,583 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=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=286, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2023-08-29 19:36:52,584 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -31 predicate places. [2023-08-29 19:36:52,584 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 286 flow [2023-08-29 19:36:52,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 176.78571428571428) internal successors, (2475), 14 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states 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:36:52,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:52,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:36:52,602 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:36:52,799 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,SelfDestructingSolverStorable13 [2023-08-29 19:36:52,800 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:36:52,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash 99588272, now seen corresponding path program 1 times [2023-08-29 19:36:52,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:36:52,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372586618] [2023-08-29 19:36:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:52,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:36:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:53,591 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:36:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:36:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372586618] [2023-08-29 19:36:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372586618] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:36:53,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635777376] [2023-08-29 19:36:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:36:53,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:36:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:36:53,593 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:36:53,603 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:36:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:36:53,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 73 conjunts are in the unsatisfiable core [2023-08-29 19:36:53,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:36:53,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:53,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:53,776 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:36:53,776 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:36:53,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:53,783 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:36:53,788 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:36:53,913 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:36:54,001 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:36:54,139 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:36:54,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:54,187 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:36:54,216 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:36:54,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:36:54,240 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_517 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_517 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_517) |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:36:54,251 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_517 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_517 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:36:54,261 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_517 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_517 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_517) |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:36:54,280 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_513 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_513) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_513 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_513) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_517) |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:37:01,952 WARN L222 SmtUtils]: Spent 6.39s 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:37:02,056 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:37:02,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635777376] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:37:02,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:37:02,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2023-08-29 19:37:02,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299452873] [2023-08-29 19:37:02,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:37:02,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-29 19:37:02,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:02,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-29 19:37:02,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=226, Unknown=8, NotChecked=140, Total=462 [2023-08-29 19:37:02,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 636 [2023-08-29 19:37:02,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 286 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:37:02,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:02,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 636 [2023-08-29 19:37:02,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:19,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:27,912 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 [1] [2023-08-29 19:37:29,908 INFO L130 PetriNetUnfolder]: 869/1746 cut-off events. [2023-08-29 19:37:29,908 INFO L131 PetriNetUnfolder]: For 672/672 co-relation queries the response was YES. [2023-08-29 19:37:29,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4167 conditions, 1746 events. 869/1746 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10155 event pairs, 520 based on Foata normal form. 16/1634 useless extension candidates. Maximal degree in co-relation 4153. Up to 1078 conditions per place. [2023-08-29 19:37:29,916 INFO L137 encePairwiseOnDemand]: 618/636 looper letters, 126 selfloop transitions, 65 changer transitions 0/197 dead transitions. [2023-08-29 19:37:29,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 197 transitions, 1094 flow [2023-08-29 19:37:29,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-29 19:37:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-29 19:37:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4116 transitions. [2023-08-29 19:37:29,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28137817883511074 [2023-08-29 19:37:29,928 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4116 transitions. [2023-08-29 19:37:29,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4116 transitions. [2023-08-29 19:37:29,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:29,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4116 transitions. [2023-08-29 19:37:29,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 178.95652173913044) internal successors, (4116), 23 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states 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:37:29,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 636.0) internal successors, (15264), 24 states have internal predecessors, (15264), 0 states have call successors, (0), 0 states 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:37:29,955 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 636.0) internal successors, (15264), 24 states have internal predecessors, (15264), 0 states have call successors, (0), 0 states 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:37:29,955 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 286 flow. Second operand 23 states and 4116 transitions. [2023-08-29 19:37:29,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 197 transitions, 1094 flow [2023-08-29 19:37:29,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 197 transitions, 1070 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-29 19:37:29,961 INFO L231 Difference]: Finished difference. Result has 103 places, 126 transitions, 770 flow [2023-08-29 19:37:29,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=770, PETRI_PLACES=103, PETRI_TRANSITIONS=126} [2023-08-29 19:37:29,961 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -3 predicate places. [2023-08-29 19:37:29,961 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 126 transitions, 770 flow [2023-08-29 19:37:29,962 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:37:29,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:29,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:29,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-29 19:37:30,168 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,SelfDestructingSolverStorable14 [2023-08-29 19:37:30,168 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:37:30,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1733159420, now seen corresponding path program 1 times [2023-08-29 19:37:30,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:30,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307588069] [2023-08-29 19:37:30,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:31,025 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:37:31,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:31,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307588069] [2023-08-29 19:37:31,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307588069] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:37:31,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370329847] [2023-08-29 19:37:31,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:31,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:37:31,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:37:31,027 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:37:31,029 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:37:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:31,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-29 19:37:31,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:37:31,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:37:31,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:37:31,217 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:37:31,217 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:37:31,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:37:31,226 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:37:31,235 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:37:31,247 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:37:31,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:37:31,389 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 14 treesize of output 16 [2023-08-29 19:37:31,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:37:31,513 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:37:31,632 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:37:31,770 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:37:31,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:37:31,817 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:37:31,853 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:37:31,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:37:31,883 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_612 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_612 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:37:34,306 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int) (v_ArrVal_606 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_606))) (store (store .cse1 .cse2 v_ArrVal_608) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse3) 4)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int) (v_ArrVal_606 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_606))) (store (store .cse5 .cse2 v_ArrVal_608) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2023-08-29 19:37:34,348 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_605 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_605))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int) (v_ArrVal_606 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_606))) (store (store .cse1 .cse2 v_ArrVal_608) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_605 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_605))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int) (v_ArrVal_606 Int)) (<= 0 (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_606))) (store (store .cse7 .cse2 v_ArrVal_608) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))) is different from false [2023-08-29 19:37:34,430 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:37:34,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370329847] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:37:34,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:37:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2023-08-29 19:37:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025820735] [2023-08-29 19:37:34,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:37:34,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-29 19:37:34,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:34,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-29 19:37:34,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=359, Unknown=18, NotChecked=126, Total=600 [2023-08-29 19:37:35,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:37:35,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 126 transitions, 770 flow. Second operand has 25 states, 25 states have (on average 167.68) internal successors, (4192), 25 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states 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:37:35,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:35,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:37:35,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:46,573 INFO L130 PetriNetUnfolder]: 1315/2651 cut-off events. [2023-08-29 19:37:46,573 INFO L131 PetriNetUnfolder]: For 11567/11739 co-relation queries the response was YES. [2023-08-29 19:37:46,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10871 conditions, 2651 events. 1315/2651 cut-off events. For 11567/11739 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 17155 event pairs, 528 based on Foata normal form. 22/2464 useless extension candidates. Maximal degree in co-relation 10848. Up to 875 conditions per place. [2023-08-29 19:37:46,591 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 183 selfloop transitions, 69 changer transitions 0/258 dead transitions. [2023-08-29 19:37:46,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 258 transitions, 2129 flow [2023-08-29 19:37:46,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 19:37:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 19:37:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2343 transitions. [2023-08-29 19:37:46,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28338171262699563 [2023-08-29 19:37:46,598 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2343 transitions. [2023-08-29 19:37:46,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2343 transitions. [2023-08-29 19:37:46,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:46,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2343 transitions. [2023-08-29 19:37:46,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 180.23076923076923) internal successors, (2343), 13 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states 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:37:46,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 636.0) internal successors, (8904), 14 states have internal predecessors, (8904), 0 states have call successors, (0), 0 states 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:37:46,613 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 636.0) internal successors, (8904), 14 states have internal predecessors, (8904), 0 states have call successors, (0), 0 states 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:37:46,613 INFO L175 Difference]: Start difference. First operand has 103 places, 126 transitions, 770 flow. Second operand 13 states and 2343 transitions. [2023-08-29 19:37:46,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 258 transitions, 2129 flow [2023-08-29 19:37:46,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 258 transitions, 2022 flow, removed 46 selfloop flow, removed 4 redundant places. [2023-08-29 19:37:46,626 INFO L231 Difference]: Finished difference. Result has 117 places, 158 transitions, 1183 flow [2023-08-29 19:37:46,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1183, PETRI_PLACES=117, PETRI_TRANSITIONS=158} [2023-08-29 19:37:46,627 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 11 predicate places. [2023-08-29 19:37:46,627 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 158 transitions, 1183 flow [2023-08-29 19:37:46,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 167.68) internal successors, (4192), 25 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states 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:37:46,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:46,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:46,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-29 19:37:46,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:37:46,836 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:37:46,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1207730986, now seen corresponding path program 2 times [2023-08-29 19:37:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670445491] [2023-08-29 19:37:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:47,637 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:37:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670445491] [2023-08-29 19:37:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670445491] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:37:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656195461] [2023-08-29 19:37:47,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:37:47,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:37:47,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:37:47,639 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:37:47,642 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:37:47,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:37:47,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:37:47,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-29 19:37:47,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:37:47,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:37:47,858 INFO L321 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2023-08-29 19:37:47,859 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:37:47,898 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-29 19:37:47,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2023-08-29 19:37:47,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:37:47,926 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:37:47,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2023-08-29 19:37:48,489 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 74 treesize of output 67 [2023-08-29 19:37:48,580 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 19:37:48,581 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:37:48,999 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:37:49,370 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:37:49,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:37:49,516 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:37:49,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:37:49,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:37:49,724 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:37:49,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:37:49,812 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |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:37:53,967 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-29 19:38:01,112 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:38:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656195461] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:38:01,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:38:01,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2023-08-29 19:38:01,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927037075] [2023-08-29 19:38:01,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:38:01,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-29 19:38:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:38:01,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-29 19:38:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=460, Unknown=24, NotChecked=94, Total=702 [2023-08-29 19:38:01,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:38:01,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 158 transitions, 1183 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:38:01,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:01,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:38:01,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:13,553 WARN L222 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 113 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:38:15,940 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:38:17,977 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 [0, 1] [2023-08-29 19:38:22,307 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:29,543 INFO L130 PetriNetUnfolder]: 1905/3872 cut-off events. [2023-08-29 19:38:29,543 INFO L131 PetriNetUnfolder]: For 24617/24634 co-relation queries the response was YES. [2023-08-29 19:38:29,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18047 conditions, 3872 events. 1905/3872 cut-off events. For 24617/24634 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 27267 event pairs, 649 based on Foata normal form. 14/3638 useless extension candidates. Maximal degree in co-relation 18017. Up to 1633 conditions per place. [2023-08-29 19:38:29,571 INFO L137 encePairwiseOnDemand]: 616/636 looper letters, 212 selfloop transitions, 97 changer transitions 0/315 dead transitions. [2023-08-29 19:38:29,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 315 transitions, 3239 flow [2023-08-29 19:38:29,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 19:38:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 19:38:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3535 transitions. [2023-08-29 19:38:29,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27790880503144655 [2023-08-29 19:38:29,580 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3535 transitions. [2023-08-29 19:38:29,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3535 transitions. [2023-08-29 19:38:29,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:29,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3535 transitions. [2023-08-29 19:38:29,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 176.75) internal successors, (3535), 20 states have internal predecessors, (3535), 0 states have call successors, (0), 0 states 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:29,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 636.0) internal successors, (13356), 21 states have internal predecessors, (13356), 0 states have call successors, (0), 0 states 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:29,599 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 636.0) internal successors, (13356), 21 states have internal predecessors, (13356), 0 states have call successors, (0), 0 states 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:29,599 INFO L175 Difference]: Start difference. First operand has 117 places, 158 transitions, 1183 flow. Second operand 20 states and 3535 transitions. [2023-08-29 19:38:29,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 315 transitions, 3239 flow [2023-08-29 19:38:29,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 315 transitions, 3081 flow, removed 79 selfloop flow, removed 0 redundant places. [2023-08-29 19:38:29,628 INFO L231 Difference]: Finished difference. Result has 144 places, 204 transitions, 1896 flow [2023-08-29 19:38:29,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1896, PETRI_PLACES=144, PETRI_TRANSITIONS=204} [2023-08-29 19:38:29,629 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 38 predicate places. [2023-08-29 19:38:29,629 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 204 transitions, 1896 flow [2023-08-29 19:38:29,631 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:38:29,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:29,631 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:38:29,642 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:38:29,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-29 19:38:29,841 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:38:29,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1966192756, now seen corresponding path program 1 times [2023-08-29 19:38:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:38:29,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567574289] [2023-08-29 19:38:29,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:38:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:29,961 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:38:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:38:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567574289] [2023-08-29 19:38:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567574289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:29,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:29,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:38:29,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669300941] [2023-08-29 19:38:29,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:29,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:38:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:38:29,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:38:29,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:38:29,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:38:29,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 204 transitions, 1896 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:38:29,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:29,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:38:29,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:30,789 INFO L130 PetriNetUnfolder]: 1920/3909 cut-off events. [2023-08-29 19:38:30,789 INFO L131 PetriNetUnfolder]: For 46171/46179 co-relation queries the response was YES. [2023-08-29 19:38:30,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21934 conditions, 3909 events. 1920/3909 cut-off events. For 46171/46179 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 27857 event pairs, 883 based on Foata normal form. 8/3741 useless extension candidates. Maximal degree in co-relation 21895. Up to 1955 conditions per place. [2023-08-29 19:38:30,824 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 197 selfloop transitions, 3 changer transitions 0/218 dead transitions. [2023-08-29 19:38:30,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 218 transitions, 2454 flow [2023-08-29 19:38:30,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:38:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:38:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2023-08-29 19:38:30,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418238993710692 [2023-08-29 19:38:30,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2023-08-29 19:38:30,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2023-08-29 19:38:30,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:30,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2023-08-29 19:38:30,829 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:38:30,830 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:38:30,831 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:38:30,831 INFO L175 Difference]: Start difference. First operand has 144 places, 204 transitions, 1896 flow. Second operand 3 states and 843 transitions. [2023-08-29 19:38:30,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 218 transitions, 2454 flow [2023-08-29 19:38:30,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 218 transitions, 2229 flow, removed 98 selfloop flow, removed 8 redundant places. [2023-08-29 19:38:30,873 INFO L231 Difference]: Finished difference. Result has 136 places, 200 transitions, 1659 flow [2023-08-29 19:38:30,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1659, PETRI_PLACES=136, PETRI_TRANSITIONS=200} [2023-08-29 19:38:30,874 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 30 predicate places. [2023-08-29 19:38:30,874 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 200 transitions, 1659 flow [2023-08-29 19:38:30,874 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:38:30,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:30,874 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:30,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 19:38:30,875 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:38:30,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2042297759, now seen corresponding path program 1 times [2023-08-29 19:38:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:38:30,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704373355] [2023-08-29 19:38:30,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:30,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:38:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:31,188 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:38:31,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:38:31,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704373355] [2023-08-29 19:38:31,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704373355] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:38:31,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469470336] [2023-08-29 19:38:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:31,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:38:31,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:38:31,190 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:38:31,198 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:38:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:31,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-29 19:38:31,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:31,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:31,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:31,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:31,372 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:38:31,948 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:38:31,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:38:32,315 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:38:32,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469470336] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:38:32,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:38:32,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:38:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187555384] [2023-08-29 19:38:32,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:38:32,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:38:32,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:38:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:38:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:38:36,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-29 19:38:36,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 200 transitions, 1659 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:38:36,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:36,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-29 19:38:36,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:37,881 INFO L130 PetriNetUnfolder]: 1744/3508 cut-off events. [2023-08-29 19:38:37,881 INFO L131 PetriNetUnfolder]: For 49252/49300 co-relation queries the response was YES. [2023-08-29 19:38:37,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23033 conditions, 3508 events. 1744/3508 cut-off events. For 49252/49300 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 21403 event pairs, 638 based on Foata normal form. 221/3627 useless extension candidates. Maximal degree in co-relation 22994. Up to 1448 conditions per place. [2023-08-29 19:38:37,904 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 250 selfloop transitions, 15 changer transitions 0/284 dead transitions. [2023-08-29 19:38:37,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 284 transitions, 3139 flow [2023-08-29 19:38:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:38:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:38:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1906 transitions. [2023-08-29 19:38:37,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281221922731357 [2023-08-29 19:38:37,907 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1906 transitions. [2023-08-29 19:38:37,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1906 transitions. [2023-08-29 19:38:37,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:37,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1906 transitions. [2023-08-29 19:38:37,909 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:38:37,913 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:37,913 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:37,913 INFO L175 Difference]: Start difference. First operand has 136 places, 200 transitions, 1659 flow. Second operand 7 states and 1906 transitions. [2023-08-29 19:38:37,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 284 transitions, 3139 flow [2023-08-29 19:38:37,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 284 transitions, 3038 flow, removed 46 selfloop flow, removed 3 redundant places. [2023-08-29 19:38:37,959 INFO L231 Difference]: Finished difference. Result has 140 places, 192 transitions, 1628 flow [2023-08-29 19:38:37,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1628, PETRI_PLACES=140, PETRI_TRANSITIONS=192} [2023-08-29 19:38:37,960 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 34 predicate places. [2023-08-29 19:38:37,960 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 192 transitions, 1628 flow [2023-08-29 19:38:37,961 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:38:37,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:37,961 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:37,968 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:38,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:38:38,167 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:38:38,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash 152072361, now seen corresponding path program 1 times [2023-08-29 19:38:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:38:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049355149] [2023-08-29 19:38:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:38:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:39,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:38:39,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049355149] [2023-08-29 19:38:39,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049355149] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:38:39,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834447052] [2023-08-29 19:38:39,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:39,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:38:39,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:38:39,353 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:39,355 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:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:39,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 80 conjunts are in the unsatisfiable core [2023-08-29 19:38:39,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:39,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:39,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:39,572 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:38:39,572 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:39,610 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 98 treesize of output 94 [2023-08-29 19:38:39,629 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:38:39,988 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:38:40,173 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:38:40,470 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 38 treesize of output 31 [2023-08-29 19:38:40,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:40,579 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 49 treesize of output 51 [2023-08-29 19:38:40,800 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 60 treesize of output 53 [2023-08-29 19:38:40,949 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 78 treesize of output 73 [2023-08-29 19:38:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:41,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:38:41,189 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_947 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_947) |c_~#queue~0.base|) .cse0) 801))) (forall ((v_ArrVal_947 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_947) |c_~#queue~0.base|) .cse0) 800))))) is different from false [2023-08-29 19:38:41,210 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_947 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_947) |c_~#queue~0.base|) .cse1) 800))) (forall ((v_ArrVal_947 (Array Int Int))) (not (= 801 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_947) |c_~#queue~0.base|) .cse1)))))) is different from false [2023-08-29 19:38:41,228 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_947 (Array Int Int))) (not (= 801 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_947) |c_~#queue~0.base|) .cse1)))) (forall ((v_ArrVal_947 (Array Int Int))) (not (= 800 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_947) |c_~#queue~0.base|) .cse1)))))) is different from false [2023-08-29 19:38:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-29 19:38:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834447052] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:38:41,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:38:41,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2023-08-29 19:38:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094246482] [2023-08-29 19:38:41,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:38:41,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-29 19:38:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:38:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-29 19:38:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=350, Unknown=4, NotChecked=126, Total=600 [2023-08-29 19:38:43,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 636 [2023-08-29 19:38:43,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 192 transitions, 1628 flow. Second operand has 25 states, 25 states have (on average 199.04) internal successors, (4976), 25 states have internal predecessors, (4976), 0 states have call successors, (0), 0 states 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:43,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:43,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 636 [2023-08-29 19:38:43,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:49,456 INFO L130 PetriNetUnfolder]: 1935/3800 cut-off events. [2023-08-29 19:38:49,456 INFO L131 PetriNetUnfolder]: For 48659/48683 co-relation queries the response was YES. [2023-08-29 19:38:49,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24800 conditions, 3800 events. 1935/3800 cut-off events. For 48659/48683 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 23408 event pairs, 984 based on Foata normal form. 32/3708 useless extension candidates. Maximal degree in co-relation 24759. Up to 2655 conditions per place. [2023-08-29 19:38:49,483 INFO L137 encePairwiseOnDemand]: 620/636 looper letters, 172 selfloop transitions, 87 changer transitions 0/264 dead transitions. [2023-08-29 19:38:49,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 264 transitions, 3112 flow [2023-08-29 19:38:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-29 19:38:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-29 19:38:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5473 transitions. [2023-08-29 19:38:49,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31871651525739575 [2023-08-29 19:38:49,490 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 5473 transitions. [2023-08-29 19:38:49,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 5473 transitions. [2023-08-29 19:38:49,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:49,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 5473 transitions. [2023-08-29 19:38:49,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 202.7037037037037) internal successors, (5473), 27 states have internal predecessors, (5473), 0 states have call successors, (0), 0 states 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,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 636.0) internal successors, (17808), 28 states have internal predecessors, (17808), 0 states have call successors, (0), 0 states 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,510 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 636.0) internal successors, (17808), 28 states have internal predecessors, (17808), 0 states have call successors, (0), 0 states 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,510 INFO L175 Difference]: Start difference. First operand has 140 places, 192 transitions, 1628 flow. Second operand 27 states and 5473 transitions. [2023-08-29 19:38:49,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 264 transitions, 3112 flow [2023-08-29 19:38:49,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 264 transitions, 3066 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-29 19:38:49,554 INFO L231 Difference]: Finished difference. Result has 174 places, 213 transitions, 2219 flow [2023-08-29 19:38:49,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2219, PETRI_PLACES=174, PETRI_TRANSITIONS=213} [2023-08-29 19:38:49,555 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 68 predicate places. [2023-08-29 19:38:49,555 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 213 transitions, 2219 flow [2023-08-29 19:38:49,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 199.04) internal successors, (4976), 25 states have internal predecessors, (4976), 0 states have call successors, (0), 0 states 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,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:49,556 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:49,567 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:49,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:38:49,762 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash 576479025, now seen corresponding path program 3 times [2023-08-29 19:38:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:38:49,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134766101] [2023-08-29 19:38:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:38:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:51,902 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:51,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:38:51,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134766101] [2023-08-29 19:38:51,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134766101] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:38:51,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110120430] [2023-08-29 19:38:51,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 19:38:51,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:38:51,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:38:51,904 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:51,906 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:52,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-29 19:38:52,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:38:52,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 93 conjunts are in the unsatisfiable core [2023-08-29 19:38:52,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:52,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:52,276 INFO L321 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2023-08-29 19:38:52,277 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:38:52,361 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-08-29 19:38:52,362 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:38:52,921 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:38:52,985 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 19:38:52,986 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:38:53,215 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 47 treesize of output 42 [2023-08-29 19:38:53,257 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:38:53,924 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 64 treesize of output 55 [2023-08-29 19:38:53,998 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 0 case distinctions, treesize of input 19 treesize of output 14 [2023-08-29 19:38:54,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:54,284 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 76 treesize of output 76 [2023-08-29 19:38:54,628 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 78 [2023-08-29 19:38:54,695 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:38:54,696 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2023-08-29 19:38:55,082 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:38:55,082 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 1 case distinctions, treesize of input 100 treesize of output 104 [2023-08-29 19:38:55,444 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:38:55,966 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 90 treesize of output 83 [2023-08-29 19:38:56,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:56,183 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 150 treesize of output 152 [2023-08-29 19:38:56,362 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:56,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:38:56,696 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1071 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1071 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:38:56,716 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1071 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1071 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1071) |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:39:05,943 WARN L222 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:39:21,810 WARN L222 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:39:32,226 WARN L222 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:39:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-29 19:39:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110120430] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:39:59,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:39:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 40 [2023-08-29 19:39:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670123933] [2023-08-29 19:39:59,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:39:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-08-29 19:39:59,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:39:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-08-29 19:39:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1300, Unknown=24, NotChecked=154, Total=1722 [2023-08-29 19:40:00,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:40:00,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 213 transitions, 2219 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:40:00,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:40:00,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:40:00,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:40:34,801 WARN L222 SmtUtils]: Spent 20.85s on a formula simplification. DAG size of input: 226 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:40:37,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 [0, 1] [2023-08-29 19:40:38,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s 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:40,767 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:42,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s 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:44,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:40:47,118 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:49,277 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:41:00,203 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:41:02,221 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:41:04,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:41:07,422 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:41:31,020 WARN L222 SmtUtils]: Spent 11.45s on a formula simplification. DAG size of input: 178 DAG size of output: 93 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:41:33,736 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:41:35,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:41:37,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:41:40,579 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:42:12,739 WARN L222 SmtUtils]: Spent 17.96s on a formula simplification. DAG size of input: 197 DAG size of output: 97 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:42:14,824 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:43:20,083 WARN L222 SmtUtils]: Spent 53.54s on a formula simplification. DAG size of input: 286 DAG size of output: 148 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:43:22,446 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:43:25,211 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:43:28,361 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:43:30,510 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:43:33,237 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:43:35,322 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:44:46,938 WARN L222 SmtUtils]: Spent 53.71s on a formula simplification. DAG size of input: 267 DAG size of output: 148 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:44:49,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 [0, 1] [2023-08-29 19:44:51,796 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:44:53,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:44:57,725 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:44:59,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:45:00,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:45:16,483 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:45:18,499 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:45:20,518 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:45:22,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:45:24,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:45:26,443 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:45:46,352 WARN L222 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:47:07,069 WARN L222 SmtUtils]: Spent 57.51s on a formula simplification. DAG size of input: 257 DAG size of output: 148 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:47:09,625 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:47:12,459 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:47:13,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:47:15,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:47:18,025 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:47:20,032 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:47:22,202 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:47:25,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:47:27,836 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:47:59,144 WARN L222 SmtUtils]: Spent 10.44s on a formula simplification. DAG size of input: 111 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:48:02,082 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:48:03,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:48:05,829 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:48:07,835 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:48:09,840 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:48:11,848 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:48:14,095 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:48:16,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:48:21,680 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:48:23,775 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:48:26,711 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:48:29,564 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:49:25,648 WARN L222 SmtUtils]: Spent 24.99s on a formula simplification. DAG size of input: 88 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:49:44,899 WARN L222 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:50:31,060 WARN L222 SmtUtils]: Spent 30.64s on a formula simplification. DAG size of input: 101 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:50:32,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:50:34,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:50:37,117 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] Killed by 15