./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:15:28,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:15:28,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:15:28,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:15:28,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:15:28,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:15:28,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:15:28,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:15:28,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:15:28,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:15:28,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:15:28,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:15:28,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:15:28,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:15:28,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:15:28,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:15:28,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:15:28,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:15:28,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:15:28,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:15:28,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:15:28,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:15:28,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:15:28,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:15:28,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:15:28,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:15:28,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:15:28,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:15:28,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:15:28,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:15:28,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:15:28,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:15:28,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:15:28,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:15:28,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:15:28,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:15:28,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:15:28,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:15:28,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:15:28,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:15:28,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:15:28,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:15:28,805 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:15:28,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:15:28,806 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:15:28,806 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:15:28,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:15:28,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:15:28,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:15:28,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:15:28,808 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:15:28,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:15:28,809 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:15:28,810 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:15:28,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:15:28,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:15:28,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:15:28,810 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:15:28,810 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:15:28,811 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:15:28,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:15:28,811 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:15:28,811 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:15:28,811 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:15:28,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:15:28,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:15:28,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:15:28,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:15:28,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:15:28,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:15:28,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:15:28,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:15:28,813 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:15:28,813 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:15:28,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:15:28,814 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:15:28,814 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:15:29,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:15:29,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:15:29,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:15:29,114 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:15:29,115 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:15:29,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-30 02:15:30,277 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:15:30,578 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:15:30,579 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-30 02:15:30,589 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d461908d8/187e1f69f8c74e7291f6af416c9d383f/FLAG9467cca67 [2023-08-30 02:15:30,608 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d461908d8/187e1f69f8c74e7291f6af416c9d383f [2023-08-30 02:15:30,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:15:30,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:15:30,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:15:30,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:15:30,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:15:30,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:15:30" (1/1) ... [2023-08-30 02:15:30,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65eb5aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:30, skipping insertion in model container [2023-08-30 02:15:30,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:15:30" (1/1) ... [2023-08-30 02:15:30,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:15:30,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:15:31,089 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2023-08-30 02:15:31,097 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2023-08-30 02:15:31,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:15:31,115 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:15:31,171 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2023-08-30 02:15:31,176 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2023-08-30 02:15:31,185 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:15:31,258 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:15:31,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31 WrapperNode [2023-08-30 02:15:31,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:15:31,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:15:31,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:15:31,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:15:31,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,337 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-08-30 02:15:31,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:15:31,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:15:31,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:15:31,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:15:31,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:15:31,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:15:31,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:15:31,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:15:31,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (1/1) ... [2023-08-30 02:15:31,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:15:31,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:15:31,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:15:31,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:15:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-30 02:15:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-30 02:15:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-30 02:15:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-30 02:15:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:15:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:15:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 02:15:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:15:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 02:15:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:15:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:15:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:15:31,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:15:31,467 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:15:31,674 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:15:31,676 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:15:32,147 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:15:32,155 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:15:32,161 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 02:15:32,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:15:32 BoogieIcfgContainer [2023-08-30 02:15:32,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:15:32,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:15:32,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:15:32,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:15:32,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:15:30" (1/3) ... [2023-08-30 02:15:32,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2978e1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:15:32, skipping insertion in model container [2023-08-30 02:15:32,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:15:31" (2/3) ... [2023-08-30 02:15:32,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2978e1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:15:32, skipping insertion in model container [2023-08-30 02:15:32,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:15:32" (3/3) ... [2023-08-30 02:15:32,184 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-08-30 02:15:32,196 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:15:32,196 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-30 02:15:32,197 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:15:32,311 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 02:15:32,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 278 transitions, 572 flow [2023-08-30 02:15:32,476 INFO L130 PetriNetUnfolder]: 13/276 cut-off events. [2023-08-30 02:15:32,476 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:15:32,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 276 events. 13/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 677 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 185. Up to 3 conditions per place. [2023-08-30 02:15:32,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 278 transitions, 572 flow [2023-08-30 02:15:32,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 272 transitions, 556 flow [2023-08-30 02:15:32,496 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:15:32,507 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-30 02:15:32,513 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-30 02:15:32,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 272 transitions, 556 flow [2023-08-30 02:15:32,586 INFO L130 PetriNetUnfolder]: 13/272 cut-off events. [2023-08-30 02:15:32,587 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:15:32,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 272 events. 13/272 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 660 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 185. Up to 3 conditions per place. [2023-08-30 02:15:32,598 INFO L119 LiptonReduction]: Number of co-enabled transitions 17820 [2023-08-30 02:15:44,885 INFO L134 LiptonReduction]: Checked pairs total: 64286 [2023-08-30 02:15:44,886 INFO L136 LiptonReduction]: Total number of compositions: 358 [2023-08-30 02:15:44,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:15:44,903 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;@2900b7f5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:15:44,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-08-30 02:15:44,904 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:15:44,904 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:15:44,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:44,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:15:44,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:44,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1161, now seen corresponding path program 1 times [2023-08-30 02:15:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941686751] [2023-08-30 02:15:44,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:44,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:45,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:45,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941686751] [2023-08-30 02:15:45,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941686751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:45,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:45,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:15:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797447062] [2023-08-30 02:15:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:45,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:15:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:45,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:15:45,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:15:45,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 636 [2023-08-30 02:15:45,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 267.5) internal successors, (535), 2 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:45,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:45,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 636 [2023-08-30 02:15:45,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:45,793 INFO L130 PetriNetUnfolder]: 3797/6059 cut-off events. [2023-08-30 02:15:45,794 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-30 02:15:45,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11913 conditions, 6059 events. 3797/6059 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 34868 event pairs, 3185 based on Foata normal form. 0/3159 useless extension candidates. Maximal degree in co-relation 11458. Up to 5786 conditions per place. [2023-08-30 02:15:45,826 INFO L137 encePairwiseOnDemand]: 600/636 looper letters, 61 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2023-08-30 02:15:45,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 274 flow [2023-08-30 02:15:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:15:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:15:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 631 transitions. [2023-08-30 02:15:45,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960691823899371 [2023-08-30 02:15:45,846 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 631 transitions. [2023-08-30 02:15:45,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 631 transitions. [2023-08-30 02:15:45,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:45,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 631 transitions. [2023-08-30 02:15:45,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 315.5) internal successors, (631), 2 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:45,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:45,864 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:45,865 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 224 flow. Second operand 2 states and 631 transitions. [2023-08-30 02:15:45,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 274 flow [2023-08-30 02:15:45,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 266 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:15:45,882 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2023-08-30 02:15:45,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2023-08-30 02:15:45,887 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-30 02:15:45,887 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2023-08-30 02:15:45,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 267.5) internal successors, (535), 2 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:45,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:45,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:15:45,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:15:45,890 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:45,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1154497, now seen corresponding path program 1 times [2023-08-30 02:15:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109138487] [2023-08-30 02:15:45,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:46,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:46,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109138487] [2023-08-30 02:15:46,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109138487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:46,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:46,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:15:46,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115933576] [2023-08-30 02:15:46,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:46,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:15:46,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:46,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:15:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:15:46,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 636 [2023-08-30 02:15:46,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:46,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:46,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 636 [2023-08-30 02:15:46,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:46,810 INFO L130 PetriNetUnfolder]: 3749/5963 cut-off events. [2023-08-30 02:15:46,811 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-30 02:15:46,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11680 conditions, 5963 events. 3749/5963 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 34055 event pairs, 3144 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 11677. Up to 5693 conditions per place. [2023-08-30 02:15:46,841 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 57 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-30 02:15:46,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 258 flow [2023-08-30 02:15:46,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:15:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:15:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2023-08-30 02:15:46,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43763102725366876 [2023-08-30 02:15:46,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2023-08-30 02:15:46,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2023-08-30 02:15:46,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:46,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2023-08-30 02:15:46,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:46,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:46,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:46,853 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 144 flow. Second operand 3 states and 835 transitions. [2023-08-30 02:15:46,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 258 flow [2023-08-30 02:15:46,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:15:46,855 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2023-08-30 02:15:46,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-08-30 02:15:46,856 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-30 02:15:46,856 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2023-08-30 02:15:46,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:46,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:46,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:15:46,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:15:46,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:46,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1154498, now seen corresponding path program 1 times [2023-08-30 02:15:46,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476406784] [2023-08-30 02:15:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:46,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:46,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:46,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476406784] [2023-08-30 02:15:46,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476406784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:46,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:46,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:15:46,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397700512] [2023-08-30 02:15:46,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:46,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:15:46,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:46,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:15:46,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:15:47,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-30 02:15:47,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:47,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:47,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-30 02:15:47,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:47,536 INFO L130 PetriNetUnfolder]: 3701/5867 cut-off events. [2023-08-30 02:15:47,537 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-30 02:15:47,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11496 conditions, 5867 events. 3701/5867 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 33381 event pairs, 3103 based on Foata normal form. 0/3097 useless extension candidates. Maximal degree in co-relation 11492. Up to 5602 conditions per place. [2023-08-30 02:15:47,563 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 55 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-30 02:15:47,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 254 flow [2023-08-30 02:15:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:15:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:15:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2023-08-30 02:15:47,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44287211740041926 [2023-08-30 02:15:47,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 845 transitions. [2023-08-30 02:15:47,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 845 transitions. [2023-08-30 02:15:47,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:47,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 845 transitions. [2023-08-30 02:15:47,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:47,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:47,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:47,574 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 144 flow. Second operand 3 states and 845 transitions. [2023-08-30 02:15:47,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 254 flow [2023-08-30 02:15:47,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:15:47,575 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2023-08-30 02:15:47,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-30 02:15:47,576 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2023-08-30 02:15:47,577 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2023-08-30 02:15:47,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:47,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:47,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:15:47,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:15:47,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:47,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:47,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496233, now seen corresponding path program 1 times [2023-08-30 02:15:47,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:47,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251691682] [2023-08-30 02:15:47,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:48,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251691682] [2023-08-30 02:15:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251691682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:48,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:48,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:15:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745351558] [2023-08-30 02:15:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:48,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:15:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:48,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:15:48,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:15:48,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-30 02:15:48,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:48,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:48,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-30 02:15:48,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:48,790 INFO L130 PetriNetUnfolder]: 3800/6080 cut-off events. [2023-08-30 02:15:48,790 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-30 02:15:48,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11915 conditions, 6080 events. 3800/6080 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 35011 event pairs, 2674 based on Foata normal form. 0/3121 useless extension candidates. Maximal degree in co-relation 11911. Up to 5801 conditions per place. [2023-08-30 02:15:48,814 INFO L137 encePairwiseOnDemand]: 630/636 looper letters, 63 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-08-30 02:15:48,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 292 flow [2023-08-30 02:15:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:15:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:15:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-08-30 02:15:48,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-30 02:15:48,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-08-30 02:15:48,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-08-30 02:15:48,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:48,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-08-30 02:15:48,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:48,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:48,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:48,829 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 140 flow. Second operand 3 states and 831 transitions. [2023-08-30 02:15:48,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 292 flow [2023-08-30 02:15:48,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:15:48,834 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 164 flow [2023-08-30 02:15:48,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2023-08-30 02:15:48,835 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2023-08-30 02:15:48,836 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 164 flow [2023-08-30 02:15:48,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:48,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:48,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:15:48,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:15:48,837 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:48,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496236, now seen corresponding path program 1 times [2023-08-30 02:15:48,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:48,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770068001] [2023-08-30 02:15:48,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:48,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:48,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770068001] [2023-08-30 02:15:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770068001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:15:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781278094] [2023-08-30 02:15:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:48,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:15:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:15:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:15:49,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 636 [2023-08-30 02:15:49,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:49,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:49,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 636 [2023-08-30 02:15:49,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:49,397 INFO L130 PetriNetUnfolder]: 3253/5163 cut-off events. [2023-08-30 02:15:49,397 INFO L131 PetriNetUnfolder]: For 213/296 co-relation queries the response was YES. [2023-08-30 02:15:49,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10409 conditions, 5163 events. 3253/5163 cut-off events. For 213/296 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 28741 event pairs, 2677 based on Foata normal form. 0/2957 useless extension candidates. Maximal degree in co-relation 10404. Up to 4914 conditions per place. [2023-08-30 02:15:49,420 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 54 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-30 02:15:49,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 270 flow [2023-08-30 02:15:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:15:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:15:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2023-08-30 02:15:49,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449685534591195 [2023-08-30 02:15:49,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2023-08-30 02:15:49,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2023-08-30 02:15:49,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:49,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2023-08-30 02:15:49,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:49,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:49,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:49,430 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 164 flow. Second operand 3 states and 849 transitions. [2023-08-30 02:15:49,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 270 flow [2023-08-30 02:15:49,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:15:49,433 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 158 flow [2023-08-30 02:15:49,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2023-08-30 02:15:49,435 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-30 02:15:49,435 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 158 flow [2023-08-30 02:15:49,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:49,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:49,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:15:49,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:15:49,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:49,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:49,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495978, now seen corresponding path program 1 times [2023-08-30 02:15:49,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:49,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980578412] [2023-08-30 02:15:49,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:49,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:49,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980578412] [2023-08-30 02:15:49,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980578412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:49,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:49,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:15:49,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336648713] [2023-08-30 02:15:49,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:49,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:15:49,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:49,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:15:49,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:15:49,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-30 02:15:49,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:49,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:49,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-30 02:15:49,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:49,949 INFO L130 PetriNetUnfolder]: 2363/3821 cut-off events. [2023-08-30 02:15:49,949 INFO L131 PetriNetUnfolder]: For 169/231 co-relation queries the response was YES. [2023-08-30 02:15:49,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7709 conditions, 3821 events. 2363/3821 cut-off events. For 169/231 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 20578 event pairs, 1925 based on Foata normal form. 0/2357 useless extension candidates. Maximal degree in co-relation 7704. Up to 3628 conditions per place. [2023-08-30 02:15:49,964 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 53 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-30 02:15:49,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 266 flow [2023-08-30 02:15:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:15:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:15:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-08-30 02:15:49,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2023-08-30 02:15:49,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-08-30 02:15:49,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-08-30 02:15:49,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:49,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-08-30 02:15:49,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:49,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:49,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:49,974 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 158 flow. Second operand 3 states and 840 transitions. [2023-08-30 02:15:49,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 266 flow [2023-08-30 02:15:49,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:15:49,978 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 156 flow [2023-08-30 02:15:49,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-30 02:15:49,981 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-30 02:15:49,981 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 156 flow [2023-08-30 02:15:49,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:49,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:49,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:15:49,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:15:49,984 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:49,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495977, now seen corresponding path program 1 times [2023-08-30 02:15:49,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:49,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317684968] [2023-08-30 02:15:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317684968] [2023-08-30 02:15:50,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317684968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:50,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:15:50,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102133735] [2023-08-30 02:15:50,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:50,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:15:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:15:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:15:50,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-30 02:15:50,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 255.25) internal successors, (1021), 4 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:50,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:50,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-30 02:15:50,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:50,467 INFO L130 PetriNetUnfolder]: 1473/2479 cut-off events. [2023-08-30 02:15:50,468 INFO L131 PetriNetUnfolder]: For 125/166 co-relation queries the response was YES. [2023-08-30 02:15:50,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 2479 events. 1473/2479 cut-off events. For 125/166 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12930 event pairs, 1173 based on Foata normal form. 0/1757 useless extension candidates. Maximal degree in co-relation 5010. Up to 2342 conditions per place. [2023-08-30 02:15:50,477 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 52 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-30 02:15:50,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 262 flow [2023-08-30 02:15:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:15:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:15:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2023-08-30 02:15:50,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271488469601677 [2023-08-30 02:15:50,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2023-08-30 02:15:50,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2023-08-30 02:15:50,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:50,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2023-08-30 02:15:50,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:50,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:50,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:50,489 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 156 flow. Second operand 3 states and 815 transitions. [2023-08-30 02:15:50,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 262 flow [2023-08-30 02:15:50,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:15:50,491 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 154 flow [2023-08-30 02:15:50,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2023-08-30 02:15:50,493 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2023-08-30 02:15:50,493 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 154 flow [2023-08-30 02:15:50,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 255.25) internal successors, (1021), 4 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:50,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:50,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:15:50,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:15:50,494 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:50,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:50,495 INFO L85 PathProgramCache]: Analyzing trace with hash 34798183, now seen corresponding path program 1 times [2023-08-30 02:15:50,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:50,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715040402] [2023-08-30 02:15:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:50,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715040402] [2023-08-30 02:15:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715040402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:51,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:51,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:15:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508189971] [2023-08-30 02:15:51,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:51,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:15:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:51,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:15:51,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:15:52,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 636 [2023-08-30 02:15:52,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 253.5) internal successors, (1014), 4 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:52,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:52,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 636 [2023-08-30 02:15:52,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:53,177 INFO L130 PetriNetUnfolder]: 1853/3134 cut-off events. [2023-08-30 02:15:53,177 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2023-08-30 02:15:53,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6363 conditions, 3134 events. 1853/3134 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17498 event pairs, 443 based on Foata normal form. 25/2258 useless extension candidates. Maximal degree in co-relation 6358. Up to 2495 conditions per place. [2023-08-30 02:15:53,188 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 75 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2023-08-30 02:15:53,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 383 flow [2023-08-30 02:15:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:15:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:15:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1094 transitions. [2023-08-30 02:15:53,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4300314465408805 [2023-08-30 02:15:53,192 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1094 transitions. [2023-08-30 02:15:53,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1094 transitions. [2023-08-30 02:15:53,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:53,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1094 transitions. [2023-08-30 02:15:53,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 273.5) internal successors, (1094), 4 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:53,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:53,199 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:53,199 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 154 flow. Second operand 4 states and 1094 transitions. [2023-08-30 02:15:53,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 383 flow [2023-08-30 02:15:53,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:15:53,203 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 208 flow [2023-08-30 02:15:53,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=64, PETRI_TRANSITIONS=69} [2023-08-30 02:15:53,205 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-30 02:15:53,205 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 208 flow [2023-08-30 02:15:53,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 253.5) internal successors, (1014), 4 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:53,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:53,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:15:53,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:15:53,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:53,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 34645865, now seen corresponding path program 1 times [2023-08-30 02:15:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:53,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395328748] [2023-08-30 02:15:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:53,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:53,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395328748] [2023-08-30 02:15:53,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395328748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:53,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:53,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:15:53,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586415258] [2023-08-30 02:15:53,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:53,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:15:53,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:53,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:15:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:15:53,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 636 [2023-08-30 02:15:53,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 69 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 256.5) internal successors, (1026), 4 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:53,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:53,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 636 [2023-08-30 02:15:53,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:53,871 INFO L130 PetriNetUnfolder]: 1643/2806 cut-off events. [2023-08-30 02:15:53,871 INFO L131 PetriNetUnfolder]: For 423/423 co-relation queries the response was YES. [2023-08-30 02:15:53,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 2806 events. 1643/2806 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 15124 event pairs, 600 based on Foata normal form. 150/2328 useless extension candidates. Maximal degree in co-relation 5858. Up to 1639 conditions per place. [2023-08-30 02:15:53,884 INFO L137 encePairwiseOnDemand]: 627/636 looper letters, 81 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-08-30 02:15:53,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 425 flow [2023-08-30 02:15:53,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:15:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:15:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1108 transitions. [2023-08-30 02:15:53,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-30 02:15:53,889 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1108 transitions. [2023-08-30 02:15:53,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1108 transitions. [2023-08-30 02:15:53,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:53,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1108 transitions. [2023-08-30 02:15:53,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:53,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:53,896 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:53,896 INFO L175 Difference]: Start difference. First operand has 64 places, 69 transitions, 208 flow. Second operand 4 states and 1108 transitions. [2023-08-30 02:15:53,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 425 flow [2023-08-30 02:15:53,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:15:53,899 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 184 flow [2023-08-30 02:15:53,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2023-08-30 02:15:53,900 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-30 02:15:53,900 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 184 flow [2023-08-30 02:15:53,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 256.5) internal successors, (1026), 4 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:53,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:53,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:53,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:15:53,903 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:53,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843232, now seen corresponding path program 1 times [2023-08-30 02:15:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:53,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595102292] [2023-08-30 02:15:53,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:53,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595102292] [2023-08-30 02:15:53,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595102292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:53,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:53,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:15:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025229829] [2023-08-30 02:15:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:53,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:15:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:15:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:15:53,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-30 02:15:53,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:53,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:53,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-30 02:15:53,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:54,083 INFO L130 PetriNetUnfolder]: 533/1074 cut-off events. [2023-08-30 02:15:54,083 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-08-30 02:15:54,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 1074 events. 533/1074 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5574 event pairs, 318 based on Foata normal form. 38/941 useless extension candidates. Maximal degree in co-relation 2231. Up to 597 conditions per place. [2023-08-30 02:15:54,087 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 61 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-30 02:15:54,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 339 flow [2023-08-30 02:15:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:15:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:15:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2023-08-30 02:15:54,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44234800838574423 [2023-08-30 02:15:54,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 844 transitions. [2023-08-30 02:15:54,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 844 transitions. [2023-08-30 02:15:54,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:54,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 844 transitions. [2023-08-30 02:15:54,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,096 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 184 flow. Second operand 3 states and 844 transitions. [2023-08-30 02:15:54,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 339 flow [2023-08-30 02:15:54,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:15:54,099 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 185 flow [2023-08-30 02:15:54,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2023-08-30 02:15:54,101 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-30 02:15:54,102 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 185 flow [2023-08-30 02:15:54,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:54,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:54,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:15:54,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:54,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:54,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781159, now seen corresponding path program 1 times [2023-08-30 02:15:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494948090] [2023-08-30 02:15:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:54,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:54,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:54,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494948090] [2023-08-30 02:15:54,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494948090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:54,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:15:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254976169] [2023-08-30 02:15:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:54,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:15:54,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:54,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:15:54,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:15:54,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 636 [2023-08-30 02:15:54,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:54,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 636 [2023-08-30 02:15:54,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:54,448 INFO L130 PetriNetUnfolder]: 506/1041 cut-off events. [2023-08-30 02:15:54,449 INFO L131 PetriNetUnfolder]: For 131/133 co-relation queries the response was YES. [2023-08-30 02:15:54,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 1041 events. 506/1041 cut-off events. For 131/133 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5453 event pairs, 423 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 2193. Up to 938 conditions per place. [2023-08-30 02:15:54,453 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 47 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-30 02:15:54,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 281 flow [2023-08-30 02:15:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:15:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:15:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2023-08-30 02:15:54,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4334381551362683 [2023-08-30 02:15:54,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2023-08-30 02:15:54,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2023-08-30 02:15:54,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:54,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2023-08-30 02:15:54,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,461 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 185 flow. Second operand 3 states and 827 transitions. [2023-08-30 02:15:54,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 281 flow [2023-08-30 02:15:54,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:15:54,463 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 181 flow [2023-08-30 02:15:54,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-08-30 02:15:54,464 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-30 02:15:54,464 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 181 flow [2023-08-30 02:15:54,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:54,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:54,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:15:54,465 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:54,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781158, now seen corresponding path program 1 times [2023-08-30 02:15:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:54,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934310609] [2023-08-30 02:15:54,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:54,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:54,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:54,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934310609] [2023-08-30 02:15:54,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934310609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:54,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:54,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:15:54,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231793728] [2023-08-30 02:15:54,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:54,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:15:54,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:54,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:15:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:15:54,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 636 [2023-08-30 02:15:54,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 263.5) internal successors, (1054), 4 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:54,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 636 [2023-08-30 02:15:54,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:54,928 INFO L130 PetriNetUnfolder]: 354/719 cut-off events. [2023-08-30 02:15:54,929 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-30 02:15:54,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 719 events. 354/719 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3320 event pairs, 226 based on Foata normal form. 8/652 useless extension candidates. Maximal degree in co-relation 1544. Up to 514 conditions per place. [2023-08-30 02:15:54,932 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 59 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-30 02:15:54,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 330 flow [2023-08-30 02:15:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:15:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:15:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1105 transitions. [2023-08-30 02:15:54,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343553459119497 [2023-08-30 02:15:54,936 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1105 transitions. [2023-08-30 02:15:54,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1105 transitions. [2023-08-30 02:15:54,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:54,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1105 transitions. [2023-08-30 02:15:54,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 276.25) internal successors, (1105), 4 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,943 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,943 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 181 flow. Second operand 4 states and 1105 transitions. [2023-08-30 02:15:54,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 330 flow [2023-08-30 02:15:54,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 320 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 02:15:54,946 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 179 flow [2023-08-30 02:15:54,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-30 02:15:54,947 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-30 02:15:54,947 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 179 flow [2023-08-30 02:15:54,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.5) internal successors, (1054), 4 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:54,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:54,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:54,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:15:54,948 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:54,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:54,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1250363540, now seen corresponding path program 1 times [2023-08-30 02:15:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:54,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964268229] [2023-08-30 02:15:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:54,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:55,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:55,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964268229] [2023-08-30 02:15:55,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964268229] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:15:55,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:15:55,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:15:55,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450947574] [2023-08-30 02:15:55,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:15:55,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:15:55,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:55,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:15:55,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:15:55,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 636 [2023-08-30 02:15:55,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 254.4) internal successors, (1272), 5 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:55,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:55,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 636 [2023-08-30 02:15:55,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:55,732 INFO L130 PetriNetUnfolder]: 368/732 cut-off events. [2023-08-30 02:15:55,732 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-30 02:15:55,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 732 events. 368/732 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3372 event pairs, 286 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 1620. Up to 678 conditions per place. [2023-08-30 02:15:55,735 INFO L137 encePairwiseOnDemand]: 629/636 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-30 02:15:55,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 343 flow [2023-08-30 02:15:55,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:15:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:15:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1573 transitions. [2023-08-30 02:15:55,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41221174004192873 [2023-08-30 02:15:55,740 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1573 transitions. [2023-08-30 02:15:55,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1573 transitions. [2023-08-30 02:15:55,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:55,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1573 transitions. [2023-08-30 02:15:55,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 262.1666666666667) internal successors, (1573), 6 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:55,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:55,750 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:55,750 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 179 flow. Second operand 6 states and 1573 transitions. [2023-08-30 02:15:55,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 343 flow [2023-08-30 02:15:55,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:15:55,753 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 233 flow [2023-08-30 02:15:55,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2023-08-30 02:15:55,754 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -37 predicate places. [2023-08-30 02:15:55,754 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 233 flow [2023-08-30 02:15:55,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 254.4) internal successors, (1272), 5 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:55,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:55,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:55,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:15:55,755 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:55,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:55,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1718251328, now seen corresponding path program 1 times [2023-08-30 02:15:55,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:55,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133175847] [2023-08-30 02:15:55,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:55,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:56,131 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-30 02:15:56,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:56,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133175847] [2023-08-30 02:15:56,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133175847] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:15:56,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201990419] [2023-08-30 02:15:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:56,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:15:56,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:15:56,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:15:56,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 02:15:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:56,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 02:15:56,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:15:56,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 02:15:56,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:56,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 02:15:56,582 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-30 02:15:56,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:15:56,614 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_423 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_423 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-30 02:15:56,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 02:15:56,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-30 02:15:56,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 02:15:56,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-08-30 02:15:56,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-08-30 02:15:56,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 02:15:56,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-30 02:15:56,686 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 02:15:56,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:56,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-08-30 02:15:56,783 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-30 02:15:56,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201990419] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:15:56,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:15:56,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-30 02:15:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162938777] [2023-08-30 02:15:56,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:15:56,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 02:15:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:15:56,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 02:15:56,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=1, NotChecked=22, Total=182 [2023-08-30 02:15:56,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 636 [2023-08-30 02:15:56,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 233 flow. Second operand has 14 states, 14 states have (on average 176.78571428571428) internal successors, (2475), 14 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:56,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:56,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 636 [2023-08-30 02:15:56,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:57,299 INFO L130 PetriNetUnfolder]: 526/1050 cut-off events. [2023-08-30 02:15:57,299 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2023-08-30 02:15:57,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 1050 events. 526/1050 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5515 event pairs, 108 based on Foata normal form. 8/965 useless extension candidates. Maximal degree in co-relation 2415. Up to 607 conditions per place. [2023-08-30 02:15:57,305 INFO L137 encePairwiseOnDemand]: 628/636 looper letters, 91 selfloop transitions, 13 changer transitions 0/110 dead transitions. [2023-08-30 02:15:57,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 110 transitions, 567 flow [2023-08-30 02:15:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:15:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:15:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1315 transitions. [2023-08-30 02:15:57,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2953728661275831 [2023-08-30 02:15:57,309 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1315 transitions. [2023-08-30 02:15:57,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1315 transitions. [2023-08-30 02:15:57,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:57,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1315 transitions. [2023-08-30 02:15:57,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 187.85714285714286) internal successors, (1315), 7 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:57,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:57,318 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:57,318 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 233 flow. Second operand 7 states and 1315 transitions. [2023-08-30 02:15:57,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 110 transitions, 567 flow [2023-08-30 02:15:57,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 110 transitions, 559 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 02:15:57,322 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 286 flow [2023-08-30 02:15:57,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=286, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2023-08-30 02:15:57,322 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -31 predicate places. [2023-08-30 02:15:57,322 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 286 flow [2023-08-30 02:15:57,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 176.78571428571428) internal successors, (2475), 14 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:57,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:57,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:57,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:15:57,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-30 02:15:57,533 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:57,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:57,534 INFO L85 PathProgramCache]: Analyzing trace with hash 99588272, now seen corresponding path program 1 times [2023-08-30 02:15:57,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:57,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067388991] [2023-08-30 02:15:57,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:57,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:58,400 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-30 02:15:58,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067388991] [2023-08-30 02:15:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067388991] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:15:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848372605] [2023-08-30 02:15:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:58,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:15:58,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:15:58,402 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:15:58,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 02:15:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:58,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 73 conjunts are in the unsatisfiable core [2023-08-30 02:15:58,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:15:58,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:58,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:58,616 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:15:58,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 02:15:58,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:58,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:15:58,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-30 02:15:58,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-30 02:15:58,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-30 02:15:59,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-30 02:15:59,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:59,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-30 02:15:59,173 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-30 02:15:59,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:15:59,201 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_517 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_517 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:15:59,215 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_517 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_517 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:15:59,226 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_517 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_517 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:15:59,247 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_513 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_513) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_513 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_513) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_517) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-30 02:16:05,162 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-30 02:16:05,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848372605] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:16:05,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:16:05,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2023-08-30 02:16:05,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977079494] [2023-08-30 02:16:05,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:16:05,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 02:16:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:16:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 02:16:05,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=226, Unknown=8, NotChecked=140, Total=462 [2023-08-30 02:16:05,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 636 [2023-08-30 02:16:05,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 286 flow. Second operand has 22 states, 22 states have (on average 172.77272727272728) internal successors, (3801), 22 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:05,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:16:05,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 636 [2023-08-30 02:16:05,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:16:10,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:16:19,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:16:21,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:16:30,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:16:32,221 INFO L130 PetriNetUnfolder]: 869/1746 cut-off events. [2023-08-30 02:16:32,222 INFO L131 PetriNetUnfolder]: For 672/672 co-relation queries the response was YES. [2023-08-30 02:16:32,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4167 conditions, 1746 events. 869/1746 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10127 event pairs, 520 based on Foata normal form. 16/1634 useless extension candidates. Maximal degree in co-relation 4153. Up to 1078 conditions per place. [2023-08-30 02:16:32,232 INFO L137 encePairwiseOnDemand]: 618/636 looper letters, 127 selfloop transitions, 60 changer transitions 0/193 dead transitions. [2023-08-30 02:16:32,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 193 transitions, 1077 flow [2023-08-30 02:16:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-30 02:16:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-30 02:16:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3941 transitions. [2023-08-30 02:16:32,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2816609491137793 [2023-08-30 02:16:32,244 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3941 transitions. [2023-08-30 02:16:32,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3941 transitions. [2023-08-30 02:16:32,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:16:32,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3941 transitions. [2023-08-30 02:16:32,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 179.13636363636363) internal successors, (3941), 22 states have internal predecessors, (3941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:32,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 636.0) internal successors, (14628), 23 states have internal predecessors, (14628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:32,269 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 636.0) internal successors, (14628), 23 states have internal predecessors, (14628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:32,270 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 286 flow. Second operand 22 states and 3941 transitions. [2023-08-30 02:16:32,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 193 transitions, 1077 flow [2023-08-30 02:16:32,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 193 transitions, 1053 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-30 02:16:32,276 INFO L231 Difference]: Finished difference. Result has 101 places, 121 transitions, 727 flow [2023-08-30 02:16:32,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=727, PETRI_PLACES=101, PETRI_TRANSITIONS=121} [2023-08-30 02:16:32,277 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -5 predicate places. [2023-08-30 02:16:32,277 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 121 transitions, 727 flow [2023-08-30 02:16:32,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 172.77272727272728) internal successors, (3801), 22 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:32,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:16:32,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:16:32,292 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-30 02:16:32,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 02:16:32,485 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:16:32,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:16:32,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1733159420, now seen corresponding path program 1 times [2023-08-30 02:16:32,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:16:32,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148327132] [2023-08-30 02:16:32,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:16:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:16:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:16:33,389 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-30 02:16:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:16:33,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148327132] [2023-08-30 02:16:33,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148327132] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:16:33,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659002100] [2023-08-30 02:16:33,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:16:33,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:16:33,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:16:33,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:16:33,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 02:16:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:16:33,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-30 02:16:33,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:16:33,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:16:33,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:16:33,577 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:16:33,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 29 [2023-08-30 02:16:33,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:16:33,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:16:33,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-30 02:16:33,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-30 02:16:33,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:16:33,743 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-30 02:16:33,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:16:33,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 02:16:34,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 02:16:34,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 02:16:34,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:16:34,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:16:34,230 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-30 02:16:34,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:16:34,336 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_612 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_612 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-30 02:16:34,348 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_612 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_612 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:16:34,369 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_608) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_608) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))))) is different from false [2023-08-30 02:16:34,398 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int) (v_ArrVal_606 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_606))) (store (store .cse0 .cse1 v_ArrVal_608) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int) (v_ArrVal_606 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_606))) (store (store .cse6 .cse1 v_ArrVal_608) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-30 02:16:36,429 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int) (v_ArrVal_606 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_606))) (store (store .cse1 .cse2 v_ArrVal_608) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse3) 4)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int) (v_ArrVal_606 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_606))) (store (store .cse5 .cse2 v_ArrVal_608) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2023-08-30 02:16:36,461 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_605 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_605))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int) (v_ArrVal_606 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_606))) (store (store .cse1 .cse2 v_ArrVal_608) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_605 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_605))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_608 Int) (v_ArrVal_606 Int)) (<= 0 (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_606))) (store (store .cse7 .cse2 v_ArrVal_608) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))) is different from false [2023-08-30 02:16:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 02:16:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659002100] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:16:36,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:16:36,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2023-08-30 02:16:36,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607690958] [2023-08-30 02:16:36,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:16:36,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 02:16:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:16:36,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 02:16:36,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=265, Unknown=11, NotChecked=234, Total=600 [2023-08-30 02:16:36,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-30 02:16:36,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 121 transitions, 727 flow. Second operand has 25 states, 25 states have (on average 167.68) internal successors, (4192), 25 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:36,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:16:36,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-30 02:16:36,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:16:38,150 INFO L130 PetriNetUnfolder]: 1016/2052 cut-off events. [2023-08-30 02:16:38,150 INFO L131 PetriNetUnfolder]: For 6387/6546 co-relation queries the response was YES. [2023-08-30 02:16:38,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7865 conditions, 2052 events. 1016/2052 cut-off events. For 6387/6546 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 12287 event pairs, 283 based on Foata normal form. 21/1925 useless extension candidates. Maximal degree in co-relation 7843. Up to 1178 conditions per place. [2023-08-30 02:16:38,164 INFO L137 encePairwiseOnDemand]: 620/636 looper letters, 152 selfloop transitions, 35 changer transitions 0/193 dead transitions. [2023-08-30 02:16:38,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 193 transitions, 1578 flow [2023-08-30 02:16:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 02:16:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 02:16:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2123 transitions. [2023-08-30 02:16:38,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27817085953878407 [2023-08-30 02:16:38,172 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2123 transitions. [2023-08-30 02:16:38,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2123 transitions. [2023-08-30 02:16:38,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:16:38,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2123 transitions. [2023-08-30 02:16:38,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 176.91666666666666) internal successors, (2123), 12 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:38,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 636.0) internal successors, (8268), 13 states have internal predecessors, (8268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:38,186 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 636.0) internal successors, (8268), 13 states have internal predecessors, (8268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:38,186 INFO L175 Difference]: Start difference. First operand has 101 places, 121 transitions, 727 flow. Second operand 12 states and 2123 transitions. [2023-08-30 02:16:38,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 193 transitions, 1578 flow [2023-08-30 02:16:38,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 193 transitions, 1473 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-08-30 02:16:38,197 INFO L231 Difference]: Finished difference. Result has 114 places, 143 transitions, 958 flow [2023-08-30 02:16:38,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=958, PETRI_PLACES=114, PETRI_TRANSITIONS=143} [2023-08-30 02:16:38,198 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 8 predicate places. [2023-08-30 02:16:38,198 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 143 transitions, 958 flow [2023-08-30 02:16:38,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 167.68) internal successors, (4192), 25 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:38,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:16:38,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:16:38,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-30 02:16:38,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:16:38,406 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:16:38,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:16:38,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1207730986, now seen corresponding path program 2 times [2023-08-30 02:16:38,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:16:38,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017999585] [2023-08-30 02:16:38,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:16:38,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:16:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:16:39,182 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-30 02:16:39,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:16:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017999585] [2023-08-30 02:16:39,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017999585] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:16:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721670734] [2023-08-30 02:16:39,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:16:39,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:16:39,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:16:39,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:16:39,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 02:16:39,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:16:39,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:16:39,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-30 02:16:39,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:16:39,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:16:39,403 INFO L321 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2023-08-30 02:16:39,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2023-08-30 02:16:39,440 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-30 02:16:39,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2023-08-30 02:16:39,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:16:39,461 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:16:39,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2023-08-30 02:16:40,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2023-08-30 02:16:40,148 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 02:16:40,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 24 [2023-08-30 02:16:40,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-30 02:16:40,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-30 02:16:40,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:16:40,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-30 02:16:41,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:16:41,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-30 02:16:41,240 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-30 02:16:41,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:16:41,279 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_711 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_711 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:16:41,352 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-30 02:16:41,362 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-30 02:16:49,689 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-30 02:16:49,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721670734] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:16:49,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:16:49,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2023-08-30 02:16:49,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874757231] [2023-08-30 02:16:49,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:16:49,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-30 02:16:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:16:49,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-30 02:16:49,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=427, Unknown=17, NotChecked=138, Total=702 [2023-08-30 02:16:50,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-30 02:16:50,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 143 transitions, 958 flow. Second operand has 27 states, 27 states have (on average 167.55555555555554) internal successors, (4524), 27 states have internal predecessors, (4524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:50,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:16:50,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-30 02:16:50,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:17:01,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:17:03,541 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-30 02:17:04,032 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ (select .cse2 .cse4) 1)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (v_ArrVal_707 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_707) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse6) 4)) (select |c_#length| |c_~#queue~0.base|)))) (.cse1 (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (v_ArrVal_707 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_707) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_711) |c_~#queue~0.base|) .cse6) 4)))))) (and .cse0 .cse1 (or (< (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3212 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (and .cse0 .cse1)))))) is different from false [2023-08-30 02:17:07,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:17:13,032 INFO L130 PetriNetUnfolder]: 1404/2848 cut-off events. [2023-08-30 02:17:13,032 INFO L131 PetriNetUnfolder]: For 21982/22017 co-relation queries the response was YES. [2023-08-30 02:17:13,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13820 conditions, 2848 events. 1404/2848 cut-off events. For 21982/22017 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 18150 event pairs, 495 based on Foata normal form. 27/2698 useless extension candidates. Maximal degree in co-relation 13791. Up to 1184 conditions per place. [2023-08-30 02:17:13,083 INFO L137 encePairwiseOnDemand]: 616/636 looper letters, 174 selfloop transitions, 118 changer transitions 0/298 dead transitions. [2023-08-30 02:17:13,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 298 transitions, 3195 flow [2023-08-30 02:17:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-30 02:17:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-30 02:17:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3863 transitions. [2023-08-30 02:17:13,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2760863350485992 [2023-08-30 02:17:13,095 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3863 transitions. [2023-08-30 02:17:13,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3863 transitions. [2023-08-30 02:17:13,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:17:13,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3863 transitions. [2023-08-30 02:17:13,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 175.5909090909091) internal successors, (3863), 22 states have internal predecessors, (3863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:13,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 636.0) internal successors, (14628), 23 states have internal predecessors, (14628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:13,117 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 636.0) internal successors, (14628), 23 states have internal predecessors, (14628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:13,117 INFO L175 Difference]: Start difference. First operand has 114 places, 143 transitions, 958 flow. Second operand 22 states and 3863 transitions. [2023-08-30 02:17:13,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 298 transitions, 3195 flow [2023-08-30 02:17:13,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 298 transitions, 3015 flow, removed 90 selfloop flow, removed 0 redundant places. [2023-08-30 02:17:13,135 INFO L231 Difference]: Finished difference. Result has 146 places, 208 transitions, 2057 flow [2023-08-30 02:17:13,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2057, PETRI_PLACES=146, PETRI_TRANSITIONS=208} [2023-08-30 02:17:13,136 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 40 predicate places. [2023-08-30 02:17:13,136 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 208 transitions, 2057 flow [2023-08-30 02:17:13,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 167.55555555555554) internal successors, (4524), 27 states have internal predecessors, (4524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:13,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:17:13,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:17:13,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:17:13,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-30 02:17:13,343 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:17:13,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:17:13,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1966192756, now seen corresponding path program 1 times [2023-08-30 02:17:13,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:17:13,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835183873] [2023-08-30 02:17:13,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:17:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:17:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:17:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:17:13,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:17:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835183873] [2023-08-30 02:17:13,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835183873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:17:13,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:17:13,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:17:13,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445612420] [2023-08-30 02:17:13,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:17:13,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:17:13,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:17:13,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:17:13,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:17:13,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-30 02:17:13,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 208 transitions, 2057 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:13,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:17:13,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-30 02:17:13,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:17:14,110 INFO L130 PetriNetUnfolder]: 1403/2861 cut-off events. [2023-08-30 02:17:14,110 INFO L131 PetriNetUnfolder]: For 65660/65702 co-relation queries the response was YES. [2023-08-30 02:17:14,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19611 conditions, 2861 events. 1403/2861 cut-off events. For 65660/65702 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 18390 event pairs, 518 based on Foata normal form. 8/2754 useless extension candidates. Maximal degree in co-relation 19570. Up to 1301 conditions per place. [2023-08-30 02:17:14,139 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 197 selfloop transitions, 5 changer transitions 0/219 dead transitions. [2023-08-30 02:17:14,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 219 transitions, 2625 flow [2023-08-30 02:17:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:17:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:17:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2023-08-30 02:17:14,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418238993710692 [2023-08-30 02:17:14,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2023-08-30 02:17:14,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2023-08-30 02:17:14,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:17:14,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2023-08-30 02:17:14,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:14,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:14,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:14,148 INFO L175 Difference]: Start difference. First operand has 146 places, 208 transitions, 2057 flow. Second operand 3 states and 843 transitions. [2023-08-30 02:17:14,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 219 transitions, 2625 flow [2023-08-30 02:17:14,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 219 transitions, 2151 flow, removed 230 selfloop flow, removed 5 redundant places. [2023-08-30 02:17:14,195 INFO L231 Difference]: Finished difference. Result has 141 places, 204 transitions, 1573 flow [2023-08-30 02:17:14,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1573, PETRI_PLACES=141, PETRI_TRANSITIONS=204} [2023-08-30 02:17:14,196 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 35 predicate places. [2023-08-30 02:17:14,196 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 204 transitions, 1573 flow [2023-08-30 02:17:14,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:14,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:17:14,196 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:17:14,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 02:17:14,197 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:17:14,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:17:14,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2042297759, now seen corresponding path program 1 times [2023-08-30 02:17:14,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:17:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074462475] [2023-08-30 02:17:14,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:17:14,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:17:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:17:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:17:14,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:17:14,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074462475] [2023-08-30 02:17:14,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074462475] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:17:14,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967991779] [2023-08-30 02:17:14,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:17:14,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:17:14,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:17:14,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:17:14,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 02:17:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:17:14,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 02:17:14,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:17:14,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:17:14,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:17:14,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:17:14,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-30 02:17:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:17:14,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:17:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:17:15,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967991779] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:17:15,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:17:15,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-30 02:17:15,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073896967] [2023-08-30 02:17:15,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:17:15,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:17:15,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:17:15,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:17:15,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:17:17,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-30 02:17:17,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 204 transitions, 1573 flow. Second operand has 11 states, 11 states have (on average 261.6363636363636) internal successors, (2878), 11 states have internal predecessors, (2878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:17,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:17:17,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-30 02:17:17,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:17:18,174 INFO L130 PetriNetUnfolder]: 1150/2331 cut-off events. [2023-08-30 02:17:18,174 INFO L131 PetriNetUnfolder]: For 64786/64860 co-relation queries the response was YES. [2023-08-30 02:17:18,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18233 conditions, 2331 events. 1150/2331 cut-off events. For 64786/64860 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 12393 event pairs, 373 based on Foata normal form. 168/2440 useless extension candidates. Maximal degree in co-relation 18192. Up to 838 conditions per place. [2023-08-30 02:17:18,199 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 221 selfloop transitions, 8 changer transitions 0/247 dead transitions. [2023-08-30 02:17:18,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 247 transitions, 2767 flow [2023-08-30 02:17:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:17:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:17:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1906 transitions. [2023-08-30 02:17:18,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281221922731357 [2023-08-30 02:17:18,203 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1906 transitions. [2023-08-30 02:17:18,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1906 transitions. [2023-08-30 02:17:18,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:17:18,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1906 transitions. [2023-08-30 02:17:18,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 272.2857142857143) internal successors, (1906), 7 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:18,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:18,210 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:18,210 INFO L175 Difference]: Start difference. First operand has 141 places, 204 transitions, 1573 flow. Second operand 7 states and 1906 transitions. [2023-08-30 02:17:18,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 247 transitions, 2767 flow [2023-08-30 02:17:18,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 247 transitions, 2611 flow, removed 75 selfloop flow, removed 2 redundant places. [2023-08-30 02:17:18,242 INFO L231 Difference]: Finished difference. Result has 146 places, 194 transitions, 1496 flow [2023-08-30 02:17:18,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1496, PETRI_PLACES=146, PETRI_TRANSITIONS=194} [2023-08-30 02:17:18,243 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 40 predicate places. [2023-08-30 02:17:18,243 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 194 transitions, 1496 flow [2023-08-30 02:17:18,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 261.6363636363636) internal successors, (2878), 11 states have internal predecessors, (2878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:18,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:17:18,244 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 02:17:18,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:17:18,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:17:18,453 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:17:18,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:17:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1495673483, now seen corresponding path program 3 times [2023-08-30 02:17:18,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:17:18,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361930324] [2023-08-30 02:17:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:17:18,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:17:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:17:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:17:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:17:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361930324] [2023-08-30 02:17:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361930324] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:17:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495472371] [2023-08-30 02:17:20,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:17:20,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:17:20,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:17:20,300 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:17:20,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 02:17:20,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 02:17:20,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:17:20,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 89 conjunts are in the unsatisfiable core [2023-08-30 02:17:20,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:17:20,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2023-08-30 02:17:20,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:17:20,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:17:20,578 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:17:20,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-30 02:17:20,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:17:20,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:17:20,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-30 02:17:20,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:17:20,795 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-30 02:17:21,179 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 02:17:21,179 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 28 treesize of output 23 [2023-08-30 02:17:21,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 02:17:21,574 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 25 treesize of output 13 [2023-08-30 02:17:21,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:17:21,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:17:21,915 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 02:17:21,916 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2023-08-30 02:17:22,146 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 26 treesize of output 21 [2023-08-30 02:17:22,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-08-30 02:17:22,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:17:22,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-30 02:17:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:17:22,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:17:22,821 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-30 02:17:22,837 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:17:27,792 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse1 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 0) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_946))) (store (store .cse2 .cse3 v_ArrVal_949) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))))))) (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse7 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse10 (+ |c_~#queue~0.offset| (* (select .cse9 .cse4) 4)))) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ (* 4 (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 .cse10 v_ArrVal_946))) (store (store .cse8 .cse3 v_ArrVal_949) .cse4 (+ (select .cse8 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse10 0)))))))) is different from false [2023-08-30 02:17:27,837 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse1 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 0) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_946))) (store (store .cse2 .cse3 v_ArrVal_949) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse7 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse10 (+ |c_~#queue~0.offset| (* (select .cse9 .cse4) 4)))) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 .cse10 v_ArrVal_946))) (store (store .cse8 .cse3 v_ArrVal_949) .cse4 (+ (select .cse8 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (< .cse10 0)))))))) is different from false [2023-08-30 02:17:48,046 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_938 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_938))) (let ((.cse9 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_939 Int)) (let ((.cse7 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_939))) (let ((.cse8 (select .cse7 .cse3))) (or (forall ((v_ArrVal_945 (Array Int Int)) (v_ArrVal_942 Int)) (let ((.cse0 (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_942) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_946))) (store (store .cse1 .cse2 v_ArrVal_949) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4)))) (< .cse5 0)))))) (= 800 .cse8))))) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_938 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_938))) (let ((.cse10 (select .cse15 |c_~#queue~0.base|))) (or (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (forall ((v_ArrVal_939 Int)) (let ((.cse16 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_939))) (let ((.cse17 (select .cse16 .cse3))) (or (forall ((v_ArrVal_945 (Array Int Int)) (v_ArrVal_942 Int)) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse2 v_ArrVal_942) .cse3 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|))) (or (< .cse11 0) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse14 .cse11 v_ArrVal_946))) (store (store .cse13 .cse2 v_ArrVal_949) .cse3 (+ (select .cse13 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|)))))))) (= 800 .cse17))))))))))) is different from false [2023-08-30 02:17:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-30 02:17:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495472371] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:17:48,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:17:48,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 38 [2023-08-30 02:17:48,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062191577] [2023-08-30 02:17:48,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:17:48,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-30 02:17:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:17:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-30 02:17:48,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=958, Unknown=53, NotChecked=350, Total=1560 [2023-08-30 02:17:49,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-30 02:17:49,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 194 transitions, 1496 flow. Second operand has 40 states, 40 states have (on average 167.65) internal successors, (6706), 40 states have internal predecessors, (6706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:17:49,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:17:49,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-30 02:17:49,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:18:25,573 WARN L222 SmtUtils]: Spent 20.98s on a formula simplification. DAG size of input: 162 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:18:27,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:18:39,259 WARN L222 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 143 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:18:41,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:18:46,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:18:47,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:18:49,576 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-30 02:18:57,740 WARN L222 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 142 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:18:59,766 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-30 02:19:00,638 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (* (select .cse4 .cse3) 4)) (.cse11 (+ (select .cse8 .cse10) 1))) (let ((.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse10 .cse11))) (.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ .cse7 |c_~#queue~0.offset|)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (or (< .cse0 0) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse0 v_ArrVal_946))) (store (store .cse1 .cse2 v_ArrVal_949) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 .cse0 v_ArrVal_946))) (store (store .cse5 .cse2 v_ArrVal_949) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) 4) .cse6)))) (<= (+ .cse7 |c_~#queue~0.offset| 4) .cse6) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_949) .cse10 .cse11)) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_949) .cse10 .cse11)) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) 4) .cse6)) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse6)) (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|))) (or (< .cse12 0) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse15 .cse12 v_ArrVal_946))) (store (store .cse14 .cse2 v_ArrVal_949) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse6))))))) (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse16 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse16 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) 4) .cse6)) (<= 0 .cse0) (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (let ((.cse20 (+ (* (select .cse19 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ (* (select (select (store (store .cse17 |c_~#queue~0.base| (let ((.cse18 (store .cse19 .cse20 v_ArrVal_946))) (store (store .cse18 .cse2 v_ArrVal_949) .cse3 (+ (select .cse18 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse20 0)))))))))) is different from false [2023-08-30 02:19:02,715 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-30 02:19:11,511 WARN L222 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 154 DAG size of output: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:19:13,527 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (* (select .cse4 .cse3) 4))) (let ((.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ .cse7 |c_~#queue~0.offset|))) (and (or (< .cse0 0) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse0 v_ArrVal_946))) (store (store .cse1 .cse2 v_ArrVal_949) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 .cse0 v_ArrVal_946))) (store (store .cse5 .cse2 v_ArrVal_949) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) 4) .cse6))))) (<= (+ .cse7 |c_~#queue~0.offset| 4) .cse6) (<= 0 .cse0))))) is different from false [2023-08-30 02:19:16,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:18,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:19:20,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:19:22,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:19:25,096 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-30 02:19:27,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:32,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:19:36,961 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse25 (select .cse17 .cse19))) (let ((.cse20 (+ .cse25 1))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse12 (= 800 .cse25)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse17 .cse19 .cse20))) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (and (or (and (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse1 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 0) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_946))) (store (store .cse2 .cse3 v_ArrVal_949) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse6))))))) (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse8 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ |c_~#queue~0.offset| (* (select .cse10 .cse4) 4)))) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse11 v_ArrVal_946))) (store (store .cse9 .cse3 v_ArrVal_949) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (< .cse11 0))))))) .cse12) (or (let ((.cse18 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_945 (Array Int Int)) (v_ArrVal_942 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse17 .cse18 v_ArrVal_942) .cse19 .cse20)) |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (let ((.cse13 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse13 0) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ (* (select (select (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse16 .cse13 v_ArrVal_946))) (store (store .cse15 .cse3 v_ArrVal_949) .cse4 (+ (select .cse15 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))) (forall ((v_ArrVal_945 (Array Int Int)) (v_ArrVal_942 Int)) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse17 .cse18 v_ArrVal_942) .cse19 .cse20)) |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (let ((.cse21 (+ (* (select .cse24 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse21 0) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ (* (select (select (store (store .cse22 |c_~#queue~0.base| (let ((.cse23 (store .cse24 .cse21 v_ArrVal_946))) (store (store .cse23 .cse3 v_ArrVal_949) .cse4 (+ (select .cse23 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse6))))))))) .cse12) (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse4) 4) 4) .cse6))))))) is different from false [2023-08-30 02:19:52,830 WARN L222 SmtUtils]: Spent 7.00s on a formula simplification. DAG size of input: 98 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:19:52,865 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse1) 4) 4) .cse2))))) is different from false [2023-08-30 02:19:55,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:19:55,355 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (* (select .cse4 .cse3) 4))) (let ((.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ .cse7 |c_~#queue~0.offset|)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (or (< .cse0 0) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse0 v_ArrVal_946))) (store (store .cse1 .cse2 v_ArrVal_949) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 .cse0 v_ArrVal_946))) (store (store .cse5 .cse2 v_ArrVal_949) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) 4) .cse6)))) (<= (+ .cse7 |c_~#queue~0.offset| 4) .cse6) (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|))) (or (< .cse8 0) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse8 v_ArrVal_946))) (store (store .cse10 .cse2 v_ArrVal_949) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse6))))))) (<= 0 .cse0) (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (let ((.cse15 (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ (* (select (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse14 .cse15 v_ArrVal_946))) (store (store .cse13 .cse2 v_ArrVal_949) .cse3 (+ (select .cse13 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse15 0)))))))))) is different from false [2023-08-30 02:19:55,447 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (* (select .cse4 .cse3) 4))) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse18 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse17 .cse18 (+ (select .cse17 .cse18) 1))))) (.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ .cse7 |c_~#queue~0.offset|)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (or (< .cse0 0) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse0 v_ArrVal_946))) (store (store .cse1 .cse2 v_ArrVal_949) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 .cse0 v_ArrVal_946))) (store (store .cse5 .cse2 v_ArrVal_949) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) 4) .cse6)))) (<= (+ .cse7 |c_~#queue~0.offset| 4) .cse6) (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|))) (or (< .cse8 0) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse8 v_ArrVal_946))) (store (store .cse10 .cse2 v_ArrVal_949) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse6))))))) (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) 4) .cse6)) (<= 0 .cse0) (forall ((v_ArrVal_945 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_945))) (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (let ((.cse16 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_946 Int)) (<= 0 (+ (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse15 .cse16 v_ArrVal_946))) (store (store .cse14 .cse2 v_ArrVal_949) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse16 0)))))))))) is different from false [2023-08-30 02:20:06,985 WARN L222 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:20:09,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:11,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:13,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:15,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:17,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:19,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:21,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:23,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:26,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:20:28,048 INFO L130 PetriNetUnfolder]: 2272/4456 cut-off events. [2023-08-30 02:20:28,049 INFO L131 PetriNetUnfolder]: For 96472/96528 co-relation queries the response was YES. [2023-08-30 02:20:28,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32525 conditions, 4456 events. 2272/4456 cut-off events. For 96472/96528 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 27701 event pairs, 744 based on Foata normal form. 73/4405 useless extension candidates. Maximal degree in co-relation 32481. Up to 1799 conditions per place. [2023-08-30 02:20:28,089 INFO L137 encePairwiseOnDemand]: 615/636 looper letters, 321 selfloop transitions, 221 changer transitions 0/547 dead transitions. [2023-08-30 02:20:28,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 547 transitions, 7856 flow [2023-08-30 02:20:28,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-30 02:20:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-30 02:20:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 7514 transitions. [2023-08-30 02:20:28,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27475500950709375 [2023-08-30 02:20:28,100 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 7514 transitions. [2023-08-30 02:20:28,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 7514 transitions. [2023-08-30 02:20:28,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:20:28,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 7514 transitions. [2023-08-30 02:20:28,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 174.74418604651163) internal successors, (7514), 43 states have internal predecessors, (7514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:20:28,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 636.0) internal successors, (27984), 44 states have internal predecessors, (27984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:20:28,131 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 636.0) internal successors, (27984), 44 states have internal predecessors, (27984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:20:28,132 INFO L175 Difference]: Start difference. First operand has 146 places, 194 transitions, 1496 flow. Second operand 43 states and 7514 transitions. [2023-08-30 02:20:28,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 547 transitions, 7856 flow [2023-08-30 02:20:28,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 547 transitions, 7792 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-08-30 02:20:28,187 INFO L231 Difference]: Finished difference. Result has 215 places, 378 transitions, 5127 flow [2023-08-30 02:20:28,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=5127, PETRI_PLACES=215, PETRI_TRANSITIONS=378} [2023-08-30 02:20:28,187 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 109 predicate places. [2023-08-30 02:20:28,188 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 378 transitions, 5127 flow [2023-08-30 02:20:28,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 167.65) internal successors, (6706), 40 states have internal predecessors, (6706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:20:28,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:20:28,189 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 02:20:28,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:20:28,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:20:28,398 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:20:28,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:20:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1300979115, now seen corresponding path program 4 times [2023-08-30 02:20:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:20:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462540690] [2023-08-30 02:20:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:20:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:20:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:20:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:20:30,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:20:30,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462540690] [2023-08-30 02:20:30,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462540690] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:20:30,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189029728] [2023-08-30 02:20:30,257 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:20:30,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:20:30,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:20:30,264 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:20:30,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 02:20:30,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:20:30,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:20:30,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 85 conjunts are in the unsatisfiable core [2023-08-30 02:20:30,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:20:30,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:20:30,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:20:30,487 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:20:30,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 02:20:30,522 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-30 02:20:30,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:20:30,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-30 02:20:31,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-30 02:20:31,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-08-30 02:20:31,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:20:31,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2023-08-30 02:20:31,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:20:31,832 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 56 treesize of output 56 [2023-08-30 02:20:32,007 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 63 treesize of output 56 [2023-08-30 02:20:32,256 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 59 treesize of output 54 [2023-08-30 02:20:32,786 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 65 treesize of output 58 [2023-08-30 02:20:32,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:20:32,961 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 103 treesize of output 105 [2023-08-30 02:20:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:20:33,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:20:33,163 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1071 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1071 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-30 02:20:33,182 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1071 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1071 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:20:33,576 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 Int) (v_ArrVal_1068 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1065))) (store (store .cse0 .cse1 v_ArrVal_1068) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 Int) (v_ArrVal_1068 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1065))) (store (store .cse6 .cse1 v_ArrVal_1068) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-30 02:20:33,605 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 Int) (v_ArrVal_1068 Int) (v_ArrVal_1064 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064))) (store .cse0 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store (select .cse0 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 v_ArrVal_1065))) (store (store .cse1 .cse2 v_ArrVal_1068) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 Int) (v_ArrVal_1068 Int) (v_ArrVal_1064 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064))) (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 v_ArrVal_1065))) (store (store .cse7 .cse2 v_ArrVal_1068) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse5) 4)))))) is different from false [2023-08-30 02:20:42,203 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_1063 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1063))) (or (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 Int) (v_ArrVal_1068 Int) (v_ArrVal_1064 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (select .cse2 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_1065))) (store (store .cse3 .cse4 v_ArrVal_1068) .cse1 (+ (select .cse3 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_1063 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1063))) (or (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 Int) (v_ArrVal_1068 Int) (v_ArrVal_1064 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (select .cse5 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_1065))) (store (store .cse6 .cse4 v_ArrVal_1068) .cse1 (+ (select .cse6 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse1) 4)))) (< (select (select .cse7 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))))) is different from false [2023-08-30 02:20:42,258 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_1063 (Array Int Int))) (let ((.cse4 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1063))) (or (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 Int) (v_ArrVal_1068 Int) (v_ArrVal_1064 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store (select .cse0 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_1065))) (store (store .cse1 .cse2 v_ArrVal_1068) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select (select .cse4 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_1063 (Array Int Int))) (let ((.cse8 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1063))) (or (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 Int) (v_ArrVal_1068 Int) (v_ArrVal_1064 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store (select .cse6 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_1065))) (store (store .cse7 .cse2 v_ArrVal_1068) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select (select .cse8 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))))) is different from false [2023-08-30 02:20:42,310 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_1063 (Array Int Int))) (let ((.cse4 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1063))) (or (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 Int) (v_ArrVal_1068 Int) (v_ArrVal_1064 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store (select .cse0 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_1065))) (store (store .cse1 .cse2 v_ArrVal_1068) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse3) 4)))) (< (select (select .cse4 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_1063 (Array Int Int))) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1063))) (or (< (select (select .cse6 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 Int) (v_ArrVal_1068 Int) (v_ArrVal_1064 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (select .cse7 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_1065))) (store (store .cse8 .cse2 v_ArrVal_1068) .cse3 (+ (select .cse8 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1071) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2023-08-30 02:21:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-30 02:21:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189029728] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:21:13,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:21:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 36 [2023-08-30 02:21:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936155777] [2023-08-30 02:21:13,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:21:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-30 02:21:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:21:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-30 02:21:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=733, Unknown=41, NotChecked=448, Total=1406 [2023-08-30 02:21:14,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-30 02:21:14,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 378 transitions, 5127 flow. Second operand has 38 states, 38 states have (on average 167.73684210526315) internal successors, (6374), 38 states have internal predecessors, (6374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:21:14,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:21:14,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-30 02:21:14,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:21:32,814 WARN L222 SmtUtils]: Spent 11.16s on a formula simplification. DAG size of input: 209 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:21:51,584 WARN L222 SmtUtils]: Spent 14.32s on a formula simplification. DAG size of input: 173 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:21:53,894 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-30 02:21:55,953 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-30 02:21:58,176 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-30 02:22:00,181 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-30 02:22:01,695 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-30 02:22:03,715 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-30 02:22:17,329 WARN L222 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 99 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:22:57,393 WARN L222 SmtUtils]: Spent 31.56s on a formula simplification. DAG size of input: 223 DAG size of output: 170 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:22:59,612 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-30 02:23:01,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:23:03,639 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-30 02:23:05,644 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-30 02:23:06,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:23:08,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:23:11,358 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-30 02:23:13,398 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-30 02:23:32,304 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-30 02:23:34,500 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-30 02:23:36,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:23:38,536 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-30 02:23:46,230 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-30 02:23:48,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:23:49,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:23:51,807 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-30 02:23:54,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:23:57,452 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-30 02:23:59,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:24:01,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:24:03,471 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-30 02:24:04,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:24:07,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:24:09,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:24:11,102 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-30 02:24:13,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:24:15,764 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-30 02:24:17,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:24:19,532 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-30 02:24:23,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:24:38,931 WARN L222 SmtUtils]: Spent 9.23s on a formula simplification. DAG size of input: 112 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:25:29,760 WARN L222 SmtUtils]: Spent 38.34s on a formula simplification. DAG size of input: 194 DAG size of output: 172 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:26:08,747 WARN L222 SmtUtils]: Spent 28.14s on a formula simplification. DAG size of input: 108 DAG size of output: 103 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:26:13,195 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-30 02:26:48,844 WARN L222 SmtUtils]: Spent 23.94s on a formula simplification. DAG size of input: 206 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:27:18,937 WARN L222 SmtUtils]: Spent 9.48s on a formula simplification. DAG size of input: 120 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:27:27,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:27:37,106 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-30 02:27:38,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:27:41,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:27:43,190 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-30 02:27:45,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:27:47,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:27:49,270 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-30 02:27:51,394 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-30 02:28:01,223 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-30 02:28:03,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:28:05,020 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-30 02:28:07,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:28:09,029 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-30 02:28:27,254 WARN L222 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 161 DAG size of output: 93 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:28:54,419 WARN L222 SmtUtils]: Spent 12.50s on a formula simplification. DAG size of input: 183 DAG size of output: 178 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:28:56,468 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-30 02:28:59,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:29:01,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:29:04,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Killed by 15