./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.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-complex/workstealqueue_mutex-2.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 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f --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 21:06:37,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 21:06:37,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 21:06:37,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 21:06:37,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 21:06:37,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 21:06:37,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 21:06:37,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 21:06:37,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 21:06:37,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 21:06:37,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 21:06:37,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 21:06:37,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 21:06:37,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 21:06:37,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 21:06:37,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 21:06:37,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 21:06:37,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 21:06:37,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 21:06:37,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 21:06:37,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 21:06:37,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 21:06:37,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 21:06:37,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 21:06:37,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 21:06:37,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 21:06:37,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 21:06:37,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 21:06:37,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 21:06:37,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 21:06:37,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 21:06:37,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 21:06:37,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 21:06:37,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 21:06:37,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 21:06:37,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 21:06:37,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 21:06:37,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 21:06:37,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 21:06:37,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 21:06:37,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 21:06:37,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 21:06:37,541 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 21:06:37,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 21:06:37,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 21:06:37,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 21:06:37,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 21:06:37,543 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 21:06:37,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 21:06:37,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 21:06:37,544 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 21:06:37,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 21:06:37,545 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 21:06:37,545 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 21:06:37,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 21:06:37,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 21:06:37,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 21:06:37,546 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 21:06:37,546 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 21:06:37,546 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 21:06:37,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 21:06:37,546 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 21:06:37,546 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 21:06:37,546 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 21:06:37,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 21:06:37,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 21:06:37,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 21:06:37,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:06:37,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 21:06:37,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 21:06:37,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 21:06:37,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 21:06:37,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 21:06:37,548 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 21:06:37,548 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 21:06:37,548 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 21:06:37,548 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 -> 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f 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 21:06:37,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 21:06:37,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 21:06:37,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 21:06:37,815 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 21:06:37,815 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 21:06:37,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-08-29 21:06:38,687 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 21:06:38,965 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 21:06:38,966 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-08-29 21:06:38,989 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/949e64ff7/7b792a2d73e2434c9bad55e111ea0d55/FLAGb8174521e [2023-08-29 21:06:39,000 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/949e64ff7/7b792a2d73e2434c9bad55e111ea0d55 [2023-08-29 21:06:39,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 21:06:39,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 21:06:39,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 21:06:39,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 21:06:39,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 21:06:39,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc6ad43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39, skipping insertion in model container [2023-08-29 21:06:39,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 21:06:39,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 21:06:39,495 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-complex/workstealqueue_mutex-2.i[76469,76482] [2023-08-29 21:06:39,529 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-complex/workstealqueue_mutex-2.i[79042,79055] [2023-08-29 21:06:39,532 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-complex/workstealqueue_mutex-2.i[79451,79464] [2023-08-29 21:06:39,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:06:39,553 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 21:06:39,585 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-complex/workstealqueue_mutex-2.i[76469,76482] [2023-08-29 21:06:39,604 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-complex/workstealqueue_mutex-2.i[79042,79055] [2023-08-29 21:06:39,610 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-complex/workstealqueue_mutex-2.i[79451,79464] [2023-08-29 21:06:39,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:06:39,699 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 21:06:39,699 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 21:06:39,703 INFO L208 MainTranslator]: Completed translation [2023-08-29 21:06:39,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39 WrapperNode [2023-08-29 21:06:39,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 21:06:39,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 21:06:39,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 21:06:39,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 21:06:39,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,801 INFO L138 Inliner]: procedures = 489, calls = 127, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1831 [2023-08-29 21:06:39,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 21:06:39,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 21:06:39,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 21:06:39,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 21:06:39,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,890 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 21:06:39,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 21:06:39,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 21:06:39,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 21:06:39,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (1/1) ... [2023-08-29 21:06:39,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:06:39,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:06:39,950 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 21:06:39,961 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 21:06:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2023-08-29 21:06:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2023-08-29 21:06:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 21:06:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 21:06:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 21:06:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 21:06:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 21:06:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 21:06:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-29 21:06:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 21:06:39,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 21:06:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 21:06:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-29 21:06:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 21:06:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 21:06:39,989 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 21:06:40,246 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 21:06:40,247 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 21:06:41,855 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 21:06:42,285 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 21:06:42,285 INFO L302 CfgBuilder]: Removed 11 assume(true) statements. [2023-08-29 21:06:42,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:06:42 BoogieIcfgContainer [2023-08-29 21:06:42,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 21:06:42,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 21:06:42,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 21:06:42,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 21:06:42,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 09:06:39" (1/3) ... [2023-08-29 21:06:42,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c83d11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:06:42, skipping insertion in model container [2023-08-29 21:06:42,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:06:39" (2/3) ... [2023-08-29 21:06:42,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c83d11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:06:42, skipping insertion in model container [2023-08-29 21:06:42,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:06:42" (3/3) ... [2023-08-29 21:06:42,293 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2023-08-29 21:06:42,304 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 21:06:42,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 520 error locations. [2023-08-29 21:06:42,305 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 21:06:42,449 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 21:06:42,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2034 places, 2101 transitions, 4210 flow [2023-08-29 21:06:43,252 INFO L130 PetriNetUnfolder]: 131/3918 cut-off events. [2023-08-29 21:06:43,252 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:06:43,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 3918 events. 131/3918 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 22055 event pairs, 0 based on Foata normal form. 0/2804 useless extension candidates. Maximal degree in co-relation 2006. Up to 6 conditions per place. [2023-08-29 21:06:43,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 2034 places, 2101 transitions, 4210 flow [2023-08-29 21:06:43,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 2034 places, 2101 transitions, 4210 flow [2023-08-29 21:06:43,339 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 21:06:43,345 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 2034 places, 2101 transitions, 4210 flow [2023-08-29 21:06:43,346 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 2034 places, 2101 transitions, 4210 flow [2023-08-29 21:06:43,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2034 places, 2101 transitions, 4210 flow [2023-08-29 21:06:44,032 INFO L130 PetriNetUnfolder]: 131/3918 cut-off events. [2023-08-29 21:06:44,032 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:06:44,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 3918 events. 131/3918 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 22055 event pairs, 0 based on Foata normal form. 0/2804 useless extension candidates. Maximal degree in co-relation 2006. Up to 6 conditions per place. [2023-08-29 21:06:44,166 INFO L119 LiptonReduction]: Number of co-enabled transitions 670864 [2023-08-29 21:08:41,158 WARN L222 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 247 DAG size of output: 236 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-29 21:08:49,150 WARN L222 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 250 DAG size of output: 239 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-29 21:08:52,824 INFO L134 LiptonReduction]: Checked pairs total: 1696250 [2023-08-29 21:08:52,824 INFO L136 LiptonReduction]: Total number of compositions: 2622 [2023-08-29 21:08:52,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 21:08:52,837 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;@3e3d7bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 21:08:52,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 564 error locations. [2023-08-29 21:08:52,838 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 21:08:52,838 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:08:52,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:08:52,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 21:08:52,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:08:52,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:08:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash 8597, now seen corresponding path program 1 times [2023-08-29 21:08:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:08:52,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119093138] [2023-08-29 21:08:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:08:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:08:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:08:53,160 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 21:08:53,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:08:53,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119093138] [2023-08-29 21:08:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119093138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:08:53,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:08:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 21:08:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082400066] [2023-08-29 21:08:53,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:08:53,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 21:08:53,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:08:53,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 21:08:53,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 21:08:53,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1796 out of 4723 [2023-08-29 21:08:53,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 782 transitions, 1572 flow. Second operand has 2 states, 2 states have (on average 1796.5) internal successors, (3593), 2 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states 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 21:08:53,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:08:53,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1796 of 4723 [2023-08-29 21:08:53,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:08:56,980 INFO L130 PetriNetUnfolder]: 21269/43694 cut-off events. [2023-08-29 21:08:56,981 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:08:57,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84905 conditions, 43694 events. 21269/43694 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 382380 event pairs, 18984 based on Foata normal form. 497/19499 useless extension candidates. Maximal degree in co-relation 83890. Up to 41205 conditions per place. [2023-08-29 21:08:57,124 INFO L137 encePairwiseOnDemand]: 4523/4723 looper letters, 526 selfloop transitions, 0 changer transitions 0/582 dead transitions. [2023-08-29 21:08:57,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 582 transitions, 2224 flow [2023-08-29 21:08:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 21:08:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 21:08:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4318 transitions. [2023-08-29 21:08:57,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45712470887148 [2023-08-29 21:08:57,146 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 4318 transitions. [2023-08-29 21:08:57,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 4318 transitions. [2023-08-29 21:08:57,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:08:57,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 4318 transitions. [2023-08-29 21:08:57,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 2159.0) internal successors, (4318), 2 states have internal predecessors, (4318), 0 states have call successors, (0), 0 states 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 21:08:57,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 4723.0) internal successors, (14169), 3 states have internal predecessors, (14169), 0 states have call successors, (0), 0 states 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 21:08:57,183 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 4723.0) internal successors, (14169), 3 states have internal predecessors, (14169), 0 states have call successors, (0), 0 states 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 21:08:57,184 INFO L175 Difference]: Start difference. First operand has 757 places, 782 transitions, 1572 flow. Second operand 2 states and 4318 transitions. [2023-08-29 21:08:57,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 582 transitions, 2224 flow [2023-08-29 21:08:57,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 582 transitions, 2224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:08:57,200 INFO L231 Difference]: Finished difference. Result has 560 places, 582 transitions, 1172 flow [2023-08-29 21:08:57,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1172, PETRI_PLACES=560, PETRI_TRANSITIONS=582} [2023-08-29 21:08:57,206 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -197 predicate places. [2023-08-29 21:08:57,207 INFO L495 AbstractCegarLoop]: Abstraction has has 560 places, 582 transitions, 1172 flow [2023-08-29 21:08:57,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1796.5) internal successors, (3593), 2 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states 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 21:08:57,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:08:57,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 21:08:57,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 21:08:57,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:08:57,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:08:57,211 INFO L85 PathProgramCache]: Analyzing trace with hash 275360, now seen corresponding path program 1 times [2023-08-29 21:08:57,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:08:57,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879622874] [2023-08-29 21:08:57,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:08:57,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:08:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:08:57,491 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 21:08:57,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:08:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879622874] [2023-08-29 21:08:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879622874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:08:57,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:08:57,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 21:08:57,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499502155] [2023-08-29 21:08:57,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:08:57,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:08:57,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:08:57,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:08:57,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:08:57,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1768 out of 4723 [2023-08-29 21:08:57,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 582 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 1768.6666666666667) internal successors, (5306), 3 states have internal predecessors, (5306), 0 states have call successors, (0), 0 states 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 21:08:57,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:08:57,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1768 of 4723 [2023-08-29 21:08:57,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:01,489 INFO L130 PetriNetUnfolder]: 21732/44615 cut-off events. [2023-08-29 21:09:01,489 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:09:01,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86708 conditions, 44615 events. 21732/44615 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 391690 event pairs, 12872 based on Foata normal form. 0/19425 useless extension candidates. Maximal degree in co-relation 86704. Up to 41290 conditions per place. [2023-08-29 21:09:01,637 INFO L137 encePairwiseOnDemand]: 4715/4723 looper letters, 568 selfloop transitions, 6 changer transitions 0/630 dead transitions. [2023-08-29 21:09:01,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 630 transitions, 2416 flow [2023-08-29 21:09:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:09:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:09:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5880 transitions. [2023-08-29 21:09:01,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.414990472157527 [2023-08-29 21:09:01,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5880 transitions. [2023-08-29 21:09:01,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5880 transitions. [2023-08-29 21:09:01,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:01,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5880 transitions. [2023-08-29 21:09:01,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1960.0) internal successors, (5880), 3 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states 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 21:09:01,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 4723.0) internal successors, (18892), 4 states have internal predecessors, (18892), 0 states have call successors, (0), 0 states 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 21:09:01,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 4723.0) internal successors, (18892), 4 states have internal predecessors, (18892), 0 states have call successors, (0), 0 states 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 21:09:01,695 INFO L175 Difference]: Start difference. First operand has 560 places, 582 transitions, 1172 flow. Second operand 3 states and 5880 transitions. [2023-08-29 21:09:01,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 630 transitions, 2416 flow [2023-08-29 21:09:01,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 630 transitions, 2416 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:09:01,704 INFO L231 Difference]: Finished difference. Result has 562 places, 586 transitions, 1210 flow [2023-08-29 21:09:01,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=562, PETRI_TRANSITIONS=586} [2023-08-29 21:09:01,705 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -195 predicate places. [2023-08-29 21:09:01,705 INFO L495 AbstractCegarLoop]: Abstraction has has 562 places, 586 transitions, 1210 flow [2023-08-29 21:09:01,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1768.6666666666667) internal successors, (5306), 3 states have internal predecessors, (5306), 0 states have call successors, (0), 0 states 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 21:09:01,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:01,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 21:09:01,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 21:09:01,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:01,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:01,708 INFO L85 PathProgramCache]: Analyzing trace with hash 275358, now seen corresponding path program 1 times [2023-08-29 21:09:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:01,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302702077] [2023-08-29 21:09:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:01,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:01,930 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 21:09:01,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:01,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302702077] [2023-08-29 21:09:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302702077] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:01,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:01,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 21:09:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866403939] [2023-08-29 21:09:01,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:01,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:09:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:01,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:09:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:09:02,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1754 out of 4723 [2023-08-29 21:09:02,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 586 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 1754.6666666666667) internal successors, (5264), 3 states have internal predecessors, (5264), 0 states have call successors, (0), 0 states 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 21:09:02,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:02,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1754 of 4723 [2023-08-29 21:09:02,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:06,454 INFO L130 PetriNetUnfolder]: 22241/45583 cut-off events. [2023-08-29 21:09:06,454 INFO L131 PetriNetUnfolder]: For 1004/1004 co-relation queries the response was YES. [2023-08-29 21:09:06,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89977 conditions, 45583 events. 22241/45583 cut-off events. For 1004/1004 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 398825 event pairs, 19309 based on Foata normal form. 0/20634 useless extension candidates. Maximal degree in co-relation 89971. Up to 43081 conditions per place. [2023-08-29 21:09:06,624 INFO L137 encePairwiseOnDemand]: 4719/4723 looper letters, 530 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2023-08-29 21:09:06,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 587 transitions, 2276 flow [2023-08-29 21:09:06,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:09:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:09:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5791 transitions. [2023-08-29 21:09:06,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4087091537864352 [2023-08-29 21:09:06,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5791 transitions. [2023-08-29 21:09:06,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5791 transitions. [2023-08-29 21:09:06,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:06,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5791 transitions. [2023-08-29 21:09:06,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1930.3333333333333) internal successors, (5791), 3 states have internal predecessors, (5791), 0 states have call successors, (0), 0 states 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 21:09:06,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 4723.0) internal successors, (18892), 4 states have internal predecessors, (18892), 0 states have call successors, (0), 0 states 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 21:09:06,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 4723.0) internal successors, (18892), 4 states have internal predecessors, (18892), 0 states have call successors, (0), 0 states 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 21:09:06,661 INFO L175 Difference]: Start difference. First operand has 562 places, 586 transitions, 1210 flow. Second operand 3 states and 5791 transitions. [2023-08-29 21:09:06,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 587 transitions, 2276 flow [2023-08-29 21:09:06,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 587 transitions, 2270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:09:06,673 INFO L231 Difference]: Finished difference. Result has 564 places, 587 transitions, 1218 flow [2023-08-29 21:09:06,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1218, PETRI_PLACES=564, PETRI_TRANSITIONS=587} [2023-08-29 21:09:06,675 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -193 predicate places. [2023-08-29 21:09:06,675 INFO L495 AbstractCegarLoop]: Abstraction has has 564 places, 587 transitions, 1218 flow [2023-08-29 21:09:06,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1754.6666666666667) internal successors, (5264), 3 states have internal predecessors, (5264), 0 states have call successors, (0), 0 states 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 21:09:06,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:06,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 21:09:06,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 21:09:06,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:06,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:06,677 INFO L85 PathProgramCache]: Analyzing trace with hash 8558744, now seen corresponding path program 1 times [2023-08-29 21:09:06,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:06,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995778425] [2023-08-29 21:09:06,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:06,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:06,908 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 21:09:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:06,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995778425] [2023-08-29 21:09:06,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995778425] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:09:06,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334555437] [2023-08-29 21:09:06,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:06,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:09:06,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:09:06,912 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 21:09:06,913 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 21:09:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:07,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-29 21:09:07,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:09:07,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:09:07,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-29 21:09:07,163 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 21:09:07,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:09:07,217 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 21:09:07,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334555437] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:09:07,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:09:07,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2023-08-29 21:09:07,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387295116] [2023-08-29 21:09:07,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:09:07,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 21:09:07,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:07,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 21:09:07,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:09:09,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1746 out of 4723 [2023-08-29 21:09:09,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 587 transitions, 1218 flow. Second operand has 8 states, 8 states have (on average 1747.125) internal successors, (13977), 8 states have internal predecessors, (13977), 0 states have call successors, (0), 0 states 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 21:09:09,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:09,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1746 of 4723 [2023-08-29 21:09:09,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:13,490 INFO L130 PetriNetUnfolder]: 22246/45646 cut-off events. [2023-08-29 21:09:13,490 INFO L131 PetriNetUnfolder]: For 1007/1007 co-relation queries the response was YES. [2023-08-29 21:09:13,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90011 conditions, 45646 events. 22246/45646 cut-off events. For 1007/1007 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 400071 event pairs, 19254 based on Foata normal form. 0/20665 useless extension candidates. Maximal degree in co-relation 90004. Up to 43027 conditions per place. [2023-08-29 21:09:13,651 INFO L137 encePairwiseOnDemand]: 4715/4723 looper letters, 574 selfloop transitions, 11 changer transitions 0/640 dead transitions. [2023-08-29 21:09:13,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 640 transitions, 2512 flow [2023-08-29 21:09:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:09:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:09:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11058 transitions. [2023-08-29 21:09:13,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39021808172771544 [2023-08-29 21:09:13,668 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 11058 transitions. [2023-08-29 21:09:13,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 11058 transitions. [2023-08-29 21:09:13,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:13,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 11058 transitions. [2023-08-29 21:09:13,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1843.0) internal successors, (11058), 6 states have internal predecessors, (11058), 0 states have call successors, (0), 0 states 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 21:09:13,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 4723.0) internal successors, (33061), 7 states have internal predecessors, (33061), 0 states have call successors, (0), 0 states 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 21:09:13,709 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 4723.0) internal successors, (33061), 7 states have internal predecessors, (33061), 0 states have call successors, (0), 0 states 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 21:09:13,709 INFO L175 Difference]: Start difference. First operand has 564 places, 587 transitions, 1218 flow. Second operand 6 states and 11058 transitions. [2023-08-29 21:09:13,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 640 transitions, 2512 flow [2023-08-29 21:09:13,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 640 transitions, 2508 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 21:09:13,719 INFO L231 Difference]: Finished difference. Result has 571 places, 595 transitions, 1290 flow [2023-08-29 21:09:13,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1290, PETRI_PLACES=571, PETRI_TRANSITIONS=595} [2023-08-29 21:09:13,720 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -186 predicate places. [2023-08-29 21:09:13,720 INFO L495 AbstractCegarLoop]: Abstraction has has 571 places, 595 transitions, 1290 flow [2023-08-29 21:09:13,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1747.125) internal successors, (13977), 8 states have internal predecessors, (13977), 0 states have call successors, (0), 0 states 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 21:09:13,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:13,723 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2023-08-29 21:09:13,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-29 21:09:13,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:09:13,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:13,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash -364298982, now seen corresponding path program 1 times [2023-08-29 21:09:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207334669] [2023-08-29 21:09:13,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:09:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:13,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207334669] [2023-08-29 21:09:13,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207334669] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:09:13,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415451906] [2023-08-29 21:09:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:13,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:09:13,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:09:13,996 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 21:09:13,998 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 21:09:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:14,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 21:09:14,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:09:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:09:14,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:09:14,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:09:14,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415451906] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:09:14,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:09:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-08-29 21:09:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447081829] [2023-08-29 21:09:14,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:09:14,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:09:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:14,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:09:14,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:09:14,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1770 out of 4723 [2023-08-29 21:09:14,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 595 transitions, 1290 flow. Second operand has 7 states, 7 states have (on average 1771.4285714285713) internal successors, (12400), 7 states have internal predecessors, (12400), 0 states have call successors, (0), 0 states 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 21:09:14,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:14,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1770 of 4723 [2023-08-29 21:09:14,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:14,591 INFO L130 PetriNetUnfolder]: 233/555 cut-off events. [2023-08-29 21:09:14,591 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 21:09:14,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 555 events. 233/555 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2417 event pairs, 147 based on Foata normal form. 1/275 useless extension candidates. Maximal degree in co-relation 1128. Up to 445 conditions per place. [2023-08-29 21:09:14,592 INFO L137 encePairwiseOnDemand]: 4717/4723 looper letters, 102 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2023-08-29 21:09:14,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 119 transitions, 531 flow [2023-08-29 21:09:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:09:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:09:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10730 transitions. [2023-08-29 21:09:14,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786435175382878 [2023-08-29 21:09:14,611 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 10730 transitions. [2023-08-29 21:09:14,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 10730 transitions. [2023-08-29 21:09:14,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:14,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 10730 transitions. [2023-08-29 21:09:14,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1788.3333333333333) internal successors, (10730), 6 states have internal predecessors, (10730), 0 states have call successors, (0), 0 states 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 21:09:14,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 4723.0) internal successors, (33061), 7 states have internal predecessors, (33061), 0 states have call successors, (0), 0 states 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 21:09:14,647 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 4723.0) internal successors, (33061), 7 states have internal predecessors, (33061), 0 states have call successors, (0), 0 states 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 21:09:14,647 INFO L175 Difference]: Start difference. First operand has 571 places, 595 transitions, 1290 flow. Second operand 6 states and 10730 transitions. [2023-08-29 21:09:14,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 119 transitions, 531 flow [2023-08-29 21:09:14,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 119 transitions, 507 flow, removed 11 selfloop flow, removed 1 redundant places. [2023-08-29 21:09:14,650 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 195 flow [2023-08-29 21:09:14,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2023-08-29 21:09:14,651 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -678 predicate places. [2023-08-29 21:09:14,651 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 195 flow [2023-08-29 21:09:14,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1771.4285714285713) internal successors, (12400), 7 states have internal predecessors, (12400), 0 states have call successors, (0), 0 states 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 21:09:14,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:14,652 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-29 21:09:14,660 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 21:09:14,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:09:14,860 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:14,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1592959518, now seen corresponding path program 2 times [2023-08-29 21:09:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:14,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396428970] [2023-08-29 21:09:14,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:14,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:09:14,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:14,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396428970] [2023-08-29 21:09:14,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396428970] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:09:14,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376639565] [2023-08-29 21:09:14,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:09:14,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:09:14,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:09:14,967 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 21:09:14,969 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 21:09:15,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:09:15,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:09:15,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-29 21:09:15,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:09:15,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:09:15,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-29 21:09:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:09:15,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:09:15,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376639565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:15,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:09:15,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2023-08-29 21:09:15,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227575422] [2023-08-29 21:09:15,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:15,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:09:15,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:15,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:09:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-08-29 21:09:16,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1744 out of 4723 [2023-08-29 21:09:16,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 1744.857142857143) internal successors, (12214), 7 states have internal predecessors, (12214), 0 states have call successors, (0), 0 states 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 21:09:16,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:16,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1744 of 4723 [2023-08-29 21:09:16,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:16,782 INFO L130 PetriNetUnfolder]: 240/569 cut-off events. [2023-08-29 21:09:16,782 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-08-29 21:09:16,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 569 events. 240/569 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2504 event pairs, 216 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 1195. Up to 516 conditions per place. [2023-08-29 21:09:16,784 INFO L137 encePairwiseOnDemand]: 4717/4723 looper letters, 58 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2023-08-29 21:09:16,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 329 flow [2023-08-29 21:09:16,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 21:09:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 21:09:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12275 transitions. [2023-08-29 21:09:16,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3712833852575542 [2023-08-29 21:09:16,801 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 12275 transitions. [2023-08-29 21:09:16,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 12275 transitions. [2023-08-29 21:09:16,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:16,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 12275 transitions. [2023-08-29 21:09:16,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 1753.5714285714287) internal successors, (12275), 7 states have internal predecessors, (12275), 0 states have call successors, (0), 0 states 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 21:09:16,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 4723.0) internal successors, (37784), 8 states have internal predecessors, (37784), 0 states have call successors, (0), 0 states 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 21:09:16,839 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 4723.0) internal successors, (37784), 8 states have internal predecessors, (37784), 0 states have call successors, (0), 0 states 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 21:09:16,840 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 195 flow. Second operand 7 states and 12275 transitions. [2023-08-29 21:09:16,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 329 flow [2023-08-29 21:09:16,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 75 transitions, 302 flow, removed 2 selfloop flow, removed 9 redundant places. [2023-08-29 21:09:16,841 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 181 flow [2023-08-29 21:09:16,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2023-08-29 21:09:16,842 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -681 predicate places. [2023-08-29 21:09:16,842 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 181 flow [2023-08-29 21:09:16,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1744.857142857143) internal successors, (12214), 7 states have internal predecessors, (12214), 0 states have call successors, (0), 0 states 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 21:09:16,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:16,844 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:09:16,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-29 21:09:17,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:09:17,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:17,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2137085402, now seen corresponding path program 2 times [2023-08-29 21:09:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:17,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800475430] [2023-08-29 21:09:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:17,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:17,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800475430] [2023-08-29 21:09:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800475430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:17,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:17,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:09:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798857592] [2023-08-29 21:09:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:17,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 21:09:17,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 21:09:17,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 21:09:17,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1747 out of 4723 [2023-08-29 21:09:17,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 1748.0) internal successors, (6992), 4 states have internal predecessors, (6992), 0 states have call successors, (0), 0 states 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 21:09:17,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:17,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1747 of 4723 [2023-08-29 21:09:17,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:17,873 INFO L130 PetriNetUnfolder]: 240/567 cut-off events. [2023-08-29 21:09:17,873 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-08-29 21:09:17,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 567 events. 240/567 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2477 event pairs, 216 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 1193. Up to 516 conditions per place. [2023-08-29 21:09:17,875 INFO L137 encePairwiseOnDemand]: 4717/4723 looper letters, 60 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2023-08-29 21:09:17,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 74 transitions, 323 flow [2023-08-29 21:09:17,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:09:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:09:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7051 transitions. [2023-08-29 21:09:17,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3732267626508575 [2023-08-29 21:09:17,885 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 7051 transitions. [2023-08-29 21:09:17,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 7051 transitions. [2023-08-29 21:09:17,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:17,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 7051 transitions. [2023-08-29 21:09:17,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 1762.75) internal successors, (7051), 4 states have internal predecessors, (7051), 0 states have call successors, (0), 0 states 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 21:09:17,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 4723.0) internal successors, (23615), 5 states have internal predecessors, (23615), 0 states have call successors, (0), 0 states 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 21:09:17,906 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 4723.0) internal successors, (23615), 5 states have internal predecessors, (23615), 0 states have call successors, (0), 0 states 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 21:09:17,906 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 181 flow. Second operand 4 states and 7051 transitions. [2023-08-29 21:09:17,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 74 transitions, 323 flow [2023-08-29 21:09:17,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 74 transitions, 311 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 21:09:17,908 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 188 flow [2023-08-29 21:09:17,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-08-29 21:09:17,909 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -682 predicate places. [2023-08-29 21:09:17,909 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 188 flow [2023-08-29 21:09:17,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1748.0) internal successors, (6992), 4 states have internal predecessors, (6992), 0 states have call successors, (0), 0 states 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 21:09:17,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:17,910 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:09:17,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 21:09:17,910 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:17,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2137085400, now seen corresponding path program 1 times [2023-08-29 21:09:17,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:17,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933126117] [2023-08-29 21:09:17,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:17,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:17,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933126117] [2023-08-29 21:09:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933126117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:17,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:17,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 21:09:17,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186840328] [2023-08-29 21:09:17,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:17,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:09:17,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:17,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:09:17,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:09:18,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1761 out of 4723 [2023-08-29 21:09:18,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 1762.3333333333333) internal successors, (5287), 3 states have internal predecessors, (5287), 0 states have call successors, (0), 0 states 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 21:09:18,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:18,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1761 of 4723 [2023-08-29 21:09:18,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:18,508 INFO L130 PetriNetUnfolder]: 221/606 cut-off events. [2023-08-29 21:09:18,508 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2023-08-29 21:09:18,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 606 events. 221/606 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3109 event pairs, 70 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 1316. Up to 359 conditions per place. [2023-08-29 21:09:18,510 INFO L137 encePairwiseOnDemand]: 4716/4723 looper letters, 99 selfloop transitions, 7 changer transitions 1/116 dead transitions. [2023-08-29 21:09:18,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 116 transitions, 504 flow [2023-08-29 21:09:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:09:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:09:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5384 transitions. [2023-08-29 21:09:18,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3799844731455995 [2023-08-29 21:09:18,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5384 transitions. [2023-08-29 21:09:18,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5384 transitions. [2023-08-29 21:09:18,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:18,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5384 transitions. [2023-08-29 21:09:18,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1794.6666666666667) internal successors, (5384), 3 states have internal predecessors, (5384), 0 states have call successors, (0), 0 states 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 21:09:18,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 4723.0) internal successors, (18892), 4 states have internal predecessors, (18892), 0 states have call successors, (0), 0 states 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 21:09:18,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 4723.0) internal successors, (18892), 4 states have internal predecessors, (18892), 0 states have call successors, (0), 0 states 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 21:09:18,554 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 188 flow. Second operand 3 states and 5384 transitions. [2023-08-29 21:09:18,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 116 transitions, 504 flow [2023-08-29 21:09:18,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 116 transitions, 492 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:09:18,556 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 226 flow [2023-08-29 21:09:18,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-08-29 21:09:18,558 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -681 predicate places. [2023-08-29 21:09:18,558 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 226 flow [2023-08-29 21:09:18,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1762.3333333333333) internal successors, (5287), 3 states have internal predecessors, (5287), 0 states have call successors, (0), 0 states 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 21:09:18,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:18,559 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:18,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 21:09:18,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:18,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1616945726, now seen corresponding path program 1 times [2023-08-29 21:09:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:18,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193196786] [2023-08-29 21:09:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:18,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:18,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:18,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193196786] [2023-08-29 21:09:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193196786] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:09:18,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178873940] [2023-08-29 21:09:18,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:18,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:09:18,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:09:18,699 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 21:09:18,702 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 21:09:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:18,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 21:09:18,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:09:18,860 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 6 treesize of output 5 [2023-08-29 21:09:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:18,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:09:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:18,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178873940] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:09:18,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:09:18,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-29 21:09:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412989563] [2023-08-29 21:09:18,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:09:18,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 21:09:18,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:18,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 21:09:18,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-29 21:09:20,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1739 out of 4723 [2023-08-29 21:09:20,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 226 flow. Second operand has 9 states, 9 states have (on average 1740.7777777777778) internal successors, (15667), 9 states have internal predecessors, (15667), 0 states have call successors, (0), 0 states 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 21:09:20,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:20,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1739 of 4723 [2023-08-29 21:09:20,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:20,958 INFO L130 PetriNetUnfolder]: 229/697 cut-off events. [2023-08-29 21:09:20,959 INFO L131 PetriNetUnfolder]: For 330/330 co-relation queries the response was YES. [2023-08-29 21:09:20,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1706 conditions, 697 events. 229/697 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4039 event pairs, 94 based on Foata normal form. 1/476 useless extension candidates. Maximal degree in co-relation 1697. Up to 458 conditions per place. [2023-08-29 21:09:20,961 INFO L137 encePairwiseOnDemand]: 4714/4723 looper letters, 102 selfloop transitions, 12 changer transitions 1/123 dead transitions. [2023-08-29 21:09:20,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 123 transitions, 592 flow [2023-08-29 21:09:20,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:09:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:09:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10541 transitions. [2023-08-29 21:09:20,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3719740278071847 [2023-08-29 21:09:20,970 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 10541 transitions. [2023-08-29 21:09:20,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 10541 transitions. [2023-08-29 21:09:20,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:20,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 10541 transitions. [2023-08-29 21:09:20,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1756.8333333333333) internal successors, (10541), 6 states have internal predecessors, (10541), 0 states have call successors, (0), 0 states 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 21:09:20,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 4723.0) internal successors, (33061), 7 states have internal predecessors, (33061), 0 states have call successors, (0), 0 states 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 21:09:21,000 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 4723.0) internal successors, (33061), 7 states have internal predecessors, (33061), 0 states have call successors, (0), 0 states 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 21:09:21,001 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 226 flow. Second operand 6 states and 10541 transitions. [2023-08-29 21:09:21,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 123 transitions, 592 flow [2023-08-29 21:09:21,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 123 transitions, 562 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 21:09:21,004 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 271 flow [2023-08-29 21:09:21,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2023-08-29 21:09:21,004 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -675 predicate places. [2023-08-29 21:09:21,004 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 271 flow [2023-08-29 21:09:21,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1740.7777777777778) internal successors, (15667), 9 states have internal predecessors, (15667), 0 states have call successors, (0), 0 states 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 21:09:21,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:21,006 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:21,024 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 21:09:21,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:09:21,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:21,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1414063089, now seen corresponding path program 1 times [2023-08-29 21:09:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:21,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838485271] [2023-08-29 21:09:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:21,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:21,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:21,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838485271] [2023-08-29 21:09:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838485271] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:09:21,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324414233] [2023-08-29 21:09:21,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:21,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:09:21,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:09:21,395 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 21:09:21,397 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 21:09:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:21,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-29 21:09:21,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:09:21,569 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 6 treesize of output 5 [2023-08-29 21:09:21,576 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 6 treesize of output 5 [2023-08-29 21:09:21,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:09:21,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-29 21:09:21,666 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:09:21,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:09:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:21,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:09:27,795 WARN L222 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:09:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:27,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324414233] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:09:27,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:09:27,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-29 21:09:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726992206] [2023-08-29 21:09:27,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:09:27,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 21:09:27,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 21:09:27,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-08-29 21:09:37,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1708 out of 4723 [2023-08-29 21:09:37,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 271 flow. Second operand has 14 states, 14 states have (on average 1709.7142857142858) internal successors, (23936), 14 states have internal predecessors, (23936), 0 states have call successors, (0), 0 states 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 21:09:37,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:37,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1708 of 4723 [2023-08-29 21:09:37,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:37,537 INFO L130 PetriNetUnfolder]: 259/795 cut-off events. [2023-08-29 21:09:37,537 INFO L131 PetriNetUnfolder]: For 843/843 co-relation queries the response was YES. [2023-08-29 21:09:37,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2148 conditions, 795 events. 259/795 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4353 event pairs, 55 based on Foata normal form. 17/540 useless extension candidates. Maximal degree in co-relation 2137. Up to 415 conditions per place. [2023-08-29 21:09:37,540 INFO L137 encePairwiseOnDemand]: 4711/4723 looper letters, 165 selfloop transitions, 25 changer transitions 1/199 dead transitions. [2023-08-29 21:09:37,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 199 transitions, 981 flow [2023-08-29 21:09:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 21:09:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 21:09:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13844 transitions. [2023-08-29 21:09:37,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663984755452043 [2023-08-29 21:09:37,550 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 13844 transitions. [2023-08-29 21:09:37,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 13844 transitions. [2023-08-29 21:09:37,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:37,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 13844 transitions. [2023-08-29 21:09:37,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 1730.5) internal successors, (13844), 8 states have internal predecessors, (13844), 0 states have call successors, (0), 0 states 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 21:09:37,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 4723.0) internal successors, (42507), 9 states have internal predecessors, (42507), 0 states have call successors, (0), 0 states 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 21:09:37,581 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 4723.0) internal successors, (42507), 9 states have internal predecessors, (42507), 0 states have call successors, (0), 0 states 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 21:09:37,582 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 271 flow. Second operand 8 states and 13844 transitions. [2023-08-29 21:09:37,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 199 transitions, 981 flow [2023-08-29 21:09:37,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 199 transitions, 966 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-29 21:09:37,585 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 440 flow [2023-08-29 21:09:37,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=440, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2023-08-29 21:09:37,586 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -668 predicate places. [2023-08-29 21:09:37,586 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 440 flow [2023-08-29 21:09:37,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1709.7142857142858) internal successors, (23936), 14 states have internal predecessors, (23936), 0 states have call successors, (0), 0 states 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 21:09:37,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:37,588 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:37,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-29 21:09:37,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-29 21:09:37,795 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:37,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:37,795 INFO L85 PathProgramCache]: Analyzing trace with hash -892400211, now seen corresponding path program 1 times [2023-08-29 21:09:37,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:37,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908909046] [2023-08-29 21:09:37,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:37,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:37,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:37,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908909046] [2023-08-29 21:09:37,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908909046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:37,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:37,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 21:09:37,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615614416] [2023-08-29 21:09:37,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:37,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:09:37,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:37,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:09:37,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:09:37,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1792 out of 4723 [2023-08-29 21:09:37,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 93 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 1795.0) internal successors, (5385), 3 states have internal predecessors, (5385), 0 states have call successors, (0), 0 states 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 21:09:37,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:37,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1792 of 4723 [2023-08-29 21:09:37,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:38,071 INFO L130 PetriNetUnfolder]: 345/1055 cut-off events. [2023-08-29 21:09:38,071 INFO L131 PetriNetUnfolder]: For 2532/2532 co-relation queries the response was YES. [2023-08-29 21:09:38,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3158 conditions, 1055 events. 345/1055 cut-off events. For 2532/2532 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6042 event pairs, 126 based on Foata normal form. 4/674 useless extension candidates. Maximal degree in co-relation 3143. Up to 512 conditions per place. [2023-08-29 21:09:38,074 INFO L137 encePairwiseOnDemand]: 4719/4723 looper letters, 120 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2023-08-29 21:09:38,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 137 transitions, 793 flow [2023-08-29 21:09:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:09:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:09:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5477 transitions. [2023-08-29 21:09:38,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38654809796033596 [2023-08-29 21:09:38,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5477 transitions. [2023-08-29 21:09:38,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5477 transitions. [2023-08-29 21:09:38,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:38,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5477 transitions. [2023-08-29 21:09:38,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1825.6666666666667) internal successors, (5477), 3 states have internal predecessors, (5477), 0 states have call successors, (0), 0 states 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 21:09:38,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 4723.0) internal successors, (18892), 4 states have internal predecessors, (18892), 0 states have call successors, (0), 0 states 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 21:09:38,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 4723.0) internal successors, (18892), 4 states have internal predecessors, (18892), 0 states have call successors, (0), 0 states 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 21:09:38,089 INFO L175 Difference]: Start difference. First operand has 89 places, 93 transitions, 440 flow. Second operand 3 states and 5477 transitions. [2023-08-29 21:09:38,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 137 transitions, 793 flow [2023-08-29 21:09:38,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 137 transitions, 771 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 21:09:38,093 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 415 flow [2023-08-29 21:09:38,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2023-08-29 21:09:38,093 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -667 predicate places. [2023-08-29 21:09:38,094 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 415 flow [2023-08-29 21:09:38,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1795.0) internal successors, (5385), 3 states have internal predecessors, (5385), 0 states have call successors, (0), 0 states 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 21:09:38,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:38,094 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:38,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 21:09:38,094 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting StealerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:38,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:38,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1691413038, now seen corresponding path program 1 times [2023-08-29 21:09:38,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:38,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461082399] [2023-08-29 21:09:38,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:38,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:38,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461082399] [2023-08-29 21:09:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461082399] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:38,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:38,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 21:09:38,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710057822] [2023-08-29 21:09:38,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:38,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 21:09:38,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:38,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 21:09:38,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 21:09:38,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1754 out of 4723 [2023-08-29 21:09:38,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 1756.5) internal successors, (7026), 4 states have internal predecessors, (7026), 0 states have call successors, (0), 0 states 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 21:09:38,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:38,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1754 of 4723 [2023-08-29 21:09:38,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:38,764 INFO L130 PetriNetUnfolder]: 318/984 cut-off events. [2023-08-29 21:09:38,764 INFO L131 PetriNetUnfolder]: For 1817/1817 co-relation queries the response was YES. [2023-08-29 21:09:38,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2862 conditions, 984 events. 318/984 cut-off events. For 1817/1817 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5687 event pairs, 81 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 2846. Up to 543 conditions per place. [2023-08-29 21:09:38,767 INFO L137 encePairwiseOnDemand]: 4712/4723 looper letters, 70 selfloop transitions, 23 changer transitions 0/101 dead transitions. [2023-08-29 21:09:38,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 101 transitions, 690 flow [2023-08-29 21:09:38,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:09:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:09:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7078 transitions. [2023-08-29 21:09:38,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37465593902180816 [2023-08-29 21:09:38,774 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 7078 transitions. [2023-08-29 21:09:38,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 7078 transitions. [2023-08-29 21:09:38,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:38,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 7078 transitions. [2023-08-29 21:09:38,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 1769.5) internal successors, (7078), 4 states have internal predecessors, (7078), 0 states have call successors, (0), 0 states 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 21:09:38,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 4723.0) internal successors, (23615), 5 states have internal predecessors, (23615), 0 states have call successors, (0), 0 states 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 21:09:38,790 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 4723.0) internal successors, (23615), 5 states have internal predecessors, (23615), 0 states have call successors, (0), 0 states 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 21:09:38,790 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 415 flow. Second operand 4 states and 7078 transitions. [2023-08-29 21:09:38,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 101 transitions, 690 flow [2023-08-29 21:09:38,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 101 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:09:38,793 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 449 flow [2023-08-29 21:09:38,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2023-08-29 21:09:38,794 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -669 predicate places. [2023-08-29 21:09:38,794 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 449 flow [2023-08-29 21:09:38,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1756.5) internal successors, (7026), 4 states have internal predecessors, (7026), 0 states have call successors, (0), 0 states 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 21:09:38,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:38,795 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:38,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 21:09:38,796 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting StealerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:38,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1691413039, now seen corresponding path program 1 times [2023-08-29 21:09:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:38,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325060200] [2023-08-29 21:09:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:39,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:39,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325060200] [2023-08-29 21:09:39,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325060200] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:39,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:39,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 21:09:39,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282389807] [2023-08-29 21:09:39,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:39,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 21:09:39,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:39,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 21:09:39,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:09:42,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1637 out of 4723 [2023-08-29 21:09:42,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 449 flow. Second operand has 8 states, 8 states have (on average 1638.25) internal successors, (13106), 8 states have internal predecessors, (13106), 0 states have call successors, (0), 0 states 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 21:09:42,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:42,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1637 of 4723 [2023-08-29 21:09:42,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:42,819 INFO L130 PetriNetUnfolder]: 324/985 cut-off events. [2023-08-29 21:09:42,819 INFO L131 PetriNetUnfolder]: For 1958/1958 co-relation queries the response was YES. [2023-08-29 21:09:42,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2966 conditions, 985 events. 324/985 cut-off events. For 1958/1958 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5565 event pairs, 69 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 2950. Up to 689 conditions per place. [2023-08-29 21:09:42,822 INFO L137 encePairwiseOnDemand]: 4713/4723 looper letters, 94 selfloop transitions, 19 changer transitions 0/120 dead transitions. [2023-08-29 21:09:42,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 120 transitions, 827 flow [2023-08-29 21:09:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 21:09:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 21:09:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13185 transitions. [2023-08-29 21:09:42,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34895723057378786 [2023-08-29 21:09:42,832 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 13185 transitions. [2023-08-29 21:09:42,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 13185 transitions. [2023-08-29 21:09:42,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:42,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 13185 transitions. [2023-08-29 21:09:42,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 1648.125) internal successors, (13185), 8 states have internal predecessors, (13185), 0 states have call successors, (0), 0 states 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 21:09:42,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 4723.0) internal successors, (42507), 9 states have internal predecessors, (42507), 0 states have call successors, (0), 0 states 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 21:09:42,859 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 4723.0) internal successors, (42507), 9 states have internal predecessors, (42507), 0 states have call successors, (0), 0 states 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 21:09:42,859 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 449 flow. Second operand 8 states and 13185 transitions. [2023-08-29 21:09:42,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 120 transitions, 827 flow [2023-08-29 21:09:42,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 120 transitions, 767 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:09:42,862 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 511 flow [2023-08-29 21:09:42,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=511, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2023-08-29 21:09:42,863 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -661 predicate places. [2023-08-29 21:09:42,863 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 511 flow [2023-08-29 21:09:42,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1638.25) internal successors, (13106), 8 states have internal predecessors, (13106), 0 states have call successors, (0), 0 states 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 21:09:42,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:42,865 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:42,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 21:09:42,865 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting StealerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:42,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1691413037, now seen corresponding path program 1 times [2023-08-29 21:09:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438809693] [2023-08-29 21:09:42,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:42,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438809693] [2023-08-29 21:09:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438809693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:42,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:42,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 21:09:42,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981134685] [2023-08-29 21:09:42,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:42,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 21:09:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:42,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 21:09:42,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 21:09:43,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1781 out of 4723 [2023-08-29 21:09:43,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 1783.5) internal successors, (7134), 4 states have internal predecessors, (7134), 0 states have call successors, (0), 0 states 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 21:09:43,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:43,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1781 of 4723 [2023-08-29 21:09:43,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:43,869 INFO L130 PetriNetUnfolder]: 288/902 cut-off events. [2023-08-29 21:09:43,869 INFO L131 PetriNetUnfolder]: For 1731/1731 co-relation queries the response was YES. [2023-08-29 21:09:43,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2718 conditions, 902 events. 288/902 cut-off events. For 1731/1731 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5095 event pairs, 112 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 2698. Up to 521 conditions per place. [2023-08-29 21:09:43,871 INFO L137 encePairwiseOnDemand]: 4713/4723 looper letters, 64 selfloop transitions, 27 changer transitions 0/99 dead transitions. [2023-08-29 21:09:43,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 99 transitions, 746 flow [2023-08-29 21:09:43,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:09:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:09:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8966 transitions. [2023-08-29 21:09:43,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37967393605759053 [2023-08-29 21:09:43,878 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 8966 transitions. [2023-08-29 21:09:43,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 8966 transitions. [2023-08-29 21:09:43,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:43,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 8966 transitions. [2023-08-29 21:09:43,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1793.2) internal successors, (8966), 5 states have internal predecessors, (8966), 0 states have call successors, (0), 0 states 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 21:09:43,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 4723.0) internal successors, (28338), 6 states have internal predecessors, (28338), 0 states have call successors, (0), 0 states 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 21:09:43,895 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 4723.0) internal successors, (28338), 6 states have internal predecessors, (28338), 0 states have call successors, (0), 0 states 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 21:09:43,895 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 511 flow. Second operand 5 states and 8966 transitions. [2023-08-29 21:09:43,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 99 transitions, 746 flow [2023-08-29 21:09:43,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 99 transitions, 727 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 21:09:43,899 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 538 flow [2023-08-29 21:09:43,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=538, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2023-08-29 21:09:43,900 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -664 predicate places. [2023-08-29 21:09:43,900 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 538 flow [2023-08-29 21:09:43,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1783.5) internal successors, (7134), 4 states have internal predecessors, (7134), 0 states have call successors, (0), 0 states 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 21:09:43,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:43,901 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:43,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 21:09:43,901 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting StealerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:43,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1691413040, now seen corresponding path program 1 times [2023-08-29 21:09:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094652479] [2023-08-29 21:09:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:44,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:44,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094652479] [2023-08-29 21:09:44,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094652479] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:44,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 21:09:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291117847] [2023-08-29 21:09:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:44,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:09:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:44,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:09:44,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:09:45,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1701 out of 4723 [2023-08-29 21:09:45,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 1702.4285714285713) internal successors, (11917), 7 states have internal predecessors, (11917), 0 states have call successors, (0), 0 states 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 21:09:45,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:45,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1701 of 4723 [2023-08-29 21:09:45,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:46,081 INFO L130 PetriNetUnfolder]: 294/899 cut-off events. [2023-08-29 21:09:46,081 INFO L131 PetriNetUnfolder]: For 1863/1863 co-relation queries the response was YES. [2023-08-29 21:09:46,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 899 events. 294/899 cut-off events. For 1863/1863 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5011 event pairs, 155 based on Foata normal form. 0/659 useless extension candidates. Maximal degree in co-relation 2759. Up to 678 conditions per place. [2023-08-29 21:09:46,083 INFO L137 encePairwiseOnDemand]: 4714/4723 looper letters, 76 selfloop transitions, 19 changer transitions 0/102 dead transitions. [2023-08-29 21:09:46,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 102 transitions, 802 flow [2023-08-29 21:09:46,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:09:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:09:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10270 transitions. [2023-08-29 21:09:46,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3624108970287247 [2023-08-29 21:09:46,090 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 10270 transitions. [2023-08-29 21:09:46,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 10270 transitions. [2023-08-29 21:09:46,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:46,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 10270 transitions. [2023-08-29 21:09:46,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1711.6666666666667) internal successors, (10270), 6 states have internal predecessors, (10270), 0 states have call successors, (0), 0 states 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 21:09:46,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 4723.0) internal successors, (33061), 7 states have internal predecessors, (33061), 0 states have call successors, (0), 0 states 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 21:09:46,110 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 4723.0) internal successors, (33061), 7 states have internal predecessors, (33061), 0 states have call successors, (0), 0 states 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 21:09:46,110 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 538 flow. Second operand 6 states and 10270 transitions. [2023-08-29 21:09:46,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 102 transitions, 802 flow [2023-08-29 21:09:46,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 102 transitions, 767 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-29 21:09:46,114 INFO L231 Difference]: Finished difference. Result has 96 places, 92 transitions, 567 flow [2023-08-29 21:09:46,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=567, PETRI_PLACES=96, PETRI_TRANSITIONS=92} [2023-08-29 21:09:46,114 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -661 predicate places. [2023-08-29 21:09:46,114 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 567 flow [2023-08-29 21:09:46,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1702.4285714285713) internal successors, (11917), 7 states have internal predecessors, (11917), 0 states have call successors, (0), 0 states 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 21:09:46,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:46,115 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:46,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 21:09:46,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:46,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash -286766445, now seen corresponding path program 1 times [2023-08-29 21:09:46,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:46,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306892933] [2023-08-29 21:09:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:46,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:46,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306892933] [2023-08-29 21:09:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306892933] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:46,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:46,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 21:09:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91086316] [2023-08-29 21:09:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:46,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 21:09:46,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:46,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 21:09:46,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:09:49,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1667 out of 4723 [2023-08-29 21:09:49,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 567 flow. Second operand has 8 states, 8 states have (on average 1668.625) internal successors, (13349), 8 states have internal predecessors, (13349), 0 states have call successors, (0), 0 states 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 21:09:49,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:49,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1667 of 4723 [2023-08-29 21:09:49,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:50,112 INFO L130 PetriNetUnfolder]: 287/883 cut-off events. [2023-08-29 21:09:50,112 INFO L131 PetriNetUnfolder]: For 1887/1887 co-relation queries the response was YES. [2023-08-29 21:09:50,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2805 conditions, 883 events. 287/883 cut-off events. For 1887/1887 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4921 event pairs, 61 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 2785. Up to 467 conditions per place. [2023-08-29 21:09:50,116 INFO L137 encePairwiseOnDemand]: 4713/4723 looper letters, 84 selfloop transitions, 33 changer transitions 0/124 dead transitions. [2023-08-29 21:09:50,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 124 transitions, 1046 flow [2023-08-29 21:09:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 21:09:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 21:09:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15074 transitions. [2023-08-29 21:09:50,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35462394429152844 [2023-08-29 21:09:50,128 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 15074 transitions. [2023-08-29 21:09:50,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 15074 transitions. [2023-08-29 21:09:50,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:50,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 15074 transitions. [2023-08-29 21:09:50,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 1674.888888888889) internal successors, (15074), 9 states have internal predecessors, (15074), 0 states have call successors, (0), 0 states 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 21:09:50,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 4723.0) internal successors, (47230), 10 states have internal predecessors, (47230), 0 states have call successors, (0), 0 states 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 21:09:50,167 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 4723.0) internal successors, (47230), 10 states have internal predecessors, (47230), 0 states have call successors, (0), 0 states 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 21:09:50,167 INFO L175 Difference]: Start difference. First operand has 96 places, 92 transitions, 567 flow. Second operand 9 states and 15074 transitions. [2023-08-29 21:09:50,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 124 transitions, 1046 flow [2023-08-29 21:09:50,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 124 transitions, 1036 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 21:09:50,172 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 621 flow [2023-08-29 21:09:50,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=621, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2023-08-29 21:09:50,173 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -657 predicate places. [2023-08-29 21:09:50,173 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 621 flow [2023-08-29 21:09:50,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1668.625) internal successors, (13349), 8 states have internal predecessors, (13349), 0 states have call successors, (0), 0 states 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 21:09:50,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:50,175 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:50,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 21:09:50,175 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting StealerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:50,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash -286766444, now seen corresponding path program 1 times [2023-08-29 21:09:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:50,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872145294] [2023-08-29 21:09:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:50,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:50,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872145294] [2023-08-29 21:09:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872145294] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:50,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:50,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 21:09:50,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591656929] [2023-08-29 21:09:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:50,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:09:50,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:50,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:09:50,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:09:52,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 4723 [2023-08-29 21:09:52,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 621 flow. Second operand has 7 states, 7 states have (on average 1722.857142857143) internal successors, (12060), 7 states have internal predecessors, (12060), 0 states have call successors, (0), 0 states 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 21:09:52,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:52,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 4723 [2023-08-29 21:09:52,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:52,689 INFO L130 PetriNetUnfolder]: 357/1093 cut-off events. [2023-08-29 21:09:52,690 INFO L131 PetriNetUnfolder]: For 2416/2416 co-relation queries the response was YES. [2023-08-29 21:09:52,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3501 conditions, 1093 events. 357/1093 cut-off events. For 2416/2416 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6554 event pairs, 31 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 3481. Up to 483 conditions per place. [2023-08-29 21:09:52,693 INFO L137 encePairwiseOnDemand]: 4712/4723 looper letters, 110 selfloop transitions, 26 changer transitions 0/144 dead transitions. [2023-08-29 21:09:52,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 144 transitions, 1254 flow [2023-08-29 21:09:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 21:09:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 21:09:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17294 transitions. [2023-08-29 21:09:52,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36616557272919753 [2023-08-29 21:09:52,703 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 17294 transitions. [2023-08-29 21:09:52,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 17294 transitions. [2023-08-29 21:09:52,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:52,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 17294 transitions. [2023-08-29 21:09:52,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 1729.4) internal successors, (17294), 10 states have internal predecessors, (17294), 0 states have call successors, (0), 0 states 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 21:09:52,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 4723.0) internal successors, (51953), 11 states have internal predecessors, (51953), 0 states have call successors, (0), 0 states 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 21:09:52,736 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 4723.0) internal successors, (51953), 11 states have internal predecessors, (51953), 0 states have call successors, (0), 0 states 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 21:09:52,737 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 621 flow. Second operand 10 states and 17294 transitions. [2023-08-29 21:09:52,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 144 transitions, 1254 flow [2023-08-29 21:09:52,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 144 transitions, 1178 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-29 21:09:52,741 INFO L231 Difference]: Finished difference. Result has 101 places, 95 transitions, 657 flow [2023-08-29 21:09:52,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=657, PETRI_PLACES=101, PETRI_TRANSITIONS=95} [2023-08-29 21:09:52,742 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -656 predicate places. [2023-08-29 21:09:52,742 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 95 transitions, 657 flow [2023-08-29 21:09:52,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1722.857142857143) internal successors, (12060), 7 states have internal predecessors, (12060), 0 states have call successors, (0), 0 states 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 21:09:52,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:52,743 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:52,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 21:09:52,744 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:52,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1968966524, now seen corresponding path program 1 times [2023-08-29 21:09:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:52,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698542951] [2023-08-29 21:09:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:52,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:52,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698542951] [2023-08-29 21:09:52,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698542951] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:09:52,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:09:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:09:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830778867] [2023-08-29 21:09:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:09:52,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 21:09:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:09:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 21:09:52,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 21:09:53,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1750 out of 4723 [2023-08-29 21:09:53,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 95 transitions, 657 flow. Second operand has 5 states, 5 states have (on average 1752.8) internal successors, (8764), 5 states have internal predecessors, (8764), 0 states have call successors, (0), 0 states 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 21:09:53,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:09:53,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1750 of 4723 [2023-08-29 21:09:53,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:09:53,705 INFO L130 PetriNetUnfolder]: 277/929 cut-off events. [2023-08-29 21:09:53,705 INFO L131 PetriNetUnfolder]: For 2370/2370 co-relation queries the response was YES. [2023-08-29 21:09:53,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3071 conditions, 929 events. 277/929 cut-off events. For 2370/2370 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5497 event pairs, 85 based on Foata normal form. 74/775 useless extension candidates. Maximal degree in co-relation 3050. Up to 561 conditions per place. [2023-08-29 21:09:53,708 INFO L137 encePairwiseOnDemand]: 4714/4723 looper letters, 60 selfloop transitions, 34 changer transitions 1/103 dead transitions. [2023-08-29 21:09:53,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 103 transitions, 915 flow [2023-08-29 21:09:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:09:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:09:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8802 transitions. [2023-08-29 21:09:53,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272919754393397 [2023-08-29 21:09:53,713 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 8802 transitions. [2023-08-29 21:09:53,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 8802 transitions. [2023-08-29 21:09:53,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:09:53,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 8802 transitions. [2023-08-29 21:09:53,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1760.4) internal successors, (8802), 5 states have internal predecessors, (8802), 0 states have call successors, (0), 0 states 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 21:09:53,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 4723.0) internal successors, (28338), 6 states have internal predecessors, (28338), 0 states have call successors, (0), 0 states 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 21:09:53,728 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 4723.0) internal successors, (28338), 6 states have internal predecessors, (28338), 0 states have call successors, (0), 0 states 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 21:09:53,728 INFO L175 Difference]: Start difference. First operand has 101 places, 95 transitions, 657 flow. Second operand 5 states and 8802 transitions. [2023-08-29 21:09:53,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 103 transitions, 915 flow [2023-08-29 21:09:53,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 103 transitions, 877 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-08-29 21:09:53,734 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 683 flow [2023-08-29 21:09:53,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=683, PETRI_PLACES=98, PETRI_TRANSITIONS=94} [2023-08-29 21:09:53,735 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -659 predicate places. [2023-08-29 21:09:53,735 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 683 flow [2023-08-29 21:09:53,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1752.8) internal successors, (8764), 5 states have internal predecessors, (8764), 0 states have call successors, (0), 0 states 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 21:09:53,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:09:53,736 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:09:53,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 21:09:53,736 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:09:53,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:09:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1740048560, now seen corresponding path program 1 times [2023-08-29 21:09:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:09:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927218224] [2023-08-29 21:09:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:09:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:09:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:09:54,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927218224] [2023-08-29 21:09:54,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927218224] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:09:54,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430080898] [2023-08-29 21:09:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:09:54,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:09:54,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:09:54,142 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 21:09:54,142 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 21:09:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:09:54,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 97 conjunts are in the unsatisfiable core [2023-08-29 21:09:54,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:09:54,389 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 21:09:54,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 21:09:54,400 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 22 treesize of output 21 [2023-08-29 21:09:54,408 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 6 treesize of output 5 [2023-08-29 21:09:54,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:09:54,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:09:54,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:09:54,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:09:54,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:09:54,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:09:54,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:09:54,746 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-29 21:09:54,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-29 21:09:54,753 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 12 treesize of output 14 [2023-08-29 21:09:54,923 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-29 21:09:54,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-29 21:09:54,936 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 12 treesize of output 14 [2023-08-29 21:09:55,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 111 [2023-08-29 21:09:55,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 105 [2023-08-29 21:09:55,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 129 [2023-08-29 21:09:55,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:09:55,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:09:55,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 23 [2023-08-29 21:09:55,221 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 0 case distinctions, treesize of input 13 treesize of output 1 [2023-08-29 21:09:55,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2023-08-29 21:09:55,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:09:55,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:09:55,374 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 21:09:55,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 34 [2023-08-29 21:09:55,389 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-29 21:09:55,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 21:09:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 21:09:55,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:09:58,435 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (or (forall ((|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_190| Int) (v_ArrVal_1734 Int)) (not (= (select (store |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_1734) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_190|) 0))) (<= 0 (+ .cse0 |c_ULTIMATE.start_main_~#handles~0#1.offset|))) (forall ((|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_190| Int) (v_ArrVal_1734 Int)) (or (not (= (select (store |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_1734) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_190|) 0)) (forall ((v_ArrVal_1735 Int)) (<= (+ .cse0 |c_ULTIMATE.start_main_~#handles~0#1.offset| 4) (select (store |c_#length| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_190| v_ArrVal_1735) |c_ULTIMATE.start_main_~#handles~0#1.base|))))))) is different from false [2023-08-29 21:10:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 9 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:10:11,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430080898] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:10:11,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:10:11,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 14] total 33 [2023-08-29 21:10:11,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362657773] [2023-08-29 21:10:11,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:10:11,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-29 21:10:11,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:10:11,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-29 21:10:11,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=898, Unknown=22, NotChecked=64, Total=1190 [2023-08-29 21:10:12,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1212 out of 4723 [2023-08-29 21:10:12,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 683 flow. Second operand has 35 states, 35 states have (on average 1213.4857142857143) internal successors, (42472), 35 states have internal predecessors, (42472), 0 states have call successors, (0), 0 states 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 21:10:12,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:10:12,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1212 of 4723 [2023-08-29 21:10:12,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:10:17,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:10:22,554 WARN L222 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 82 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:10:36,549 WARN L222 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 79 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:10:45,849 WARN L222 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 81 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:10:46,005 INFO L130 PetriNetUnfolder]: 537/2042 cut-off events. [2023-08-29 21:10:46,005 INFO L131 PetriNetUnfolder]: For 7390/7390 co-relation queries the response was YES. [2023-08-29 21:10:46,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6964 conditions, 2042 events. 537/2042 cut-off events. For 7390/7390 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 16225 event pairs, 207 based on Foata normal form. 222/1715 useless extension candidates. Maximal degree in co-relation 6943. Up to 462 conditions per place. [2023-08-29 21:10:46,013 INFO L137 encePairwiseOnDemand]: 4701/4723 looper letters, 287 selfloop transitions, 138 changer transitions 6/432 dead transitions. [2023-08-29 21:10:46,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 432 transitions, 3326 flow [2023-08-29 21:10:46,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-29 21:10:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-29 21:10:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41573 transitions. [2023-08-29 21:10:46,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25888953930079334 [2023-08-29 21:10:46,040 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 41573 transitions. [2023-08-29 21:10:46,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41573 transitions. [2023-08-29 21:10:46,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:10:46,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 41573 transitions. [2023-08-29 21:10:46,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 1222.735294117647) internal successors, (41573), 34 states have internal predecessors, (41573), 0 states have call successors, (0), 0 states 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 21:10:46,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 4723.0) internal successors, (165305), 35 states have internal predecessors, (165305), 0 states have call successors, (0), 0 states 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 21:10:46,154 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 4723.0) internal successors, (165305), 35 states have internal predecessors, (165305), 0 states have call successors, (0), 0 states 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 21:10:46,154 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 683 flow. Second operand 34 states and 41573 transitions. [2023-08-29 21:10:46,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 432 transitions, 3326 flow [2023-08-29 21:10:46,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 432 transitions, 3112 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 21:10:46,164 INFO L231 Difference]: Finished difference. Result has 143 places, 201 transitions, 2165 flow [2023-08-29 21:10:46,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2165, PETRI_PLACES=143, PETRI_TRANSITIONS=201} [2023-08-29 21:10:46,165 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -614 predicate places. [2023-08-29 21:10:46,165 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 201 transitions, 2165 flow [2023-08-29 21:10:46,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1213.4857142857143) internal successors, (42472), 35 states have internal predecessors, (42472), 0 states have call successors, (0), 0 states 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 21:10:46,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:10:46,168 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:10:46,175 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 21:10:46,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:10:46,375 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting StealerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:10:46,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:10:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash -361173103, now seen corresponding path program 1 times [2023-08-29 21:10:46,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:10:46,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680438370] [2023-08-29 21:10:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:10:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:10:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:10:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:10:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:10:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680438370] [2023-08-29 21:10:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680438370] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:10:46,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:10:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-29 21:10:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617006619] [2023-08-29 21:10:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:10:46,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:10:46,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:10:46,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:10:46,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-08-29 21:10:54,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1586 out of 4723 [2023-08-29 21:10:54,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 201 transitions, 2165 flow. Second operand has 13 states, 13 states have (on average 1587.2307692307693) internal successors, (20634), 13 states have internal predecessors, (20634), 0 states have call successors, (0), 0 states 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 21:10:54,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:10:54,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1586 of 4723 [2023-08-29 21:10:54,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:10:56,101 INFO L130 PetriNetUnfolder]: 967/3945 cut-off events. [2023-08-29 21:10:56,101 INFO L131 PetriNetUnfolder]: For 25435/25435 co-relation queries the response was YES. [2023-08-29 21:10:56,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15954 conditions, 3945 events. 967/3945 cut-off events. For 25435/25435 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 35438 event pairs, 249 based on Foata normal form. 0/3046 useless extension candidates. Maximal degree in co-relation 15918. Up to 958 conditions per place. [2023-08-29 21:10:56,119 INFO L137 encePairwiseOnDemand]: 4707/4723 looper letters, 351 selfloop transitions, 165 changer transitions 6/528 dead transitions. [2023-08-29 21:10:56,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 528 transitions, 6885 flow [2023-08-29 21:10:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-29 21:10:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-29 21:10:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 43029 transitions. [2023-08-29 21:10:56,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3374267767661797 [2023-08-29 21:10:56,143 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 43029 transitions. [2023-08-29 21:10:56,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 43029 transitions. [2023-08-29 21:10:56,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:10:56,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 43029 transitions. [2023-08-29 21:10:56,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 1593.6666666666667) internal successors, (43029), 27 states have internal predecessors, (43029), 0 states have call successors, (0), 0 states 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 21:10:56,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 4723.0) internal successors, (132244), 28 states have internal predecessors, (132244), 0 states have call successors, (0), 0 states 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 21:10:56,242 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 4723.0) internal successors, (132244), 28 states have internal predecessors, (132244), 0 states have call successors, (0), 0 states 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 21:10:56,242 INFO L175 Difference]: Start difference. First operand has 143 places, 201 transitions, 2165 flow. Second operand 27 states and 43029 transitions. [2023-08-29 21:10:56,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 528 transitions, 6885 flow [2023-08-29 21:10:56,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 528 transitions, 6394 flow, removed 174 selfloop flow, removed 8 redundant places. [2023-08-29 21:10:56,280 INFO L231 Difference]: Finished difference. Result has 164 places, 310 transitions, 3842 flow [2023-08-29 21:10:56,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=1976, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3842, PETRI_PLACES=164, PETRI_TRANSITIONS=310} [2023-08-29 21:10:56,280 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -593 predicate places. [2023-08-29 21:10:56,281 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 310 transitions, 3842 flow [2023-08-29 21:10:56,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1587.2307692307693) internal successors, (20634), 13 states have internal predecessors, (20634), 0 states have call successors, (0), 0 states 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 21:10:56,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:10:56,282 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:10:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 21:10:56,282 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting StealerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:10:56,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:10:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash -361173104, now seen corresponding path program 1 times [2023-08-29 21:10:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:10:56,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620501888] [2023-08-29 21:10:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:10:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:10:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:10:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:10:56,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:10:56,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620501888] [2023-08-29 21:10:56,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620501888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:10:56,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:10:56,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 21:10:56,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905756867] [2023-08-29 21:10:56,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:10:56,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:10:56,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:10:56,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:10:56,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:10:58,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1659 out of 4723 [2023-08-29 21:10:58,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 310 transitions, 3842 flow. Second operand has 6 states, 6 states have (on average 1661.5) internal successors, (9969), 6 states have internal predecessors, (9969), 0 states have call successors, (0), 0 states 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 21:10:58,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:10:58,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1659 of 4723 [2023-08-29 21:10:58,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:10:58,888 INFO L130 PetriNetUnfolder]: 959/3912 cut-off events. [2023-08-29 21:10:58,888 INFO L131 PetriNetUnfolder]: For 24506/24506 co-relation queries the response was YES. [2023-08-29 21:10:58,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15938 conditions, 3912 events. 959/3912 cut-off events. For 24506/24506 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 35305 event pairs, 229 based on Foata normal form. 106/3214 useless extension candidates. Maximal degree in co-relation 15898. Up to 1547 conditions per place. [2023-08-29 21:10:58,906 INFO L137 encePairwiseOnDemand]: 4708/4723 looper letters, 142 selfloop transitions, 166 changer transitions 0/375 dead transitions. [2023-08-29 21:10:58,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 375 transitions, 5119 flow [2023-08-29 21:10:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 21:10:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 21:10:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16673 transitions. [2023-08-29 21:10:58,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3530171501164514 [2023-08-29 21:10:58,915 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 16673 transitions. [2023-08-29 21:10:58,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 16673 transitions. [2023-08-29 21:10:58,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:10:58,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 16673 transitions. [2023-08-29 21:10:58,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 1667.3) internal successors, (16673), 10 states have internal predecessors, (16673), 0 states have call successors, (0), 0 states 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 21:10:58,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 4723.0) internal successors, (51953), 11 states have internal predecessors, (51953), 0 states have call successors, (0), 0 states 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 21:10:58,945 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 4723.0) internal successors, (51953), 11 states have internal predecessors, (51953), 0 states have call successors, (0), 0 states 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 21:10:58,945 INFO L175 Difference]: Start difference. First operand has 164 places, 310 transitions, 3842 flow. Second operand 10 states and 16673 transitions. [2023-08-29 21:10:58,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 375 transitions, 5119 flow [2023-08-29 21:10:58,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 375 transitions, 5007 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-08-29 21:10:58,980 INFO L231 Difference]: Finished difference. Result has 171 places, 318 transitions, 4492 flow [2023-08-29 21:10:58,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=3704, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4492, PETRI_PLACES=171, PETRI_TRANSITIONS=318} [2023-08-29 21:10:58,981 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -586 predicate places. [2023-08-29 21:10:58,981 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 318 transitions, 4492 flow [2023-08-29 21:10:58,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1661.5) internal successors, (9969), 6 states have internal predecessors, (9969), 0 states have call successors, (0), 0 states 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 21:10:58,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:10:58,982 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:10:58,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 21:10:58,982 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting StealerErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:10:58,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:10:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash -798677426, now seen corresponding path program 1 times [2023-08-29 21:10:58,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:10:58,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842896024] [2023-08-29 21:10:58,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:10:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:10:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:10:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:10:59,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:10:59,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842896024] [2023-08-29 21:10:59,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842896024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:10:59,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:10:59,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 21:10:59,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818092511] [2023-08-29 21:10:59,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:10:59,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:10:59,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:10:59,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:10:59,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:11:00,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1653 out of 4723 [2023-08-29 21:11:00,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 318 transitions, 4492 flow. Second operand has 7 states, 7 states have (on average 1655.7142857142858) internal successors, (11590), 7 states have internal predecessors, (11590), 0 states have call successors, (0), 0 states 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 21:11:00,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:11:00,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1653 of 4723 [2023-08-29 21:11:00,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:11:01,278 INFO L130 PetriNetUnfolder]: 940/3836 cut-off events. [2023-08-29 21:11:01,278 INFO L131 PetriNetUnfolder]: For 26784/26784 co-relation queries the response was YES. [2023-08-29 21:11:01,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16731 conditions, 3836 events. 940/3836 cut-off events. For 26784/26784 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 34440 event pairs, 344 based on Foata normal form. 59/3103 useless extension candidates. Maximal degree in co-relation 16687. Up to 2324 conditions per place. [2023-08-29 21:11:01,298 INFO L137 encePairwiseOnDemand]: 4714/4723 looper letters, 122 selfloop transitions, 211 changer transitions 3/342 dead transitions. [2023-08-29 21:11:01,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 342 transitions, 5466 flow [2023-08-29 21:11:01,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 21:11:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 21:11:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14942 transitions. [2023-08-29 21:11:01,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515185734114381 [2023-08-29 21:11:01,307 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 14942 transitions. [2023-08-29 21:11:01,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14942 transitions. [2023-08-29 21:11:01,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:11:01,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 14942 transitions. [2023-08-29 21:11:01,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 1660.2222222222222) internal successors, (14942), 9 states have internal predecessors, (14942), 0 states have call successors, (0), 0 states 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 21:11:01,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 4723.0) internal successors, (47230), 10 states have internal predecessors, (47230), 0 states have call successors, (0), 0 states 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 21:11:01,334 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 4723.0) internal successors, (47230), 10 states have internal predecessors, (47230), 0 states have call successors, (0), 0 states 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 21:11:01,334 INFO L175 Difference]: Start difference. First operand has 171 places, 318 transitions, 4492 flow. Second operand 9 states and 14942 transitions. [2023-08-29 21:11:01,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 342 transitions, 5466 flow [2023-08-29 21:11:01,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 342 transitions, 5441 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-29 21:11:01,373 INFO L231 Difference]: Finished difference. Result has 174 places, 317 transitions, 4887 flow [2023-08-29 21:11:01,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=4465, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4887, PETRI_PLACES=174, PETRI_TRANSITIONS=317} [2023-08-29 21:11:01,374 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -583 predicate places. [2023-08-29 21:11:01,374 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 317 transitions, 4887 flow [2023-08-29 21:11:01,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1655.7142857142858) internal successors, (11590), 7 states have internal predecessors, (11590), 0 states have call successors, (0), 0 states 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 21:11:01,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:11:01,375 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:11:01,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 21:11:01,375 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting StealerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:11:01,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:11:01,375 INFO L85 PathProgramCache]: Analyzing trace with hash -798666196, now seen corresponding path program 1 times [2023-08-29 21:11:01,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:11:01,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950951881] [2023-08-29 21:11:01,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:11:01,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:11:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:11:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:11:01,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:11:01,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950951881] [2023-08-29 21:11:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950951881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:11:01,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:11:01,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 21:11:01,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376360095] [2023-08-29 21:11:01,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:11:01,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 21:11:01,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:11:01,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 21:11:01,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:11:04,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1653 out of 4723 [2023-08-29 21:11:04,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 317 transitions, 4887 flow. Second operand has 8 states, 8 states have (on average 1655.375) internal successors, (13243), 8 states have internal predecessors, (13243), 0 states have call successors, (0), 0 states 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 21:11:04,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:11:04,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1653 of 4723 [2023-08-29 21:11:04,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:11:05,077 INFO L130 PetriNetUnfolder]: 921/3745 cut-off events. [2023-08-29 21:11:05,077 INFO L131 PetriNetUnfolder]: For 28530/28530 co-relation queries the response was YES. [2023-08-29 21:11:05,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16858 conditions, 3745 events. 921/3745 cut-off events. For 28530/28530 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 33411 event pairs, 317 based on Foata normal form. 0/3012 useless extension candidates. Maximal degree in co-relation 16814. Up to 1189 conditions per place. [2023-08-29 21:11:05,096 INFO L137 encePairwiseOnDemand]: 4713/4723 looper letters, 153 selfloop transitions, 214 changer transitions 3/376 dead transitions. [2023-08-29 21:11:05,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 376 transitions, 6218 flow [2023-08-29 21:11:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 21:11:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 21:11:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18269 transitions. [2023-08-29 21:11:05,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35164475583700655 [2023-08-29 21:11:05,107 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 18269 transitions. [2023-08-29 21:11:05,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 18269 transitions. [2023-08-29 21:11:05,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:11:05,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 18269 transitions. [2023-08-29 21:11:05,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 1660.8181818181818) internal successors, (18269), 11 states have internal predecessors, (18269), 0 states have call successors, (0), 0 states 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 21:11:05,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 4723.0) internal successors, (56676), 12 states have internal predecessors, (56676), 0 states have call successors, (0), 0 states 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 21:11:05,141 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 4723.0) internal successors, (56676), 12 states have internal predecessors, (56676), 0 states have call successors, (0), 0 states 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 21:11:05,141 INFO L175 Difference]: Start difference. First operand has 174 places, 317 transitions, 4887 flow. Second operand 11 states and 18269 transitions. [2023-08-29 21:11:05,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 376 transitions, 6218 flow [2023-08-29 21:11:05,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 376 transitions, 5894 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-29 21:11:05,185 INFO L231 Difference]: Finished difference. Result has 177 places, 316 transitions, 4989 flow [2023-08-29 21:11:05,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=4561, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4989, PETRI_PLACES=177, PETRI_TRANSITIONS=316} [2023-08-29 21:11:05,185 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -580 predicate places. [2023-08-29 21:11:05,185 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 316 transitions, 4989 flow [2023-08-29 21:11:05,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1655.375) internal successors, (13243), 8 states have internal predecessors, (13243), 0 states have call successors, (0), 0 states 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 21:11:05,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:11:05,186 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:11:05,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 21:11:05,186 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting StealerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:11:05,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:11:05,187 INFO L85 PathProgramCache]: Analyzing trace with hash -798666195, now seen corresponding path program 1 times [2023-08-29 21:11:05,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:11:05,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542920037] [2023-08-29 21:11:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:11:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:11:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:11:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:11:05,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:11:05,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542920037] [2023-08-29 21:11:05,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542920037] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:11:05,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:11:05,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 21:11:05,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418890784] [2023-08-29 21:11:05,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:11:05,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:11:05,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:11:05,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:11:05,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:11:07,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1723 out of 4723 [2023-08-29 21:11:07,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 316 transitions, 4989 flow. Second operand has 7 states, 7 states have (on average 1725.7142857142858) internal successors, (12080), 7 states have internal predecessors, (12080), 0 states have call successors, (0), 0 states 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 21:11:07,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:11:07,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1723 of 4723 [2023-08-29 21:11:07,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:11:08,282 INFO L130 PetriNetUnfolder]: 883/3629 cut-off events. [2023-08-29 21:11:08,282 INFO L131 PetriNetUnfolder]: For 28045/28045 co-relation queries the response was YES. [2023-08-29 21:11:08,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16578 conditions, 3629 events. 883/3629 cut-off events. For 28045/28045 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 32378 event pairs, 235 based on Foata normal form. 0/2901 useless extension candidates. Maximal degree in co-relation 16534. Up to 1140 conditions per place. [2023-08-29 21:11:08,301 INFO L137 encePairwiseOnDemand]: 4713/4723 looper letters, 221 selfloop transitions, 147 changer transitions 0/375 dead transitions. [2023-08-29 21:11:08,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 375 transitions, 6389 flow [2023-08-29 21:11:08,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 21:11:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 21:11:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19030 transitions. [2023-08-29 21:11:08,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3662926106288376 [2023-08-29 21:11:08,312 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 19030 transitions. [2023-08-29 21:11:08,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 19030 transitions. [2023-08-29 21:11:08,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:11:08,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 19030 transitions. [2023-08-29 21:11:08,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 1730.0) internal successors, (19030), 11 states have internal predecessors, (19030), 0 states have call successors, (0), 0 states 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 21:11:08,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 4723.0) internal successors, (56676), 12 states have internal predecessors, (56676), 0 states have call successors, (0), 0 states 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 21:11:08,346 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 4723.0) internal successors, (56676), 12 states have internal predecessors, (56676), 0 states have call successors, (0), 0 states 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 21:11:08,346 INFO L175 Difference]: Start difference. First operand has 177 places, 316 transitions, 4989 flow. Second operand 11 states and 19030 transitions. [2023-08-29 21:11:08,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 375 transitions, 6389 flow [2023-08-29 21:11:08,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 375 transitions, 5862 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-08-29 21:11:08,388 INFO L231 Difference]: Finished difference. Result has 177 places, 315 transitions, 4754 flow [2023-08-29 21:11:08,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=4460, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4754, PETRI_PLACES=177, PETRI_TRANSITIONS=315} [2023-08-29 21:11:08,389 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -580 predicate places. [2023-08-29 21:11:08,389 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 315 transitions, 4754 flow [2023-08-29 21:11:08,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1725.7142857142858) internal successors, (12080), 7 states have internal predecessors, (12080), 0 states have call successors, (0), 0 states 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 21:11:08,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:11:08,390 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:11:08,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 21:11:08,390 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting StealerErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:11:08,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:11:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1010870754, now seen corresponding path program 1 times [2023-08-29 21:11:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:11:08,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970691195] [2023-08-29 21:11:08,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:11:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:11:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:11:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 21:11:09,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:11:09,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970691195] [2023-08-29 21:11:09,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970691195] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:11:09,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253389903] [2023-08-29 21:11:09,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:11:09,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:11:09,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:11:09,177 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 21:11:09,179 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 21:11:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:11:09,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 156 conjunts are in the unsatisfiable core [2023-08-29 21:11:09,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:11:09,466 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 22 treesize of output 21 [2023-08-29 21:11:09,475 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:11:09,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:11:09,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:11:09,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:11:09,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:11:09,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:11:09,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:11:09,888 INFO L321 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2023-08-29 21:11:09,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 170 [2023-08-29 21:11:09,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:11:09,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-08-29 21:11:10,254 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-29 21:11:10,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 21:11:10,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:11:10,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:11:10,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2023-08-29 21:11:10,508 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-29 21:11:10,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 21:11:10,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 142 [2023-08-29 21:11:10,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 95 [2023-08-29 21:11:10,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 89 [2023-08-29 21:11:10,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-08-29 21:11:10,753 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 61 treesize of output 57 [2023-08-29 21:11:10,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:11:10,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-08-29 21:11:10,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 14 [2023-08-29 21:11:10,784 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 14 treesize of output 11 [2023-08-29 21:11:10,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:11:10,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 82 [2023-08-29 21:11:10,967 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 82 treesize of output 76 [2023-08-29 21:11:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 21:11:11,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:11:11,086 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 117 treesize of output 113 [2023-08-29 21:11:11,090 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 113 treesize of output 109 [2023-08-29 21:11:11,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:11:11,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 130 [2023-08-29 21:11:11,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:11:11,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 124 [2023-08-29 21:11:11,838 INFO L321 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2023-08-29 21:11:11,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 181 [2023-08-29 21:11:11,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:11:11,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 162 [2023-08-29 21:11:11,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:11:11,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 136 [2023-08-29 21:11:11,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:11:11,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 148 [2023-08-29 21:11:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 21:11:14,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253389903] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:11:14,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:11:14,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 39 [2023-08-29 21:11:14,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205492664] [2023-08-29 21:11:14,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:11:14,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-29 21:11:14,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:11:14,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-29 21:11:14,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1422, Unknown=5, NotChecked=0, Total=1560 [2023-08-29 21:12:52,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1221 out of 4723 [2023-08-29 21:12:52,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 315 transitions, 4754 flow. Second operand has 40 states, 40 states have (on average 1222.525) internal successors, (48901), 40 states have internal predecessors, (48901), 0 states have call successors, (0), 0 states 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 21:12:52,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:12:52,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1221 of 4723 [2023-08-29 21:12:52,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:12:59,536 INFO L130 PetriNetUnfolder]: 699/2895 cut-off events. [2023-08-29 21:12:59,536 INFO L131 PetriNetUnfolder]: For 22237/22237 co-relation queries the response was YES. [2023-08-29 21:12:59,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13668 conditions, 2895 events. 699/2895 cut-off events. For 22237/22237 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 24189 event pairs, 359 based on Foata normal form. 9/2330 useless extension candidates. Maximal degree in co-relation 13625. Up to 2255 conditions per place. [2023-08-29 21:12:59,550 INFO L137 encePairwiseOnDemand]: 4706/4723 looper letters, 296 selfloop transitions, 67 changer transitions 4/368 dead transitions. [2023-08-29 21:12:59,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 368 transitions, 5717 flow [2023-08-29 21:12:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 21:12:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 21:12:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24550 transitions. [2023-08-29 21:12:59,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25989836968028796 [2023-08-29 21:12:59,566 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 24550 transitions. [2023-08-29 21:12:59,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24550 transitions. [2023-08-29 21:12:59,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:12:59,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 24550 transitions. [2023-08-29 21:12:59,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 1227.5) internal successors, (24550), 20 states have internal predecessors, (24550), 0 states have call successors, (0), 0 states 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 21:12:59,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 4723.0) internal successors, (99183), 21 states have internal predecessors, (99183), 0 states have call successors, (0), 0 states 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 21:12:59,630 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 4723.0) internal successors, (99183), 21 states have internal predecessors, (99183), 0 states have call successors, (0), 0 states 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 21:12:59,631 INFO L175 Difference]: Start difference. First operand has 177 places, 315 transitions, 4754 flow. Second operand 20 states and 24550 transitions. [2023-08-29 21:12:59,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 368 transitions, 5717 flow [2023-08-29 21:12:59,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 368 transitions, 5443 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-08-29 21:12:59,665 INFO L231 Difference]: Finished difference. Result has 201 places, 316 transitions, 4610 flow [2023-08-29 21:12:59,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=3802, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4610, PETRI_PLACES=201, PETRI_TRANSITIONS=316} [2023-08-29 21:12:59,665 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -556 predicate places. [2023-08-29 21:12:59,665 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 316 transitions, 4610 flow [2023-08-29 21:12:59,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1222.525) internal successors, (48901), 40 states have internal predecessors, (48901), 0 states have call successors, (0), 0 states 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 21:12:59,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:12:59,669 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:12:59,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-29 21:12:59,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:12:59,869 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:12:59,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:12:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1281180420, now seen corresponding path program 1 times [2023-08-29 21:12:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:12:59,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543040767] [2023-08-29 21:12:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:12:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:12:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:12:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:12:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:12:59,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543040767] [2023-08-29 21:12:59,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543040767] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:12:59,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:12:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:12:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505047162] [2023-08-29 21:12:59,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:12:59,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:12:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:12:59,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:12:59,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:12:59,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1792 out of 4723 [2023-08-29 21:12:59,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 316 transitions, 4610 flow. Second operand has 3 states, 3 states have (on average 1798.6666666666667) internal successors, (5396), 3 states have internal predecessors, (5396), 0 states have call successors, (0), 0 states 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 21:12:59,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:12:59,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1792 of 4723 [2023-08-29 21:12:59,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:13:00,463 INFO L130 PetriNetUnfolder]: 477/2228 cut-off events. [2023-08-29 21:13:00,463 INFO L131 PetriNetUnfolder]: For 18545/18545 co-relation queries the response was YES. [2023-08-29 21:13:00,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11147 conditions, 2228 events. 477/2228 cut-off events. For 18545/18545 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 17555 event pairs, 227 based on Foata normal form. 49/2024 useless extension candidates. Maximal degree in co-relation 11090. Up to 1745 conditions per place. [2023-08-29 21:13:00,475 INFO L137 encePairwiseOnDemand]: 4718/4723 looper letters, 262 selfloop transitions, 3 changer transitions 0/325 dead transitions. [2023-08-29 21:13:00,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 325 transitions, 5238 flow [2023-08-29 21:13:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:13:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:13:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5421 transitions. [2023-08-29 21:13:00,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3825958077493119 [2023-08-29 21:13:00,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5421 transitions. [2023-08-29 21:13:00,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5421 transitions. [2023-08-29 21:13:00,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:13:00,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5421 transitions. [2023-08-29 21:13:00,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1807.0) internal successors, (5421), 3 states have internal predecessors, (5421), 0 states have call successors, (0), 0 states 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 21:13:00,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 4723.0) internal successors, (18892), 4 states have internal predecessors, (18892), 0 states have call successors, (0), 0 states 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 21:13:00,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 4723.0) internal successors, (18892), 4 states have internal predecessors, (18892), 0 states have call successors, (0), 0 states 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 21:13:00,489 INFO L175 Difference]: Start difference. First operand has 201 places, 316 transitions, 4610 flow. Second operand 3 states and 5421 transitions. [2023-08-29 21:13:00,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 325 transitions, 5238 flow [2023-08-29 21:13:00,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 325 transitions, 5196 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-29 21:13:00,524 INFO L231 Difference]: Finished difference. Result has 200 places, 318 transitions, 4595 flow [2023-08-29 21:13:00,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=4568, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4595, PETRI_PLACES=200, PETRI_TRANSITIONS=318} [2023-08-29 21:13:00,525 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -557 predicate places. [2023-08-29 21:13:00,525 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 318 transitions, 4595 flow [2023-08-29 21:13:00,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1798.6666666666667) internal successors, (5396), 3 states have internal predecessors, (5396), 0 states have call successors, (0), 0 states 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 21:13:00,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:13:00,526 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:13:00,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 21:13:00,526 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting StealerErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:13:00,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:13:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash 12876116, now seen corresponding path program 1 times [2023-08-29 21:13:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:13:00,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293272733] [2023-08-29 21:13:00,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:13:00,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:13:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:13:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 21:13:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:13:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293272733] [2023-08-29 21:13:01,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293272733] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:13:01,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228990434] [2023-08-29 21:13:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:13:01,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:13:01,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:13:01,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:13:01,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-29 21:13:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:13:01,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 160 conjunts are in the unsatisfiable core [2023-08-29 21:13:01,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:13:01,843 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:13:01,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:13:01,848 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 22 treesize of output 21 [2023-08-29 21:13:01,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:13:01,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:13:01,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:13:01,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:13:01,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:13:02,034 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 12 treesize of output 9 [2023-08-29 21:13:02,197 INFO L321 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2023-08-29 21:13:02,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 170 [2023-08-29 21:13:02,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:13:02,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-08-29 21:13:02,216 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 21:13:02,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 21:13:02,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-08-29 21:13:02,419 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 31 [2023-08-29 21:13:02,480 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:13:02,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:13:02,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 137 [2023-08-29 21:13:02,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 95 [2023-08-29 21:13:02,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 89 [2023-08-29 21:13:02,668 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 65 treesize of output 61 [2023-08-29 21:13:02,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:13:02,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-08-29 21:13:03,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:13:03,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 131 [2023-08-29 21:13:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 21:13:03,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:13:03,183 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 206 treesize of output 200 [2023-08-29 21:13:03,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:13:03,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 138 [2023-08-29 21:13:03,984 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 111 treesize of output 107 [2023-08-29 21:13:03,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:13:03,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 239 [2023-08-29 21:13:04,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:13:04,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 124 [2023-08-29 21:13:04,331 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base|))) (let ((.cse3 (= (select .cse10 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (select (select |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~expected#1.base|) |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~expected#1.offset|))) (.cse22 (< 8589934551 |c_~#q~0.offset|)) (.cse20 (< 0 (+ 41 |c_~#q~0.offset|))) (.cse7 (+ 104 |c_~#q~0.offset|))) (let ((.cse1 (forall ((v_ArrVal_2908 Int)) (let ((.cse26 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse10 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_ArrVal_2908)))) (let ((.cse27 (select (select .cse26 |c_~#q~0.base|) .cse7))) (or (< (select (select .cse26 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|) (+ .cse27 1)) (<= 0 (+ 40 |c_~#q~0.offset| (* .cse27 4)))))))) (.cse12 (or (forall ((v_ArrVal_2908 Int)) (< (select (select (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse10 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_ArrVal_2908)) |c_~#q~0.base|) .cse7) 0)) .cse20)) (.cse13 (or (forall ((v_ArrVal_2908 Int)) (let ((.cse25 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse10 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_ArrVal_2908)))) (or (<= 0 (select (select .cse25 |c_~#q~0.base|) .cse7)) (< (+ 2147483647 (select (select .cse25 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|)) 0)))) .cse22)) (.cse0 (not .cse3)) (.cse4 (forall ((v_ArrVal_2907 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_ArrVal_2907))) (let ((.cse23 (select (select .cse24 |c_~#q~0.base|) .cse7))) (or (<= 0 (+ (* .cse23 4) 40 |c_~#q~0.offset|)) (< (select (select .cse24 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|) (+ .cse23 1))))))) (.cse6 (or (forall ((v_ArrVal_2907 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_ArrVal_2907))) (or (< (+ 2147483647 (select (select .cse21 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|)) 0) (<= 0 (select (select .cse21 |c_~#q~0.base|) .cse7))))) .cse22)) (.cse9 (or (forall ((v_ArrVal_2907 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_ArrVal_2907) |c_~#q~0.base|) .cse7) 0)) .cse20)) (.cse5 (< .cse7 0)) (.cse2 (< |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset| 0))) (and (or (= |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base| |c_~#q~0.base|) (and (or (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse2)) .cse5) (or .cse5 (and (or .cse3 (and .cse6 (forall ((v_ArrVal_2907 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_ArrVal_2907) |c_~#q~0.base|) .cse7) 17)) (forall ((v_ArrVal_2907 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_ArrVal_2907))) (or (<= 0 (select (select .cse8 |c_~#q~0.base|) .cse7)) (< (select (select .cse8 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|) 18)))) .cse9) .cse2) (or (and (forall ((v_ArrVal_2908 Int)) (< (select (select (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse10 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_ArrVal_2908)) |c_~#q~0.base|) .cse7) 17)) (forall ((v_ArrVal_2908 Int)) (let ((.cse11 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse10 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_ArrVal_2908)))) (or (<= 0 (select (select .cse11 |c_~#q~0.base|) .cse7)) (< (select (select .cse11 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|) 18)))) .cse12 .cse13) .cse0 .cse2))))) (or (and (or .cse5 .cse1) (or .cse5 (and (forall ((v_ArrVal_2908 Int)) (let ((.cse14 (select (select (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse10 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_ArrVal_2908)) |c_~#q~0.base|) .cse7))) (or (< .cse14 17) (< (+ |c_~#q~0.offset| 39 (* .cse14 4)) |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset|)))) .cse12 (forall ((v_ArrVal_2908 Int)) (let ((.cse16 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse10 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_ArrVal_2908)))) (let ((.cse15 (select (select .cse16 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|))) (or (< (+ (* .cse15 4) 35 |c_~#q~0.offset|) |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (<= 0 (select (select .cse16 |c_~#q~0.base|) .cse7)) (< .cse15 18))))) .cse13))) .cse0 .cse2) (or .cse3 (and (or .cse5 .cse4) (or (and .cse6 (forall ((v_ArrVal_2907 (Array Int Int))) (let ((.cse17 (select (select (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_ArrVal_2907) |c_~#q~0.base|) .cse7))) (or (< (+ (* .cse17 4) |c_~#q~0.offset| 39) |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (< .cse17 17)))) (forall ((v_ArrVal_2907 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_ArrVal_2907))) (let ((.cse19 (select (select .cse18 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|))) (or (<= 0 (select (select .cse18 |c_~#q~0.base|) .cse7)) (< .cse19 18) (< (+ (* .cse19 4) 35 |c_~#q~0.offset|) |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset|))))) .cse9) .cse5)) .cse2))))) is different from false [2023-08-29 21:13:22,012 WARN L222 SmtUtils]: Spent 17.13s on a formula simplification. DAG size of input: 130 DAG size of output: 116 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:13:22,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:13:22,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 297 treesize of output 367 [2023-08-29 21:13:30,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:13:30,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 170 [2023-08-29 21:13:30,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:13:30,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 144 [2023-08-29 21:13:30,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:13:30,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 156 [2023-08-29 21:13:33,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:13:33,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 813 treesize of output 803 [2023-08-29 21:14:11,175 WARN L222 SmtUtils]: Spent 9.45s on a formula simplification that was a NOOP. DAG size: 289 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:14:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 21:14:12,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228990434] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:14:12,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:14:12,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 16] total 44 [2023-08-29 21:14:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263197008] [2023-08-29 21:14:12,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:14:12,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-08-29 21:14:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:14:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-08-29 21:14:12,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1746, Unknown=21, NotChecked=86, Total=2070 [2023-08-29 21:14:15,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1190 out of 4723 [2023-08-29 21:14:15,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 318 transitions, 4595 flow. Second operand has 46 states, 46 states have (on average 1191.5) internal successors, (54809), 46 states have internal predecessors, (54809), 0 states have call successors, (0), 0 states 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 21:14:15,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:14:15,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1190 of 4723 [2023-08-29 21:14:15,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:14:31,036 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base|))) (let ((.cse29 (+ |c_~#q~0.offset| 36)) (.cse4 (= (select .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset|) 0)) (.cse6 (+ 104 |c_~#q~0.offset|)) (.cse8 (+ 32 |c_~#q~0.offset|))) (let ((.cse15 (forall ((v_prenex_27 Int) (v_prenex_28 Int) (v_prenex_54 (Array Int Int)) (v_prenex_55 Int)) (let ((.cse61 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_prenex_55)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_54))) (let ((.cse60 (select .cse61 |c_~#q~0.base|))) (or (<= 0 (+ 40 |c_~#q~0.offset| (* (select .cse60 .cse6) 4))) (= v_prenex_27 |c_~#q~0.base|) (not (= (select (select (store .cse61 |c_~#q~0.base| (store .cse60 .cse8 v_prenex_28)) v_prenex_27) 0) 0))))))) (.cse9 (forall ((v_prenex_68 Int) (v_prenex_66 (Array Int Int)) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| Int) (v_ArrVal_2902 Int)) (let ((.cse59 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_prenex_68)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_66))) (let ((.cse58 (select .cse59 |c_~#q~0.base|))) (or (<= 0 (select .cse58 .cse6)) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| |c_~#q~0.base|) (not (= (select (select (store .cse59 |c_~#q~0.base| (store .cse58 .cse8 v_ArrVal_2902)) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199|) 0) 0))))))) (.cse3 (forall ((v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_57 Int) (v_prenex_56 (Array Int Int))) (let ((.cse56 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_prenex_57)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_56))) (let ((.cse57 (select .cse56 |c_~#q~0.base|))) (or (= v_prenex_24 |c_~#q~0.base|) (not (= (select (select (store .cse56 |c_~#q~0.base| (store .cse57 .cse8 v_prenex_25)) v_prenex_24) 0) 0)) (< (select .cse57 .cse6) 17)))))) (.cse12 (< 8589934551 |c_~#q~0.offset|)) (.cse19 (forall ((|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| Int)) (or (not (= (select (select |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200|) 0) 0)) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| |c_StealerThread1of1ForFork0_readV_~v#1.base|)))) (.cse1 (not .cse4)) (.cse33 (forall ((v_ArrVal_2901 (Array Int Int)) (v_prenex_29 Int) (v_prenex_30 Int) (v_ArrVal_2898 Int) (v_ArrVal_2907 (Array Int Int))) (let ((.cse55 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_ArrVal_2898)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse54 (select .cse55 |c_~#q~0.base|))) (let ((.cse53 (store .cse55 |c_~#q~0.base| (store .cse54 .cse8 v_prenex_30)))) (or (= v_prenex_29 |c_~#q~0.base|) (not (= (select (select .cse53 v_prenex_29) 0) 0)) (< (select v_ArrVal_2907 0) 18) (= (select .cse54 .cse29) 0) (<= 0 (select (select (store .cse53 v_prenex_29 v_ArrVal_2907) |c_~#q~0.base|) .cse6)))))))) (.cse0 (not (= (select .cse36 0) 0))) (.cse2 (< |c_StealerThread1of1ForFork0_readV_~v#1.offset| 0)) (.cse16 (< .cse29 0)) (.cse24 ((as const (Array Int Int)) 0)) (.cse25 (select |c_#memory_int| 3))) (and (not (= 3 |c_ULTIMATE.start_main_~#handles~0#1.base|)) (or (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 (forall ((v_prenex_63 (Array Int Int)) (v_prenex_62 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| v_prenex_63) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_62))) (let ((.cse5 (select .cse7 |c_~#q~0.base|))) (or (= v_prenex_65 |c_~#q~0.base|) (< (select .cse5 .cse6) 17) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse5 .cse8 v_prenex_64)) v_prenex_65) 0) 0)))))) .cse2) (or (and (or .cse0 .cse9 .cse1 .cse2) (or .cse0 (forall ((v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_67 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| v_prenex_67) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_51))) (let ((.cse11 (select .cse10 |c_~#q~0.base|))) (or (not (= (select (select (store .cse10 |c_~#q~0.base| (store .cse11 .cse8 v_prenex_53)) v_prenex_52) 0) 0)) (<= 0 (select .cse11 .cse6)) (= v_prenex_52 |c_~#q~0.base|))))) .cse4 .cse2)) .cse12) (or .cse0 .cse4 (forall ((v_prenex_61 (Array Int Int)) (v_prenex_58 Int) (v_prenex_59 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| v_prenex_61) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_59))) (let ((.cse14 (select .cse13 |c_~#q~0.base|))) (or (not (= (select (select (store .cse13 |c_~#q~0.base| (store .cse14 .cse8 v_prenex_60)) v_prenex_58) 0) 0)) (<= 0 (+ 40 |c_~#q~0.offset| (* (select .cse14 .cse6) 4))) (= v_prenex_58 |c_~#q~0.base|))))) .cse2) (or .cse15 .cse0 .cse1 .cse2)) .cse16) (= (select |c_#valid| 3) 1) (or (and (or .cse4 (forall ((v_prenex_61 (Array Int Int)) (v_prenex_58 Int) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| Int) (v_prenex_59 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse17 (store (store |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| v_prenex_61) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_59))) (let ((.cse18 (select .cse17 |c_~#q~0.base|))) (or (not (= (select (select (store .cse17 |c_~#q~0.base| (store .cse18 .cse8 v_prenex_60)) v_prenex_58) 0) 0)) (not (= (select (select |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200|) 0) 0)) (<= 0 (+ 40 (* (select .cse18 .cse6) 4) |c_~#q~0.offset|)) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| |c_StealerThread1of1ForFork0_readV_~v#1.base|) (= v_prenex_58 |c_~#q~0.base|))))) .cse2) (or .cse15 .cse19 .cse1 .cse2) (or .cse4 (forall ((v_prenex_63 (Array Int Int)) (v_prenex_62 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| Int)) (let ((.cse21 (store (store |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| v_prenex_63) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_62))) (let ((.cse20 (select .cse21 |c_~#q~0.base|))) (or (= v_prenex_65 |c_~#q~0.base|) (not (= (select (select |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200|) 0) 0)) (< (select .cse20 .cse6) 17) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| |c_StealerThread1of1ForFork0_readV_~v#1.base|) (not (= (select (select (store .cse21 |c_~#q~0.base| (store .cse20 .cse8 v_prenex_64)) v_prenex_65) 0) 0)))))) .cse2) (or (and (or .cse4 (forall ((v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_67 (Array Int Int)) (v_prenex_53 Int) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| Int)) (let ((.cse23 (store (store |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| v_prenex_67) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_51))) (let ((.cse22 (select .cse23 |c_~#q~0.base|))) (or (<= 0 (select .cse22 .cse6)) (not (= (select (select (store .cse23 |c_~#q~0.base| (store .cse22 .cse8 v_prenex_53)) v_prenex_52) 0) 0)) (not (= (select (select |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200|) 0) 0)) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| |c_StealerThread1of1ForFork0_readV_~v#1.base|) (= v_prenex_52 |c_~#q~0.base|))))) .cse2) (or .cse19 .cse9 .cse1 .cse2)) .cse12) (or .cse19 .cse1 .cse2 .cse3)) .cse16) (= |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset| 0) (exists ((v_ArrVal_2881 Int) (v_ArrVal_2884 Int) (v_ArrVal_2898 Int)) (= (store (store (store (store (store (store .cse24 24 v_ArrVal_2881) 28 v_ArrVal_2884) 32 0) 104 1) 36 0) 32 v_ArrVal_2898) .cse25)) (or (not (= (select (select |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|) 0)) (let ((.cse26 (not (= (select |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 1))) (.cse31 (< |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset| 0)) (.cse32 (not (= (select |c_#valid| |c_StealerThread1of1ForFork0_readV_~v#1.base|) 1)))) (and (or (and (or .cse4 .cse26 (forall ((v_ArrVal_2901 (Array Int Int)) (v_prenex_29 Int) (v_ArrVal_2897 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_2907 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse28 (select .cse30 |c_~#q~0.base|))) (let ((.cse27 (store .cse30 |c_~#q~0.base| (store .cse28 .cse8 v_prenex_30)))) (or (not (= (select (select .cse27 v_prenex_29) 0) 0)) (= (select .cse28 .cse29) 0) (= v_prenex_29 |c_~#q~0.base|) (< (select v_ArrVal_2907 0) 18) (<= 0 (select (select (store .cse27 v_prenex_29 v_ArrVal_2907) |c_~#q~0.base|) .cse6))))))) .cse2 .cse31 .cse32) (or .cse33 .cse26 .cse1 .cse2 .cse31 .cse32)) .cse16) (or (and (or .cse26 .cse1 .cse2 (forall ((v_prenex_27 Int) (v_ArrVal_2901 (Array Int Int)) (v_prenex_28 Int) (v_ArrVal_2898 Int)) (let ((.cse35 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_ArrVal_2898)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse34 (select .cse35 |c_~#q~0.base|))) (or (<= 0 (+ 40 |c_~#q~0.offset| (* (select .cse34 .cse6) 4))) (= v_prenex_27 |c_~#q~0.base|) (not (= (select (select (store .cse35 |c_~#q~0.base| (store .cse34 .cse8 v_prenex_28)) v_prenex_27) 0) 0)))))) .cse31 .cse32) (or .cse4 .cse26 (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_prenex_25 Int) (v_prenex_24 Int)) (let ((.cse37 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse38 (select .cse37 |c_~#q~0.base|))) (or (= v_prenex_24 |c_~#q~0.base|) (not (= (select (select (store .cse37 |c_~#q~0.base| (store .cse38 .cse8 v_prenex_25)) v_prenex_24) 0) 0)) (< (select .cse38 .cse6) 17))))) .cse2 .cse31 .cse32) (or (and (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| Int) (v_ArrVal_2902 Int)) (let ((.cse39 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse40 (select .cse39 |c_~#q~0.base|))) (or (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| |c_~#q~0.base|) (not (= 0 (select (select (store .cse39 |c_~#q~0.base| (store .cse40 .cse8 v_ArrVal_2902)) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199|) 0))) (<= 0 (select .cse40 .cse6)))))) .cse4 .cse26 .cse2 .cse31 .cse32) (or .cse26 .cse1 (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2898 Int) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| Int) (v_ArrVal_2902 Int)) (let ((.cse42 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_ArrVal_2898)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse41 (select .cse42 |c_~#q~0.base|))) (or (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| |c_~#q~0.base|) (<= 0 (select .cse41 .cse6)) (not (= (select (select (store .cse42 |c_~#q~0.base| (store .cse41 .cse8 v_ArrVal_2902)) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199|) 0) 0)))))) .cse2 .cse31 .cse32)) .cse12) (or .cse4 .cse26 .cse2 .cse31 .cse32 (forall ((v_prenex_27 Int) (v_ArrVal_2901 (Array Int Int)) (v_prenex_28 Int) (v_ArrVal_2897 (Array Int Int))) (let ((.cse44 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse43 (select .cse44 |c_~#q~0.base|))) (or (= v_prenex_27 |c_~#q~0.base|) (<= 0 (+ 40 |c_~#q~0.offset| (* (select .cse43 .cse6) 4))) (not (= (select (select (store .cse44 |c_~#q~0.base| (store .cse43 .cse8 v_prenex_28)) v_prenex_27) 0) 0))))))) (or .cse26 .cse1 (forall ((v_ArrVal_2901 (Array Int Int)) (v_prenex_25 Int) (v_prenex_24 Int) (v_ArrVal_2898 Int)) (let ((.cse46 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_ArrVal_2898)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse45 (select .cse46 |c_~#q~0.base|))) (or (= v_prenex_24 |c_~#q~0.base|) (< (select .cse45 .cse6) 17) (not (= (select (select (store .cse46 |c_~#q~0.base| (store .cse45 .cse8 v_prenex_25)) v_prenex_24) 0) 0)))))) .cse2 .cse31 .cse32)) .cse16)))) (= 3 |c_StealerThread1of1ForFork0_readV_~v#1.base|) (<= 0 |c_~#q~0.offset|) (= |c_~#q~0.offset| 0) (= 3 |c_~#q~0.base|) (not (= 3 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|)) (or (and (or .cse4 (forall ((v_prenex_50 (Array Int Int)) (v_prenex_49 Int) (v_prenex_48 Int) (v_ArrVal_2897 (Array Int Int)) (v_prenex_47 (Array Int Int)) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| Int)) (let ((.cse49 (store (store |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_47))) (let ((.cse48 (select .cse49 |c_~#q~0.base|))) (let ((.cse47 (store .cse49 |c_~#q~0.base| (store .cse48 .cse8 v_prenex_49)))) (or (not (= 0 (select (select .cse47 v_prenex_48) 0))) (not (= (select (select |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200|) 0) 0)) (< (select v_prenex_50 0) 18) (<= 0 (select (select (store .cse47 v_prenex_48 v_prenex_50) |c_~#q~0.base|) .cse6)) (= v_prenex_48 |c_~#q~0.base|) (= (select .cse48 .cse29) 0) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| |c_StealerThread1of1ForFork0_readV_~v#1.base|)))))) .cse2) (or .cse33 .cse19 .cse1 .cse2)) .cse16) (= |c_StealerThread1of1ForFork0_Steal_~h~0#1| 0) (= 32 |c_StealerThread1of1ForFork0_writeV_~v#1.offset|) (or (and (or .cse0 .cse33 .cse2) (or (forall ((v_prenex_49 Int) (v_prenex_50 (Array Int Int)) (v_prenex_48 Int) (v_ArrVal_2897 (Array Int Int)) (v_prenex_47 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_47))) (let ((.cse51 (select .cse52 |c_~#q~0.base|))) (let ((.cse50 (store .cse52 |c_~#q~0.base| (store .cse51 .cse8 v_prenex_49)))) (or (<= 0 (select (select (store .cse50 v_prenex_48 v_prenex_50) |c_~#q~0.base|) .cse6)) (< (select v_prenex_50 0) 18) (not (= (select (select .cse50 v_prenex_48) 0) 0)) (= v_prenex_48 |c_~#q~0.base|) (= (select .cse51 .cse29) 0)))))) .cse0 .cse4 .cse2)) .cse16) (exists ((v_ArrVal_2881 Int) (v_ArrVal_2884 Int) (v_ArrVal_2902 Int)) (= (store (store (store (store (store (store .cse24 24 v_ArrVal_2881) 28 v_ArrVal_2884) 32 0) 104 1) 36 0) 32 v_ArrVal_2902) .cse25)) (= |c_StealerThread1of1ForFork0_writeV_~v#1.base| 3) (= |c_StealerThread1of1ForFork0_readV_~v#1.offset| 36))))) is different from true [2023-08-29 21:14:38,859 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base|))) (let ((.cse29 (+ |c_~#q~0.offset| 36)) (.cse4 (= (select .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset|) 0)) (.cse6 (+ 104 |c_~#q~0.offset|)) (.cse8 (+ 32 |c_~#q~0.offset|))) (let ((.cse15 (forall ((v_prenex_27 Int) (v_prenex_28 Int) (v_prenex_54 (Array Int Int)) (v_prenex_55 Int)) (let ((.cse61 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_prenex_55)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_54))) (let ((.cse60 (select .cse61 |c_~#q~0.base|))) (or (<= 0 (+ 40 |c_~#q~0.offset| (* (select .cse60 .cse6) 4))) (= v_prenex_27 |c_~#q~0.base|) (not (= (select (select (store .cse61 |c_~#q~0.base| (store .cse60 .cse8 v_prenex_28)) v_prenex_27) 0) 0))))))) (.cse9 (forall ((v_prenex_68 Int) (v_prenex_66 (Array Int Int)) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| Int) (v_ArrVal_2902 Int)) (let ((.cse59 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_prenex_68)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_66))) (let ((.cse58 (select .cse59 |c_~#q~0.base|))) (or (<= 0 (select .cse58 .cse6)) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| |c_~#q~0.base|) (not (= (select (select (store .cse59 |c_~#q~0.base| (store .cse58 .cse8 v_ArrVal_2902)) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199|) 0) 0))))))) (.cse3 (forall ((v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_57 Int) (v_prenex_56 (Array Int Int))) (let ((.cse56 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_prenex_57)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_56))) (let ((.cse57 (select .cse56 |c_~#q~0.base|))) (or (= v_prenex_24 |c_~#q~0.base|) (not (= (select (select (store .cse56 |c_~#q~0.base| (store .cse57 .cse8 v_prenex_25)) v_prenex_24) 0) 0)) (< (select .cse57 .cse6) 17)))))) (.cse12 (< 8589934551 |c_~#q~0.offset|)) (.cse19 (forall ((|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| Int)) (or (not (= (select (select |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200|) 0) 0)) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| |c_StealerThread1of1ForFork0_readV_~v#1.base|)))) (.cse1 (not .cse4)) (.cse33 (forall ((v_ArrVal_2901 (Array Int Int)) (v_prenex_29 Int) (v_prenex_30 Int) (v_ArrVal_2898 Int) (v_ArrVal_2907 (Array Int Int))) (let ((.cse55 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_ArrVal_2898)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse54 (select .cse55 |c_~#q~0.base|))) (let ((.cse53 (store .cse55 |c_~#q~0.base| (store .cse54 .cse8 v_prenex_30)))) (or (= v_prenex_29 |c_~#q~0.base|) (not (= (select (select .cse53 v_prenex_29) 0) 0)) (< (select v_ArrVal_2907 0) 18) (= (select .cse54 .cse29) 0) (<= 0 (select (select (store .cse53 v_prenex_29 v_ArrVal_2907) |c_~#q~0.base|) .cse6)))))))) (.cse0 (not (= (select .cse36 0) 0))) (.cse2 (< |c_StealerThread1of1ForFork0_readV_~v#1.offset| 0)) (.cse16 (< .cse29 0)) (.cse24 ((as const (Array Int Int)) 0)) (.cse25 (select |c_#memory_int| 3))) (and (not (= 3 |c_ULTIMATE.start_main_~#handles~0#1.base|)) (or (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 (forall ((v_prenex_63 (Array Int Int)) (v_prenex_62 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| v_prenex_63) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_62))) (let ((.cse5 (select .cse7 |c_~#q~0.base|))) (or (= v_prenex_65 |c_~#q~0.base|) (< (select .cse5 .cse6) 17) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse5 .cse8 v_prenex_64)) v_prenex_65) 0) 0)))))) .cse2) (or (and (or .cse0 .cse9 .cse1 .cse2) (or .cse0 (forall ((v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_67 (Array Int Int)) (v_prenex_53 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| v_prenex_67) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_51))) (let ((.cse11 (select .cse10 |c_~#q~0.base|))) (or (not (= (select (select (store .cse10 |c_~#q~0.base| (store .cse11 .cse8 v_prenex_53)) v_prenex_52) 0) 0)) (<= 0 (select .cse11 .cse6)) (= v_prenex_52 |c_~#q~0.base|))))) .cse4 .cse2)) .cse12) (or .cse0 .cse4 (forall ((v_prenex_61 (Array Int Int)) (v_prenex_58 Int) (v_prenex_59 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| v_prenex_61) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_59))) (let ((.cse14 (select .cse13 |c_~#q~0.base|))) (or (not (= (select (select (store .cse13 |c_~#q~0.base| (store .cse14 .cse8 v_prenex_60)) v_prenex_58) 0) 0)) (<= 0 (+ 40 |c_~#q~0.offset| (* (select .cse14 .cse6) 4))) (= v_prenex_58 |c_~#q~0.base|))))) .cse2) (or .cse15 .cse0 .cse1 .cse2)) .cse16) (= (select |c_#valid| 3) 1) (or (and (or .cse4 (forall ((v_prenex_61 (Array Int Int)) (v_prenex_58 Int) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| Int) (v_prenex_59 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse17 (store (store |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| v_prenex_61) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_59))) (let ((.cse18 (select .cse17 |c_~#q~0.base|))) (or (not (= (select (select (store .cse17 |c_~#q~0.base| (store .cse18 .cse8 v_prenex_60)) v_prenex_58) 0) 0)) (not (= (select (select |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200|) 0) 0)) (<= 0 (+ 40 (* (select .cse18 .cse6) 4) |c_~#q~0.offset|)) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| |c_StealerThread1of1ForFork0_readV_~v#1.base|) (= v_prenex_58 |c_~#q~0.base|))))) .cse2) (or .cse15 .cse19 .cse1 .cse2) (or .cse4 (forall ((v_prenex_63 (Array Int Int)) (v_prenex_62 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| Int)) (let ((.cse21 (store (store |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| v_prenex_63) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_62))) (let ((.cse20 (select .cse21 |c_~#q~0.base|))) (or (= v_prenex_65 |c_~#q~0.base|) (not (= (select (select |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200|) 0) 0)) (< (select .cse20 .cse6) 17) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| |c_StealerThread1of1ForFork0_readV_~v#1.base|) (not (= (select (select (store .cse21 |c_~#q~0.base| (store .cse20 .cse8 v_prenex_64)) v_prenex_65) 0) 0)))))) .cse2) (or (and (or .cse4 (forall ((v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_67 (Array Int Int)) (v_prenex_53 Int) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| Int)) (let ((.cse23 (store (store |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| v_prenex_67) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_51))) (let ((.cse22 (select .cse23 |c_~#q~0.base|))) (or (<= 0 (select .cse22 .cse6)) (not (= (select (select (store .cse23 |c_~#q~0.base| (store .cse22 .cse8 v_prenex_53)) v_prenex_52) 0) 0)) (not (= (select (select |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200|) 0) 0)) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| |c_StealerThread1of1ForFork0_readV_~v#1.base|) (= v_prenex_52 |c_~#q~0.base|))))) .cse2) (or .cse19 .cse9 .cse1 .cse2)) .cse12) (or .cse19 .cse1 .cse2 .cse3)) .cse16) (= |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset| 0) (exists ((v_ArrVal_2881 Int) (v_ArrVal_2884 Int) (v_ArrVal_2898 Int)) (= (store (store (store (store (store (store .cse24 24 v_ArrVal_2881) 28 v_ArrVal_2884) 32 0) 104 1) 36 0) 32 v_ArrVal_2898) .cse25)) (or (not (= (select (select |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|) 0)) (let ((.cse26 (not (= (select |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) 1))) (.cse31 (< |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset| 0)) (.cse32 (not (= (select |c_#valid| |c_StealerThread1of1ForFork0_readV_~v#1.base|) 1)))) (and (or (and (or .cse4 .cse26 (forall ((v_ArrVal_2901 (Array Int Int)) (v_prenex_29 Int) (v_ArrVal_2897 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_2907 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse28 (select .cse30 |c_~#q~0.base|))) (let ((.cse27 (store .cse30 |c_~#q~0.base| (store .cse28 .cse8 v_prenex_30)))) (or (not (= (select (select .cse27 v_prenex_29) 0) 0)) (= (select .cse28 .cse29) 0) (= v_prenex_29 |c_~#q~0.base|) (< (select v_ArrVal_2907 0) 18) (<= 0 (select (select (store .cse27 v_prenex_29 v_ArrVal_2907) |c_~#q~0.base|) .cse6))))))) .cse2 .cse31 .cse32) (or .cse33 .cse26 .cse1 .cse2 .cse31 .cse32)) .cse16) (or (and (or .cse26 .cse1 .cse2 (forall ((v_prenex_27 Int) (v_ArrVal_2901 (Array Int Int)) (v_prenex_28 Int) (v_ArrVal_2898 Int)) (let ((.cse35 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_ArrVal_2898)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse34 (select .cse35 |c_~#q~0.base|))) (or (<= 0 (+ 40 |c_~#q~0.offset| (* (select .cse34 .cse6) 4))) (= v_prenex_27 |c_~#q~0.base|) (not (= (select (select (store .cse35 |c_~#q~0.base| (store .cse34 .cse8 v_prenex_28)) v_prenex_27) 0) 0)))))) .cse31 .cse32) (or .cse4 .cse26 (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_prenex_25 Int) (v_prenex_24 Int)) (let ((.cse37 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse38 (select .cse37 |c_~#q~0.base|))) (or (= v_prenex_24 |c_~#q~0.base|) (not (= (select (select (store .cse37 |c_~#q~0.base| (store .cse38 .cse8 v_prenex_25)) v_prenex_24) 0) 0)) (< (select .cse38 .cse6) 17))))) .cse2 .cse31 .cse32) (or (and (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| Int) (v_ArrVal_2902 Int)) (let ((.cse39 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse40 (select .cse39 |c_~#q~0.base|))) (or (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| |c_~#q~0.base|) (not (= 0 (select (select (store .cse39 |c_~#q~0.base| (store .cse40 .cse8 v_ArrVal_2902)) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199|) 0))) (<= 0 (select .cse40 .cse6)))))) .cse4 .cse26 .cse2 .cse31 .cse32) (or .cse26 .cse1 (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2898 Int) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| Int) (v_ArrVal_2902 Int)) (let ((.cse42 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_ArrVal_2898)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse41 (select .cse42 |c_~#q~0.base|))) (or (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199| |c_~#q~0.base|) (<= 0 (select .cse41 .cse6)) (not (= (select (select (store .cse42 |c_~#q~0.base| (store .cse41 .cse8 v_ArrVal_2902)) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_199|) 0) 0)))))) .cse2 .cse31 .cse32)) .cse12) (or .cse4 .cse26 .cse2 .cse31 .cse32 (forall ((v_prenex_27 Int) (v_ArrVal_2901 (Array Int Int)) (v_prenex_28 Int) (v_ArrVal_2897 (Array Int Int))) (let ((.cse44 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse43 (select .cse44 |c_~#q~0.base|))) (or (= v_prenex_27 |c_~#q~0.base|) (<= 0 (+ 40 |c_~#q~0.offset| (* (select .cse43 .cse6) 4))) (not (= (select (select (store .cse44 |c_~#q~0.base| (store .cse43 .cse8 v_prenex_28)) v_prenex_27) 0) 0))))))) (or .cse26 .cse1 (forall ((v_ArrVal_2901 (Array Int Int)) (v_prenex_25 Int) (v_prenex_24 Int) (v_ArrVal_2898 Int)) (let ((.cse46 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| (store .cse36 |c_StealerThread1of1ForFork0_readV_~v#1.offset| v_ArrVal_2898)) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_2901))) (let ((.cse45 (select .cse46 |c_~#q~0.base|))) (or (= v_prenex_24 |c_~#q~0.base|) (< (select .cse45 .cse6) 17) (not (= (select (select (store .cse46 |c_~#q~0.base| (store .cse45 .cse8 v_prenex_25)) v_prenex_24) 0) 0)))))) .cse2 .cse31 .cse32)) .cse16)))) (= 3 |c_StealerThread1of1ForFork0_readV_~v#1.base|) (= |c_~#q~0.offset| 0) (= 3 |c_~#q~0.base|) (not (= 3 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|)) (or (and (or .cse4 (forall ((v_prenex_50 (Array Int Int)) (v_prenex_49 Int) (v_prenex_48 Int) (v_ArrVal_2897 (Array Int Int)) (v_prenex_47 (Array Int Int)) (|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| Int)) (let ((.cse49 (store (store |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_47))) (let ((.cse48 (select .cse49 |c_~#q~0.base|))) (let ((.cse47 (store .cse49 |c_~#q~0.base| (store .cse48 .cse8 v_prenex_49)))) (or (not (= 0 (select (select .cse47 v_prenex_48) 0))) (not (= (select (select |c_#memory_int| |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200|) 0) 0)) (< (select v_prenex_50 0) 18) (<= 0 (select (select (store .cse47 v_prenex_48 v_prenex_50) |c_~#q~0.base|) .cse6)) (= v_prenex_48 |c_~#q~0.base|) (= (select .cse48 .cse29) 0) (= |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_200| |c_StealerThread1of1ForFork0_readV_~v#1.base|)))))) .cse2) (or .cse33 .cse19 .cse1 .cse2)) .cse16) (= 32 |c_StealerThread1of1ForFork0_writeV_~v#1.offset|) (or (and (or .cse0 .cse33 .cse2) (or (forall ((v_prenex_49 Int) (v_prenex_50 (Array Int Int)) (v_prenex_48 Int) (v_ArrVal_2897 (Array Int Int)) (v_prenex_47 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_int| |c_StealerThread1of1ForFork0_readV_~v#1.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#handles~0#1.base| v_prenex_47))) (let ((.cse51 (select .cse52 |c_~#q~0.base|))) (let ((.cse50 (store .cse52 |c_~#q~0.base| (store .cse51 .cse8 v_prenex_49)))) (or (<= 0 (select (select (store .cse50 v_prenex_48 v_prenex_50) |c_~#q~0.base|) .cse6)) (< (select v_prenex_50 0) 18) (not (= (select (select .cse50 v_prenex_48) 0) 0)) (= v_prenex_48 |c_~#q~0.base|) (= (select .cse51 .cse29) 0)))))) .cse0 .cse4 .cse2)) .cse16) (exists ((v_ArrVal_2881 Int) (v_ArrVal_2884 Int) (v_ArrVal_2902 Int)) (= (store (store (store (store (store (store .cse24 24 v_ArrVal_2881) 28 v_ArrVal_2884) 32 0) 104 1) 36 0) 32 v_ArrVal_2902) .cse25)) (= |c_StealerThread1of1ForFork0_writeV_~v#1.base| 3) (= |c_StealerThread1of1ForFork0_readV_~v#1.offset| 36))))) is different from true [2023-08-29 21:14:41,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:14:50,156 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 21:15:02,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:15:04,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:15:06,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:15:08,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:15:09,967 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 21:15:17,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:15:41,215 WARN L222 SmtUtils]: Spent 14.64s on a formula simplification. DAG size of input: 243 DAG size of output: 231 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:15:43,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:15:47,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:15:50,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:15:53,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:16:02,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:16:03,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:16:05,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:16:26,055 WARN L222 SmtUtils]: Spent 16.54s on a formula simplification. DAG size of input: 274 DAG size of output: 265 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:16:27,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:16:30,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:16:39,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:16:41,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:16:43,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:16:46,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:16:53,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:16:56,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:17:01,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:17:04,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:17:06,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:17:11,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:17:13,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:17:15,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:17:21,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:17:26,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:17:27,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:17:31,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:17:34,419 INFO L130 PetriNetUnfolder]: 527/2319 cut-off events. [2023-08-29 21:17:34,419 INFO L131 PetriNetUnfolder]: For 20585/20585 co-relation queries the response was YES. [2023-08-29 21:17:34,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12393 conditions, 2319 events. 527/2319 cut-off events. For 20585/20585 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 18055 event pairs, 152 based on Foata normal form. 7/2045 useless extension candidates. Maximal degree in co-relation 12334. Up to 1128 conditions per place. [2023-08-29 21:17:34,433 INFO L137 encePairwiseOnDemand]: 4698/4723 looper letters, 299 selfloop transitions, 122 changer transitions 0/422 dead transitions. [2023-08-29 21:17:34,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 422 transitions, 6405 flow [2023-08-29 21:17:34,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-29 21:17:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-29 21:17:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51341 transitions. [2023-08-29 21:17:34,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25280049633411955 [2023-08-29 21:17:34,465 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 51341 transitions. [2023-08-29 21:17:34,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 51341 transitions. [2023-08-29 21:17:34,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:17:34,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 51341 transitions. [2023-08-29 21:17:34,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 1193.9767441860465) internal successors, (51341), 43 states have internal predecessors, (51341), 0 states have call successors, (0), 0 states 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 21:17:34,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 4723.0) internal successors, (207812), 44 states have internal predecessors, (207812), 0 states have call successors, (0), 0 states 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 21:17:34,609 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 4723.0) internal successors, (207812), 44 states have internal predecessors, (207812), 0 states have call successors, (0), 0 states 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 21:17:34,609 INFO L175 Difference]: Start difference. First operand has 200 places, 318 transitions, 4595 flow. Second operand 43 states and 51341 transitions. [2023-08-29 21:17:34,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 422 transitions, 6405 flow [2023-08-29 21:17:34,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 422 transitions, 6394 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-29 21:17:34,652 INFO L231 Difference]: Finished difference. Result has 258 places, 361 transitions, 5531 flow [2023-08-29 21:17:34,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=4483, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=5531, PETRI_PLACES=258, PETRI_TRANSITIONS=361} [2023-08-29 21:17:34,653 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -499 predicate places. [2023-08-29 21:17:34,653 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 361 transitions, 5531 flow [2023-08-29 21:17:34,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1191.5) internal successors, (54809), 46 states have internal predecessors, (54809), 0 states have call successors, (0), 0 states 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 21:17:34,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:17:34,657 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:17:34,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-29 21:17:34,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-29 21:17:34,861 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting StealerErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:17:34,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:17:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1392846655, now seen corresponding path program 1 times [2023-08-29 21:17:34,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:17:34,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485252328] [2023-08-29 21:17:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:17:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:17:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:17:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:17:35,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:17:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485252328] [2023-08-29 21:17:35,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485252328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:17:35,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:17:35,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:17:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837597635] [2023-08-29 21:17:35,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:17:35,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 21:17:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:17:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 21:17:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 21:17:36,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1756 out of 4723 [2023-08-29 21:17:36,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 361 transitions, 5531 flow. Second operand has 5 states, 5 states have (on average 1760.4) internal successors, (8802), 5 states have internal predecessors, (8802), 0 states have call successors, (0), 0 states 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 21:17:36,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:17:36,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1756 of 4723 [2023-08-29 21:17:36,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:17:37,178 INFO L130 PetriNetUnfolder]: 487/2263 cut-off events. [2023-08-29 21:17:37,178 INFO L131 PetriNetUnfolder]: For 24493/24493 co-relation queries the response was YES. [2023-08-29 21:17:37,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13157 conditions, 2263 events. 487/2263 cut-off events. For 24493/24493 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 17691 event pairs, 240 based on Foata normal form. 0/2030 useless extension candidates. Maximal degree in co-relation 13082. Up to 1558 conditions per place. [2023-08-29 21:17:37,192 INFO L137 encePairwiseOnDemand]: 4718/4723 looper letters, 301 selfloop transitions, 23 changer transitions 0/381 dead transitions. [2023-08-29 21:17:37,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 381 transitions, 6335 flow [2023-08-29 21:17:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:17:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:17:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10612 transitions. [2023-08-29 21:17:37,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3744794974945303 [2023-08-29 21:17:37,198 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 10612 transitions. [2023-08-29 21:17:37,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 10612 transitions. [2023-08-29 21:17:37,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:17:37,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 10612 transitions. [2023-08-29 21:17:37,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1768.6666666666667) internal successors, (10612), 6 states have internal predecessors, (10612), 0 states have call successors, (0), 0 states 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 21:17:37,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 4723.0) internal successors, (33061), 7 states have internal predecessors, (33061), 0 states have call successors, (0), 0 states 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 21:17:37,217 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 4723.0) internal successors, (33061), 7 states have internal predecessors, (33061), 0 states have call successors, (0), 0 states 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 21:17:37,217 INFO L175 Difference]: Start difference. First operand has 258 places, 361 transitions, 5531 flow. Second operand 6 states and 10612 transitions. [2023-08-29 21:17:37,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 381 transitions, 6335 flow [2023-08-29 21:17:37,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 381 transitions, 6120 flow, removed 30 selfloop flow, removed 14 redundant places. [2023-08-29 21:17:37,269 INFO L231 Difference]: Finished difference. Result has 250 places, 363 transitions, 5399 flow [2023-08-29 21:17:37,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=5317, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5399, PETRI_PLACES=250, PETRI_TRANSITIONS=363} [2023-08-29 21:17:37,270 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -507 predicate places. [2023-08-29 21:17:37,270 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 363 transitions, 5399 flow [2023-08-29 21:17:37,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1760.4) internal successors, (8802), 5 states have internal predecessors, (8802), 0 states have call successors, (0), 0 states 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 21:17:37,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:17:37,271 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:17:37,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-29 21:17:37,272 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting StealerErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:17:37,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:17:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash -925345646, now seen corresponding path program 1 times [2023-08-29 21:17:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:17:37,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666191844] [2023-08-29 21:17:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:17:37,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:17:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:17:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:17:37,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:17:37,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666191844] [2023-08-29 21:17:37,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666191844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:17:37,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:17:37,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:17:37,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847440414] [2023-08-29 21:17:37,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:17:37,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 21:17:37,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:17:37,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 21:17:37,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 21:17:38,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1752 out of 4723 [2023-08-29 21:17:38,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 363 transitions, 5399 flow. Second operand has 5 states, 5 states have (on average 1756.4) internal successors, (8782), 5 states have internal predecessors, (8782), 0 states have call successors, (0), 0 states 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 21:17:38,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:17:38,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1752 of 4723 [2023-08-29 21:17:38,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:17:39,309 INFO L130 PetriNetUnfolder]: 623/2912 cut-off events. [2023-08-29 21:17:39,309 INFO L131 PetriNetUnfolder]: For 29512/29512 co-relation queries the response was YES. [2023-08-29 21:17:39,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17250 conditions, 2912 events. 623/2912 cut-off events. For 29512/29512 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 24705 event pairs, 207 based on Foata normal form. 25/2693 useless extension candidates. Maximal degree in co-relation 17175. Up to 1211 conditions per place. [2023-08-29 21:17:39,330 INFO L137 encePairwiseOnDemand]: 4712/4723 looper letters, 355 selfloop transitions, 134 changer transitions 0/496 dead transitions. [2023-08-29 21:17:39,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 496 transitions, 8339 flow [2023-08-29 21:17:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 21:17:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 21:17:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12344 transitions. [2023-08-29 21:17:39,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3733704364659266 [2023-08-29 21:17:39,337 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 12344 transitions. [2023-08-29 21:17:39,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 12344 transitions. [2023-08-29 21:17:39,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:17:39,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 12344 transitions. [2023-08-29 21:17:39,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 1763.4285714285713) internal successors, (12344), 7 states have internal predecessors, (12344), 0 states have call successors, (0), 0 states 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 21:17:39,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 4723.0) internal successors, (37784), 8 states have internal predecessors, (37784), 0 states have call successors, (0), 0 states 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 21:17:39,359 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 4723.0) internal successors, (37784), 8 states have internal predecessors, (37784), 0 states have call successors, (0), 0 states 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 21:17:39,359 INFO L175 Difference]: Start difference. First operand has 250 places, 363 transitions, 5399 flow. Second operand 7 states and 12344 transitions. [2023-08-29 21:17:39,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 496 transitions, 8339 flow [2023-08-29 21:17:39,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 496 transitions, 8307 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-29 21:17:39,431 INFO L231 Difference]: Finished difference. Result has 258 places, 440 transitions, 7312 flow [2023-08-29 21:17:39,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=5372, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7312, PETRI_PLACES=258, PETRI_TRANSITIONS=440} [2023-08-29 21:17:39,432 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -499 predicate places. [2023-08-29 21:17:39,432 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 440 transitions, 7312 flow [2023-08-29 21:17:39,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1756.4) internal successors, (8782), 5 states have internal predecessors, (8782), 0 states have call successors, (0), 0 states 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 21:17:39,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:17:39,433 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:17:39,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-29 21:17:39,433 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:17:39,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:17:39,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1502965334, now seen corresponding path program 1 times [2023-08-29 21:17:39,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:17:39,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634150864] [2023-08-29 21:17:39,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:17:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:17:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:17:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:17:39,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:17:39,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634150864] [2023-08-29 21:17:39,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634150864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:17:39,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:17:39,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 21:17:39,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155355713] [2023-08-29 21:17:39,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:17:39,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 21:17:39,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:17:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 21:17:39,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 21:17:40,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1761 out of 4723 [2023-08-29 21:17:40,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 440 transitions, 7312 flow. Second operand has 4 states, 4 states have (on average 1766.75) internal successors, (7067), 4 states have internal predecessors, (7067), 0 states have call successors, (0), 0 states 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 21:17:40,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:17:40,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1761 of 4723 [2023-08-29 21:17:40,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:17:41,030 INFO L130 PetriNetUnfolder]: 603/2853 cut-off events. [2023-08-29 21:17:41,030 INFO L131 PetriNetUnfolder]: For 33803/33803 co-relation queries the response was YES. [2023-08-29 21:17:41,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17703 conditions, 2853 events. 603/2853 cut-off events. For 33803/33803 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 24156 event pairs, 186 based on Foata normal form. 0/2689 useless extension candidates. Maximal degree in co-relation 17624. Up to 1439 conditions per place. [2023-08-29 21:17:41,052 INFO L137 encePairwiseOnDemand]: 4717/4723 looper letters, 331 selfloop transitions, 44 changer transitions 1/457 dead transitions. [2023-08-29 21:17:41,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 457 transitions, 8299 flow [2023-08-29 21:17:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:17:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:17:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8860 transitions. [2023-08-29 21:17:41,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37518526360364174 [2023-08-29 21:17:41,058 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 8860 transitions. [2023-08-29 21:17:41,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 8860 transitions. [2023-08-29 21:17:41,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:17:41,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 8860 transitions. [2023-08-29 21:17:41,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1772.0) internal successors, (8860), 5 states have internal predecessors, (8860), 0 states have call successors, (0), 0 states 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 21:17:41,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 4723.0) internal successors, (28338), 6 states have internal predecessors, (28338), 0 states have call successors, (0), 0 states 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 21:17:41,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 4723.0) internal successors, (28338), 6 states have internal predecessors, (28338), 0 states have call successors, (0), 0 states 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 21:17:41,073 INFO L175 Difference]: Start difference. First operand has 258 places, 440 transitions, 7312 flow. Second operand 5 states and 8860 transitions. [2023-08-29 21:17:41,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 457 transitions, 8299 flow [2023-08-29 21:17:41,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 457 transitions, 8295 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:17:41,152 INFO L231 Difference]: Finished difference. Result has 260 places, 439 transitions, 7392 flow [2023-08-29 21:17:41,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=7304, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7392, PETRI_PLACES=260, PETRI_TRANSITIONS=439} [2023-08-29 21:17:41,153 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -497 predicate places. [2023-08-29 21:17:41,153 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 439 transitions, 7392 flow [2023-08-29 21:17:41,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1766.75) internal successors, (7067), 4 states have internal predecessors, (7067), 0 states have call successors, (0), 0 states 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 21:17:41,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:17:41,154 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:17:41,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-29 21:17:41,157 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting StealerErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:17:41,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:17:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1502965335, now seen corresponding path program 1 times [2023-08-29 21:17:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:17:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048299903] [2023-08-29 21:17:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:17:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:17:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:17:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:17:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:17:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048299903] [2023-08-29 21:17:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048299903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:17:41,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:17:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 21:17:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250380668] [2023-08-29 21:17:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:17:41,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:17:41,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:17:41,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:17:41,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:17:42,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1762 out of 4723 [2023-08-29 21:17:42,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 439 transitions, 7392 flow. Second operand has 6 states, 6 states have (on average 1766.0) internal successors, (10596), 6 states have internal predecessors, (10596), 0 states have call successors, (0), 0 states 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 21:17:42,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:17:42,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1762 of 4723 [2023-08-29 21:17:42,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:17:43,009 INFO L130 PetriNetUnfolder]: 593/2789 cut-off events. [2023-08-29 21:17:43,010 INFO L131 PetriNetUnfolder]: For 34305/34305 co-relation queries the response was YES. [2023-08-29 21:17:43,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17742 conditions, 2789 events. 593/2789 cut-off events. For 34305/34305 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 23417 event pairs, 276 based on Foata normal form. 40/2665 useless extension candidates. Maximal degree in co-relation 17662. Up to 2311 conditions per place. [2023-08-29 21:17:43,032 INFO L137 encePairwiseOnDemand]: 4719/4723 looper letters, 425 selfloop transitions, 8 changer transitions 1/442 dead transitions. [2023-08-29 21:17:43,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 442 transitions, 8319 flow [2023-08-29 21:17:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:17:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:17:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7092 transitions. [2023-08-29 21:17:43,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37539699343637517 [2023-08-29 21:17:43,037 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 7092 transitions. [2023-08-29 21:17:43,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 7092 transitions. [2023-08-29 21:17:43,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:17:43,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 7092 transitions. [2023-08-29 21:17:43,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 1773.0) internal successors, (7092), 4 states have internal predecessors, (7092), 0 states have call successors, (0), 0 states 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 21:17:43,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 4723.0) internal successors, (23615), 5 states have internal predecessors, (23615), 0 states have call successors, (0), 0 states 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 21:17:43,050 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 4723.0) internal successors, (23615), 5 states have internal predecessors, (23615), 0 states have call successors, (0), 0 states 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 21:17:43,050 INFO L175 Difference]: Start difference. First operand has 260 places, 439 transitions, 7392 flow. Second operand 4 states and 7092 transitions. [2023-08-29 21:17:43,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 442 transitions, 8319 flow [2023-08-29 21:17:43,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 442 transitions, 8271 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:17:43,132 INFO L231 Difference]: Finished difference. Result has 259 places, 438 transitions, 7356 flow [2023-08-29 21:17:43,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=7340, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7356, PETRI_PLACES=259, PETRI_TRANSITIONS=438} [2023-08-29 21:17:43,133 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -498 predicate places. [2023-08-29 21:17:43,133 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 438 transitions, 7356 flow [2023-08-29 21:17:43,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1766.0) internal successors, (10596), 6 states have internal predecessors, (10596), 0 states have call successors, (0), 0 states 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 21:17:43,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:17:43,134 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:17:43,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-29 21:17:43,134 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:17:43,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:17:43,134 INFO L85 PathProgramCache]: Analyzing trace with hash 277525524, now seen corresponding path program 1 times [2023-08-29 21:17:43,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:17:43,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230500034] [2023-08-29 21:17:43,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:17:43,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:17:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:17:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:17:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:17:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230500034] [2023-08-29 21:17:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230500034] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:17:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936356905] [2023-08-29 21:17:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:17:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:17:43,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:17:43,216 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:17:43,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-29 21:17:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:17:43,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:17:43,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:17:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:17:43,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:17:43,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936356905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:17:43,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:17:43,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-29 21:17:43,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081979921] [2023-08-29 21:17:43,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:17:43,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 21:17:43,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:17:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 21:17:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 21:17:43,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1791 out of 4723 [2023-08-29 21:17:43,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 438 transitions, 7356 flow. Second operand has 4 states, 4 states have (on average 1796.75) internal successors, (7187), 4 states have internal predecessors, (7187), 0 states have call successors, (0), 0 states 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 21:17:43,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:17:43,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1791 of 4723 [2023-08-29 21:17:43,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:17:43,794 INFO L130 PetriNetUnfolder]: 42/418 cut-off events. [2023-08-29 21:17:43,794 INFO L131 PetriNetUnfolder]: For 6322/6322 co-relation queries the response was YES. [2023-08-29 21:17:43,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2871 conditions, 418 events. 42/418 cut-off events. For 6322/6322 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2793 event pairs, 6 based on Foata normal form. 36/433 useless extension candidates. Maximal degree in co-relation 2791. Up to 306 conditions per place. [2023-08-29 21:17:43,796 INFO L137 encePairwiseOnDemand]: 4719/4723 looper letters, 80 selfloop transitions, 2 changer transitions 78/167 dead transitions. [2023-08-29 21:17:43,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 167 transitions, 3074 flow [2023-08-29 21:17:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:17:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:17:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7199 transitions. [2023-08-29 21:17:43,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3810607664619945 [2023-08-29 21:17:43,801 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 7199 transitions. [2023-08-29 21:17:43,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 7199 transitions. [2023-08-29 21:17:43,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:17:43,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 7199 transitions. [2023-08-29 21:17:43,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 1799.75) internal successors, (7199), 4 states have internal predecessors, (7199), 0 states have call successors, (0), 0 states 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 21:17:43,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 4723.0) internal successors, (23615), 5 states have internal predecessors, (23615), 0 states have call successors, (0), 0 states 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 21:17:43,813 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 4723.0) internal successors, (23615), 5 states have internal predecessors, (23615), 0 states have call successors, (0), 0 states 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 21:17:43,814 INFO L175 Difference]: Start difference. First operand has 259 places, 438 transitions, 7356 flow. Second operand 4 states and 7199 transitions. [2023-08-29 21:17:43,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 167 transitions, 3074 flow [2023-08-29 21:17:43,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 167 transitions, 1976 flow, removed 4 selfloop flow, removed 59 redundant places. [2023-08-29 21:17:43,830 INFO L231 Difference]: Finished difference. Result has 166 places, 89 transitions, 766 flow [2023-08-29 21:17:43,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=4723, PETRI_DIFFERENCE_MINUEND_FLOW=1614, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=766, PETRI_PLACES=166, PETRI_TRANSITIONS=89} [2023-08-29 21:17:43,830 INFO L281 CegarLoopForPetriNet]: 757 programPoint places, -591 predicate places. [2023-08-29 21:17:43,830 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 89 transitions, 766 flow [2023-08-29 21:17:43,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1796.75) internal successors, (7187), 4 states have internal predecessors, (7187), 0 states have call successors, (0), 0 states 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 21:17:43,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:17:43,831 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:17:43,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-29 21:17:44,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:17:44,031 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 561 more)] === [2023-08-29 21:17:44,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:17:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash 652722539, now seen corresponding path program 1 times [2023-08-29 21:17:44,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:17:44,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174992606] [2023-08-29 21:17:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:17:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:17:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:17:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 21:17:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:17:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174992606] [2023-08-29 21:17:47,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174992606] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:17:47,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474951249] [2023-08-29 21:17:47,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:17:47,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:17:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:17:47,723 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:17:47,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-29 21:17:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:17:48,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 163 conjunts are in the unsatisfiable core [2023-08-29 21:17:48,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:17:48,038 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:17:48,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:17:48,042 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 22 treesize of output 21 [2023-08-29 21:17:48,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:17:48,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:17:48,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:17:48,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:17:48,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-29 21:17:49,008 INFO L321 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2023-08-29 21:17:49,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 170 [2023-08-29 21:17:49,025 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-29 21:17:49,026 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 39 treesize of output 23 [2023-08-29 21:17:49,409 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-29 21:17:49,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 21:17:49,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:17:49,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2023-08-29 21:17:49,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:17:49,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:17:49,804 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 21:17:49,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2023-08-29 21:17:49,822 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-29 21:17:49,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 21:17:50,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:17:50,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 134 [2023-08-29 21:17:50,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:17:50,265 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 38 treesize of output 22 [2023-08-29 21:17:50,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:17:50,364 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 21:17:50,379 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-29 21:17:50,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 21:17:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 21:17:50,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:17:50,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:17:50,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 133 [2023-08-29 21:17:50,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:17:50,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 127 [2023-08-29 21:17:50,880 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 100 treesize of output 96 [2023-08-29 21:17:55,218 INFO L321 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2023-08-29 21:17:55,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 357 treesize of output 399 [2023-08-29 21:17:55,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:17:55,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 378 treesize of output 410 [2023-08-29 21:17:55,337 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:17:55,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 154 [2023-08-29 21:17:55,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:17:55,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 148 [2023-08-29 21:18:08,342 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 19 treesize of output 17 [2023-08-29 21:18:08,813 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 12 [2023-08-29 21:18:09,588 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 19 treesize of output 17 [2023-08-29 21:18:10,277 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 12 [2023-08-29 21:18:14,179 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 12 [2023-08-29 21:18:15,282 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 19 treesize of output 17 [2023-08-29 21:18:18,353 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 12 [2023-08-29 21:18:18,373 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 19 treesize of output 17 [2023-08-29 21:18:18,425 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 12 [2023-08-29 21:18:18,445 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 19 treesize of output 17 [2023-08-29 21:18:19,653 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 12 [2023-08-29 21:18:20,182 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 19 treesize of output 17 [2023-08-29 21:18:21,429 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 12 [2023-08-29 21:18:21,933 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 19 treesize of output 17 [2023-08-29 21:18:24,331 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 12 [2023-08-29 21:18:25,166 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 19 treesize of output 17 [2023-08-29 21:18:27,510 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 12 [2023-08-29 21:18:27,565 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 19 treesize of output 17 [2023-08-29 21:18:33,459 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 12 [2023-08-29 21:18:33,530 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 19 treesize of output 17 [2023-08-29 21:18:40,290 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 12 [2023-08-29 21:18:40,376 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 19 treesize of output 17 Killed by 15