./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/list-simple/sll2n_insert_equal.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:48:22,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:48:22,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:48:22,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:48:22,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:48:22,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:48:22,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:48:22,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:48:22,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:48:22,442 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:48:22,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:48:22,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:48:22,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:48:22,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:48:22,443 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:48:22,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:48:22,444 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:48:22,445 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:48:22,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:48:22,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:48:22,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:48:22,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:48:22,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:48:22,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:48:22,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:48:22,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:48:22,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:48:22,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:48:22,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:48:22,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:48:22,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:48:22,447 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2024-11-07 16:48:22,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:48:22,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:48:22,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:48:22,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:48:22,688 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:48:22,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-11-07 16:48:23,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:48:24,246 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:48:24,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-11-07 16:48:24,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/370e32521/2385449a38064d239d926662a151c14f/FLAGe032ff886 [2024-11-07 16:48:24,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/370e32521/2385449a38064d239d926662a151c14f [2024-11-07 16:48:24,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:48:24,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:48:24,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:48:24,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:48:24,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:48:24,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6ecfcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24, skipping insertion in model container [2024-11-07 16:48:24,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:48:24,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:48:24,786 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:48:24,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:48:24,858 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:48:24,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24 WrapperNode [2024-11-07 16:48:24,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:48:24,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:48:24,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:48:24,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:48:24,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,905 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 126 [2024-11-07 16:48:24,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:48:24,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:48:24,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:48:24,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:48:24,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,947 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-11-07 16:48:24,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:48:24,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:48:24,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:48:24,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:48:24,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (1/1) ... [2024-11-07 16:48:24,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:48:25,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:25,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:48:25,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:48:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:48:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:48:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 16:48:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:48:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:48:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 16:48:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-07 16:48:25,044 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-07 16:48:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:48:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:48:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:48:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:48:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:48:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:48:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:48:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:48:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:48:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:48:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 16:48:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 16:48:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 16:48:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:48:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:48:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 16:48:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:48:25,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:48:25,199 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:48:25,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:48:25,484 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-07 16:48:25,484 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:48:25,496 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:48:25,497 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-07 16:48:25,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:48:25 BoogieIcfgContainer [2024-11-07 16:48:25,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:48:25,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:48:25,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:48:25,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:48:25,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:48:24" (1/3) ... [2024-11-07 16:48:25,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434005c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:48:25, skipping insertion in model container [2024-11-07 16:48:25,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:24" (2/3) ... [2024-11-07 16:48:25,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434005c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:48:25, skipping insertion in model container [2024-11-07 16:48:25,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:48:25" (3/3) ... [2024-11-07 16:48:25,507 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2024-11-07 16:48:25,522 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:48:25,522 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-11-07 16:48:25,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:48:25,584 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@4f6aed6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:48:25,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-11-07 16:48:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 50 states have (on average 1.88) internal successors, (94), 81 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 16:48:25,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:25,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:25,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:25,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1814089465, now seen corresponding path program 1 times [2024-11-07 16:48:25,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:25,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857679526] [2024-11-07 16:48:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:25,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:48:25,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:25,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857679526] [2024-11-07 16:48:25,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857679526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:25,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:25,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:48:25,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939851565] [2024-11-07 16:48:25,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:25,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:48:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:25,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:48:25,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:48:25,874 INFO L87 Difference]: Start difference. First operand has 85 states, 50 states have (on average 1.88) internal successors, (94), 81 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:48:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:25,974 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2024-11-07 16:48:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:48:25,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-07 16:48:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:25,982 INFO L225 Difference]: With dead ends: 82 [2024-11-07 16:48:25,982 INFO L226 Difference]: Without dead ends: 79 [2024-11-07 16:48:25,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:48:25,986 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:25,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:48:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-07 16:48:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-07 16:48:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-11-07 16:48:26,027 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 7 [2024-11-07 16:48:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:26,028 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-07 16:48:26,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:48:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-11-07 16:48:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 16:48:26,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:26,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:26,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:48:26,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:26,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:26,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1814089466, now seen corresponding path program 1 times [2024-11-07 16:48:26,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:26,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713856107] [2024-11-07 16:48:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:48:26,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:26,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713856107] [2024-11-07 16:48:26,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713856107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:26,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:26,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:48:26,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749644829] [2024-11-07 16:48:26,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:26,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:48:26,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:26,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:48:26,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:48:26,179 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:48:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:26,242 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-11-07 16:48:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:48:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-07 16:48:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:26,244 INFO L225 Difference]: With dead ends: 77 [2024-11-07 16:48:26,245 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 16:48:26,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:48:26,246 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:26,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 133 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:48:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 16:48:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-07 16:48:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-11-07 16:48:26,254 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2024-11-07 16:48:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:26,254 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-11-07 16:48:26,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:48:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-11-07 16:48:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:48:26,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:26,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:26,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:48:26,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:26,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:26,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1602420288, now seen corresponding path program 1 times [2024-11-07 16:48:26,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:26,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013823537] [2024-11-07 16:48:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:48:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:26,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013823537] [2024-11-07 16:48:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013823537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:26,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:48:26,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685806237] [2024-11-07 16:48:26,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:26,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:48:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:26,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:48:26,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:48:26,511 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:48:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:26,709 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-11-07 16:48:26,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:48:26,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-07 16:48:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:26,711 INFO L225 Difference]: With dead ends: 76 [2024-11-07 16:48:26,711 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 16:48:26,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:48:26,712 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:26,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 283 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:48:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 16:48:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-07 16:48:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-11-07 16:48:26,718 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2024-11-07 16:48:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:26,721 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-11-07 16:48:26,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:48:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-11-07 16:48:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:48:26,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:26,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:26,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:48:26,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:26,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:26,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1602420289, now seen corresponding path program 1 times [2024-11-07 16:48:26,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:26,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999876527] [2024-11-07 16:48:26,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:26,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:48:26,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:26,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999876527] [2024-11-07 16:48:26,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999876527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:26,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:26,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:48:26,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547546921] [2024-11-07 16:48:26,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:26,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:48:26,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:26,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:48:26,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:48:26,961 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:48:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:27,124 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-07 16:48:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:48:27,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-07 16:48:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:27,125 INFO L225 Difference]: With dead ends: 75 [2024-11-07 16:48:27,126 INFO L226 Difference]: Without dead ends: 75 [2024-11-07 16:48:27,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:48:27,127 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:27,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 299 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:48:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-07 16:48:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-07 16:48:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2024-11-07 16:48:27,137 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 13 [2024-11-07 16:48:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:27,137 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2024-11-07 16:48:27,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:48:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2024-11-07 16:48:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:48:27,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:27,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:27,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:48:27,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:27,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1040217920, now seen corresponding path program 1 times [2024-11-07 16:48:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274961606] [2024-11-07 16:48:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:27,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 16:48:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:48:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:27,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274961606] [2024-11-07 16:48:27,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274961606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:48:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308163629] [2024-11-07 16:48:27,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:27,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:48:27,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:27,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:48:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:48:27,233 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:48:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:27,309 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2024-11-07 16:48:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:48:27,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-07 16:48:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:27,311 INFO L225 Difference]: With dead ends: 81 [2024-11-07 16:48:27,311 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 16:48:27,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:48:27,312 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:27,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 190 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:48:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 16:48:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2024-11-07 16:48:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.625) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-11-07 16:48:27,323 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 15 [2024-11-07 16:48:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:27,323 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-11-07 16:48:27,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:48:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-11-07 16:48:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:48:27,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:27,325 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:27,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:48:27,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:27,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1052200126, now seen corresponding path program 1 times [2024-11-07 16:48:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:27,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561880295] [2024-11-07 16:48:27,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:27,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:27,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 16:48:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 16:48:27,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:27,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561880295] [2024-11-07 16:48:27,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561880295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608077614] [2024-11-07 16:48:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:27,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:27,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:27,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:48:27,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 16:48:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:27,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:48:27,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:48:27,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:48:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 16:48:27,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608077614] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:48:27,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:48:27,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-07 16:48:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336632745] [2024-11-07 16:48:27,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:48:27,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:48:27,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:27,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:48:27,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:48:27,742 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:48:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:27,821 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2024-11-07 16:48:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:48:27,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-07 16:48:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:27,823 INFO L225 Difference]: With dead ends: 82 [2024-11-07 16:48:27,823 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 16:48:27,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:48:27,824 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:27,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 334 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:48:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 16:48:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 16:48:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 77 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-11-07 16:48:27,828 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 28 [2024-11-07 16:48:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:27,828 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-11-07 16:48:27,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:48:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-11-07 16:48:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 16:48:27,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:27,829 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:27,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 16:48:28,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:28,031 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:28,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1845654912, now seen corresponding path program 2 times [2024-11-07 16:48:28,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:28,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79326504] [2024-11-07 16:48:28,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:28,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:28,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:48:28,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:28,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79326504] [2024-11-07 16:48:28,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79326504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:28,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716754126] [2024-11-07 16:48:28,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:48:28,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:28,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:28,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:48:28,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 16:48:28,867 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:48:28,867 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:48:28,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 16:48:28,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:28,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:48:28,923 INFO L378 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 5 treesize of output 3 [2024-11-07 16:48:28,957 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-07 16:48:29,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:48:29,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:48:29,093 INFO L378 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 5 treesize of output 3 [2024-11-07 16:48:29,151 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:48:29,151 INFO L378 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 14 treesize of output 13 [2024-11-07 16:48:29,283 INFO L378 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 5 treesize of output 3 [2024-11-07 16:48:29,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:48:29,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:48:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 12 not checked. [2024-11-07 16:48:29,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:48:29,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716754126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:29,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:48:29,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-11-07 16:48:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831337254] [2024-11-07 16:48:29,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:48:29,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 16:48:29,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 16:48:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-11-07 16:48:29,425 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:48:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:29,802 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-11-07 16:48:29,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:48:29,802 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2024-11-07 16:48:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:29,803 INFO L225 Difference]: With dead ends: 94 [2024-11-07 16:48:29,803 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 16:48:29,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=308, Unknown=1, NotChecked=36, Total=420 [2024-11-07 16:48:29,804 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 188 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:29,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 341 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 365 Invalid, 0 Unknown, 88 Unchecked, 0.3s Time] [2024-11-07 16:48:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 16:48:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2024-11-07 16:48:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.490566037735849) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-07 16:48:29,812 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 41 [2024-11-07 16:48:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:29,813 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-07 16:48:29,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:48:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-07 16:48:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 16:48:29,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:29,814 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:29,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 16:48:30,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:30,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:30,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1845654911, now seen corresponding path program 1 times [2024-11-07 16:48:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:30,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114346061] [2024-11-07 16:48:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:30,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 16:48:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114346061] [2024-11-07 16:48:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114346061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865998824] [2024-11-07 16:48:30,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:30,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:30,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:30,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:48:30,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 16:48:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:30,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 16:48:30,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:30,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:48:30,865 INFO L378 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 5 treesize of output 3 [2024-11-07 16:48:30,884 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-07 16:48:30,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:48:30,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:48:30,992 INFO L378 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 5 treesize of output 3 [2024-11-07 16:48:31,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:48:31,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:48:31,122 INFO L378 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 5 treesize of output 3 [2024-11-07 16:48:31,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:48:31,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:48:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-07 16:48:31,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:48:31,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865998824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:31,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:48:31,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-07 16:48:31,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963887333] [2024-11-07 16:48:31,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:31,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:48:31,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:48:31,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2024-11-07 16:48:31,197 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:31,289 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2024-11-07 16:48:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:48:31,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-07 16:48:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:31,291 INFO L225 Difference]: With dead ends: 80 [2024-11-07 16:48:31,291 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 16:48:31,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2024-11-07 16:48:31,292 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 17 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:31,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 180 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2024-11-07 16:48:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 16:48:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-07 16:48:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 71 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2024-11-07 16:48:31,296 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 41 [2024-11-07 16:48:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:31,297 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2024-11-07 16:48:31,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-07 16:48:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 16:48:31,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:31,299 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:31,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 16:48:31,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:31,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:31,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:31,500 INFO L85 PathProgramCache]: Analyzing trace with hash 265840289, now seen corresponding path program 1 times [2024-11-07 16:48:31,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:31,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591577688] [2024-11-07 16:48:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:31,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:31,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 16:48:31,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:31,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591577688] [2024-11-07 16:48:31,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591577688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670971095] [2024-11-07 16:48:31,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:31,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:31,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:31,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:48:31,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 16:48:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:32,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 16:48:32,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:32,339 INFO L378 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 9 treesize of output 3 [2024-11-07 16:48:32,361 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-07 16:48:32,419 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-07 16:48:32,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-07 16:48:32,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2024-11-07 16:48:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:48:32,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:48:32,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670971095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:32,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:48:32,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-07 16:48:32,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767608955] [2024-11-07 16:48:32,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:32,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:48:32,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:48:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2024-11-07 16:48:32,441 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:32,603 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2024-11-07 16:48:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:48:32,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-07 16:48:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:32,604 INFO L225 Difference]: With dead ends: 93 [2024-11-07 16:48:32,604 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 16:48:32,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=444, Unknown=1, NotChecked=42, Total=552 [2024-11-07 16:48:32,605 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 41 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:32,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 254 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 157 Unchecked, 0.1s Time] [2024-11-07 16:48:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 16:48:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2024-11-07 16:48:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 73 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-07 16:48:32,615 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 44 [2024-11-07 16:48:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:32,615 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-07 16:48:32,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-07 16:48:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 16:48:32,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:32,616 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:32,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 16:48:32,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-07 16:48:32,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:32,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 265840290, now seen corresponding path program 1 times [2024-11-07 16:48:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084069629] [2024-11-07 16:48:32,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:33,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 16:48:33,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:33,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084069629] [2024-11-07 16:48:33,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084069629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:33,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031943791] [2024-11-07 16:48:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:33,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:33,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:33,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:48:33,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 16:48:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:33,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-07 16:48:33,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:33,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:48:34,083 INFO L378 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 9 treesize of output 3 [2024-11-07 16:48:34,087 INFO L378 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 9 treesize of output 3 [2024-11-07 16:48:34,206 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4| Int)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) 0))) (exists ((|node_create_#res#1.base| Int)) (and (= (select |c_old(#valid)| |node_create_#res#1.base|) 0) (= (store |c_old(#length)| |node_create_#res#1.base| (select |c_#length| |node_create_#res#1.base|)) |c_#length|)))) is different from true [2024-11-07 16:48:34,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:48:34,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-07 16:48:34,240 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-07 16:48:34,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-07 16:48:34,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2024-11-07 16:48:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-11-07 16:48:34,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:48:34,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031943791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:34,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:48:34,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2024-11-07 16:48:34,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322612039] [2024-11-07 16:48:34,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:48:34,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 16:48:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:34,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 16:48:34,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=843, Unknown=1, NotChecked=58, Total=992 [2024-11-07 16:48:34,551 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-07 16:48:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:35,304 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2024-11-07 16:48:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:48:35,304 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2024-11-07 16:48:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:35,306 INFO L225 Difference]: With dead ends: 100 [2024-11-07 16:48:35,306 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 16:48:35,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=165, Invalid=1560, Unknown=1, NotChecked=80, Total=1806 [2024-11-07 16:48:35,308 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 125 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:35,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 558 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 660 Invalid, 0 Unknown, 101 Unchecked, 0.4s Time] [2024-11-07 16:48:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 16:48:35,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2024-11-07 16:48:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-11-07 16:48:35,319 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 44 [2024-11-07 16:48:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:35,319 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-11-07 16:48:35,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-07 16:48:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-07 16:48:35,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 16:48:35,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:35,321 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:35,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 16:48:35,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 16:48:35,522 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:35,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash -348887256, now seen corresponding path program 1 times [2024-11-07 16:48:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:35,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130676506] [2024-11-07 16:48:35,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:35,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:35,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:35,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-07 16:48:35,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:35,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130676506] [2024-11-07 16:48:35,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130676506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:35,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:35,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:48:35,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174361721] [2024-11-07 16:48:35,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:35,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:48:35,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:35,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:48:35,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:48:35,606 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:48:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:35,658 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-07 16:48:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:48:35,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-07 16:48:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:35,659 INFO L225 Difference]: With dead ends: 86 [2024-11-07 16:48:35,659 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 16:48:35,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:48:35,660 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:35,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:48:35,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 16:48:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 16:48:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.403225806451613) internal successors, (87), 80 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-11-07 16:48:35,664 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 45 [2024-11-07 16:48:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:35,664 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-11-07 16:48:35,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:48:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-07 16:48:35,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 16:48:35,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:35,667 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:35,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:48:35,668 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:35,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2069401941, now seen corresponding path program 1 times [2024-11-07 16:48:35,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:35,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850213820] [2024-11-07 16:48:35,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:35,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:35,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:35,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:48:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:35,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850213820] [2024-11-07 16:48:35,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850213820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:35,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:35,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:48:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753737942] [2024-11-07 16:48:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:35,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:48:35,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:35,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:48:35,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:48:35,805 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:48:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:35,912 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-07 16:48:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:48:35,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-07 16:48:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:35,914 INFO L225 Difference]: With dead ends: 85 [2024-11-07 16:48:35,914 INFO L226 Difference]: Without dead ends: 85 [2024-11-07 16:48:35,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:48:35,915 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:35,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 253 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:48:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-07 16:48:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-07 16:48:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-11-07 16:48:35,919 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 46 [2024-11-07 16:48:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:35,920 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-11-07 16:48:35,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:48:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-07 16:48:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 16:48:35,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:35,922 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:35,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:48:35,922 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:35,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:35,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2069401942, now seen corresponding path program 1 times [2024-11-07 16:48:35,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:35,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036224351] [2024-11-07 16:48:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-07 16:48:36,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036224351] [2024-11-07 16:48:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036224351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:36,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:48:36,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353462758] [2024-11-07 16:48:36,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:36,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:48:36,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:36,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:48:36,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:48:36,064 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:36,126 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-07 16:48:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:48:36,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2024-11-07 16:48:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:36,127 INFO L225 Difference]: With dead ends: 88 [2024-11-07 16:48:36,127 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 16:48:36,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:48:36,128 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 41 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:36,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 198 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:48:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 16:48:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-11-07 16:48:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-07 16:48:36,134 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 46 [2024-11-07 16:48:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:36,134 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-07 16:48:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-07 16:48:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 16:48:36,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:36,135 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:36,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 16:48:36,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:36,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -271631443, now seen corresponding path program 1 times [2024-11-07 16:48:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150364925] [2024-11-07 16:48:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-07 16:48:36,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:36,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150364925] [2024-11-07 16:48:36,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150364925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:36,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101750792] [2024-11-07 16:48:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:36,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:36,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:36,338 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:48:36,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 16:48:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:48:36,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-07 16:48:36,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:48:36,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101750792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:36,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:48:36,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-07 16:48:36,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9548837] [2024-11-07 16:48:36,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:36,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:48:36,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:36,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:48:36,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:48:36,575 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:36,604 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-11-07 16:48:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:48:36,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-11-07 16:48:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:36,606 INFO L225 Difference]: With dead ends: 85 [2024-11-07 16:48:36,606 INFO L226 Difference]: Without dead ends: 85 [2024-11-07 16:48:36,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:48:36,606 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:36,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 165 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:48:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-07 16:48:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-07 16:48:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-07 16:48:36,612 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 47 [2024-11-07 16:48:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:36,612 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-07 16:48:36,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-07 16:48:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 16:48:36,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:36,614 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:36,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 16:48:36,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-07 16:48:36,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:36,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:36,815 INFO L85 PathProgramCache]: Analyzing trace with hash 169358236, now seen corresponding path program 1 times [2024-11-07 16:48:36,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:36,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438410607] [2024-11-07 16:48:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-07 16:48:36,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438410607] [2024-11-07 16:48:36,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438410607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:36,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:36,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:48:36,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124689642] [2024-11-07 16:48:36,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:36,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:48:36,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:36,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:48:36,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:48:36,905 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:48:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:36,987 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2024-11-07 16:48:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:48:36,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-07 16:48:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:36,988 INFO L225 Difference]: With dead ends: 80 [2024-11-07 16:48:36,988 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 16:48:36,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:48:36,990 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:36,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:48:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 16:48:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 16:48:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-07 16:48:36,994 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 48 [2024-11-07 16:48:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:36,995 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-07 16:48:36,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:48:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-07 16:48:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 16:48:36,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:36,996 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:36,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 16:48:36,996 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:36,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash 169358237, now seen corresponding path program 1 times [2024-11-07 16:48:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021677149] [2024-11-07 16:48:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:37,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:37,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:48:37,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:37,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021677149] [2024-11-07 16:48:37,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021677149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:37,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128230410] [2024-11-07 16:48:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:37,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:37,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:37,315 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:48:37,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 16:48:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:37,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 16:48:37,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:37,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2024-11-07 16:48:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-07 16:48:37,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:48:37,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128230410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:37,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:48:37,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 15 [2024-11-07 16:48:37,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867415106] [2024-11-07 16:48:37,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:37,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:48:37,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:37,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:48:37,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:48:37,620 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:48:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:37,664 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-11-07 16:48:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:48:37,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-07 16:48:37,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:37,665 INFO L225 Difference]: With dead ends: 79 [2024-11-07 16:48:37,665 INFO L226 Difference]: Without dead ends: 79 [2024-11-07 16:48:37,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:48:37,666 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:37,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:48:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-07 16:48:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-07 16:48:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-11-07 16:48:37,669 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 48 [2024-11-07 16:48:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:37,669 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-11-07 16:48:37,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:48:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-11-07 16:48:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 16:48:37,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:37,670 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:37,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 16:48:37,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:37,871 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:37,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:37,871 INFO L85 PathProgramCache]: Analyzing trace with hash 955138050, now seen corresponding path program 1 times [2024-11-07 16:48:37,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:37,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013131416] [2024-11-07 16:48:37,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:37,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 16:48:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013131416] [2024-11-07 16:48:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013131416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:38,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:38,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:48:38,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55852702] [2024-11-07 16:48:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:38,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:48:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:38,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:48:38,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:48:38,068 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:48:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:38,182 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-07 16:48:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:48:38,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2024-11-07 16:48:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:38,183 INFO L225 Difference]: With dead ends: 78 [2024-11-07 16:48:38,183 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 16:48:38,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:48:38,184 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:38,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 253 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:48:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 16:48:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-07 16:48:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-07 16:48:38,186 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 49 [2024-11-07 16:48:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:38,186 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-07 16:48:38,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:48:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-07 16:48:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 16:48:38,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:38,189 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:38,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 16:48:38,189 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:38,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:38,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1235335197, now seen corresponding path program 1 times [2024-11-07 16:48:38,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:38,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230971832] [2024-11-07 16:48:38,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:38,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-07 16:48:38,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:38,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230971832] [2024-11-07 16:48:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230971832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:48:38,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:48:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:48:38,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443334633] [2024-11-07 16:48:38,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:48:38,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:48:38,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:48:38,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:48:38,379 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:38,457 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-07 16:48:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:48:38,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2024-11-07 16:48:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:38,458 INFO L225 Difference]: With dead ends: 78 [2024-11-07 16:48:38,458 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 16:48:38,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:48:38,460 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:38,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 172 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:48:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 16:48:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-07 16:48:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.25) internal successors, (75), 70 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-11-07 16:48:38,464 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 51 [2024-11-07 16:48:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:38,464 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-11-07 16:48:38,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:48:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-11-07 16:48:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 16:48:38,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:38,465 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:38,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:48:38,465 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:38,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:38,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1703912836, now seen corresponding path program 1 times [2024-11-07 16:48:38,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:38,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437673446] [2024-11-07 16:48:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:38,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-07 16:48:38,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:38,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437673446] [2024-11-07 16:48:38,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437673446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:38,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578050455] [2024-11-07 16:48:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:38,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:38,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:38,672 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:48:38,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 16:48:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:38,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 16:48:38,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:38,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:48:38,989 INFO L378 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 9 treesize of output 3 [2024-11-07 16:48:39,009 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-07 16:48:39,054 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-07 16:48:39,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-07 16:48:39,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2024-11-07 16:48:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2024-11-07 16:48:39,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:48:39,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578050455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:39,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:48:39,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 16 [2024-11-07 16:48:39,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576547779] [2024-11-07 16:48:39,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:48:39,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 16:48:39,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:39,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 16:48:39,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=240, Unknown=1, NotChecked=30, Total=306 [2024-11-07 16:48:39,152 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:48:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:39,578 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2024-11-07 16:48:39,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:48:39,579 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 54 [2024-11-07 16:48:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:39,580 INFO L225 Difference]: With dead ends: 95 [2024-11-07 16:48:39,580 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 16:48:39,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=575, Unknown=1, NotChecked=48, Total=702 [2024-11-07 16:48:39,581 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 37 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:39,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 457 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 569 Invalid, 0 Unknown, 89 Unchecked, 0.3s Time] [2024-11-07 16:48:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 16:48:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2024-11-07 16:48:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2024-11-07 16:48:39,584 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 54 [2024-11-07 16:48:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:39,584 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2024-11-07 16:48:39,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:48:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-11-07 16:48:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 16:48:39,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:39,585 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:39,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 16:48:39,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:39,790 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:39,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:39,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1703912837, now seen corresponding path program 1 times [2024-11-07 16:48:39,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:39,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16179814] [2024-11-07 16:48:39,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:39,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:40,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:40,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:48:40,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:40,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16179814] [2024-11-07 16:48:40,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16179814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:40,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933879943] [2024-11-07 16:48:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:40,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:40,306 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:48:40,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 16:48:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:40,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-07 16:48:40,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:40,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:48:40,851 INFO L378 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 9 treesize of output 3 [2024-11-07 16:48:40,855 INFO L378 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 9 treesize of output 3 [2024-11-07 16:48:41,075 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-07 16:48:41,075 INFO L378 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 18 treesize of output 21 [2024-11-07 16:48:41,091 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-07 16:48:41,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-07 16:48:41,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:41,345 INFO L378 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 40 treesize of output 32 [2024-11-07 16:48:41,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2024-11-07 16:48:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:48:41,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:48:41,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933879943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:41,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:48:41,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2024-11-07 16:48:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6781900] [2024-11-07 16:48:41,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:48:41,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-07 16:48:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:41,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-07 16:48:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 16:48:41,685 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 32 states, 30 states have (on average 2.533333333333333) internal successors, (76), 27 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:48:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:42,812 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-07 16:48:42,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 16:48:42,812 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.533333333333333) internal successors, (76), 27 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-07 16:48:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:42,813 INFO L225 Difference]: With dead ends: 97 [2024-11-07 16:48:42,813 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 16:48:42,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=224, Invalid=2856, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 16:48:42,814 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:42,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 904 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 16:48:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 16:48:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2024-11-07 16:48:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 77 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:48:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-07 16:48:42,818 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 54 [2024-11-07 16:48:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:42,818 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-07 16:48:42,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.533333333333333) internal successors, (76), 27 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:48:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-07 16:48:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 16:48:42,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:42,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:48:42,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-07 16:48:43,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:43,023 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:48:43,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1970581028, now seen corresponding path program 1 times [2024-11-07 16:48:43,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:43,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866112634] [2024-11-07 16:48:43,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:43,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:48:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:43,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:48:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:43,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:48:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:48:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866112634] [2024-11-07 16:48:43,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866112634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829887254] [2024-11-07 16:48:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:43,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:43,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:43,310 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:48:43,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-07 16:48:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:43,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 16:48:43,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:43,811 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:48:43,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:43,813 INFO L378 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 16 treesize of output 11 [2024-11-07 16:48:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:48:43,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:48:43,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:43,911 INFO L378 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 17 treesize of output 17 [2024-11-07 16:48:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:48:44,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829887254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:48:44,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:48:44,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 28 [2024-11-07 16:48:44,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441798653] [2024-11-07 16:48:44,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:48:44,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 16:48:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:44,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 16:48:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2024-11-07 16:48:44,097 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 24 states have internal predecessors, (79), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-07 16:48:48,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:48:52,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:48:56,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:49:00,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:49:04,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:49:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:04,626 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-07 16:49:04,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 16:49:04,626 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 24 states have internal predecessors, (79), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 54 [2024-11-07 16:49:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:04,626 INFO L225 Difference]: With dead ends: 78 [2024-11-07 16:49:04,626 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 16:49:04,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2024-11-07 16:49:04,627 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 96 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:04,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 918 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 550 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2024-11-07 16:49:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 16:49:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-07 16:49:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:49:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-07 16:49:04,630 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 54 [2024-11-07 16:49:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:04,630 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-07 16:49:04,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 24 states have internal predecessors, (79), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-07 16:49:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-07 16:49:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 16:49:04,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:04,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:04,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-07 16:49:04,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:04,835 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:49:04,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:04,836 INFO L85 PathProgramCache]: Analyzing trace with hash -952420248, now seen corresponding path program 1 times [2024-11-07 16:49:04,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:04,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280194201] [2024-11-07 16:49:04,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:04,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:49:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:04,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:49:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:05,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:49:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:49:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280194201] [2024-11-07 16:49:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280194201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20248734] [2024-11-07 16:49:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:05,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:05,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:05,012 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:49:05,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-07 16:49:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:05,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 16:49:05,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:05,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2024-11-07 16:49:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:49:05,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:49:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20248734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:05,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 13 [2024-11-07 16:49:05,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924130825] [2024-11-07 16:49:05,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:05,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:49:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:49:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:49:05,383 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:49:09,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:49:13,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:49:17,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:49:21,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:49:25,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:49:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:25,585 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-07 16:49:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:49:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2024-11-07 16:49:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:25,587 INFO L225 Difference]: With dead ends: 78 [2024-11-07 16:49:25,587 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 16:49:25,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:49:25,588 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 63 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:25,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 489 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2024-11-07 16:49:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 16:49:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-07 16:49:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:49:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-07 16:49:25,591 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 57 [2024-11-07 16:49:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:25,591 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-07 16:49:25,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:49:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-07 16:49:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 16:49:25,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:25,591 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:25,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-07 16:49:25,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-07 16:49:25,796 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-07 16:49:25,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash 797430422, now seen corresponding path program 1 times [2024-11-07 16:49:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067772135] [2024-11-07 16:49:25,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 16:49:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:49:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 16:49:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 16:49:26,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:26,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067772135] [2024-11-07 16:49:26,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067772135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:26,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559497302] [2024-11-07 16:49:26,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:26,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:26,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:26,771 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:49:26,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-07 16:49:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:27,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-07 16:49:27,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:27,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:49:27,201 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-07 16:49:27,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-07 16:49:27,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:49:27,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 14 [2024-11-07 16:49:27,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 16:49:27,477 INFO L378 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 9 treesize of output 3 [2024-11-07 16:49:27,745 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-07 16:49:27,745 INFO L378 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 18 treesize of output 21 [2024-11-07 16:49:27,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:27,757 INFO L378 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 50 treesize of output 39 [2024-11-07 16:49:27,787 INFO L349 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2024-11-07 16:49:27,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2024-11-07 16:49:28,099 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-11-07 16:49:28,099 INFO L378 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 1 case distinctions, treesize of input 73 treesize of output 60 [2024-11-07 16:49:28,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:28,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-07 16:49:28,302 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-07 16:49:28,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 136 [2024-11-07 16:49:28,473 INFO L378 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 7 treesize of output 3 [2024-11-07 16:49:28,598 INFO L378 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 30 treesize of output 26 [2024-11-07 16:49:29,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 475 treesize of output 367 [2024-11-07 16:49:29,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:29,122 INFO L378 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 380 treesize of output 328 [2024-11-07 16:49:29,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:29,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 316 treesize of output 424 [2024-11-07 16:49:32,767 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:32,988 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,159 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,225 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,239 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,255 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,302 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,317 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,336 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,351 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,407 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,416 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,429 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,438 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,486 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,584 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,597 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,614 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,631 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,649 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,667 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,683 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,750 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,818 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,890 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,896 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:33,969 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:34,135 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:34,185 INFO L378 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 30 treesize of output 18 [2024-11-07 16:49:37,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:37,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 22 select indices, 22 select index equivalence classes, 0 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 231 case distinctions, treesize of input 1514 treesize of output 2798