./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_remove_all.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/dll2c_remove_all.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', '6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016'] 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/dll2c_remove_all.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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:45:20,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:45:20,489 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:45:20,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:45:20,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:45:20,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:45:20,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:45:20,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:45:20,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:45:20,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:45:20,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:45:20,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:45:20,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:45:20,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:45:20,526 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:45:20,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:45:20,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:45:20,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:45:20,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:45:20,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:45:20,528 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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2024-11-07 16:45:20,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:45:20,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:45:20,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:45:20,806 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:45:20,806 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:45:20,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-11-07 16:45:22,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:45:22,350 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:45:22,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-11-07 16:45:22,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc76cd3f2/d6bd2cb0d5284f4e9d7711f52d47455d/FLAGf54b37335 [2024-11-07 16:45:22,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc76cd3f2/d6bd2cb0d5284f4e9d7711f52d47455d [2024-11-07 16:45:22,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:45:22,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:45:22,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:45:22,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:45:22,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:45:22,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:45:22" (1/1) ... [2024-11-07 16:45:22,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3deb5f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:22, skipping insertion in model container [2024-11-07 16:45:22,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:45:22" (1/1) ... [2024-11-07 16:45:22,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:45:22,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:45:22,977 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:45:23,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:45:23,057 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:45:23,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23 WrapperNode [2024-11-07 16:45:23,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:45:23,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:45:23,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:45:23,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:45:23,063 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:45:23" (1/1) ... [2024-11-07 16:45:23,080 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:45:23" (1/1) ... [2024-11-07 16:45:23,102 INFO L138 Inliner]: procedures = 126, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-11-07 16:45:23,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:45:23,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:45:23,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:45:23,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:45:23,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (1/1) ... [2024-11-07 16:45:23,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (1/1) ... [2024-11-07 16:45:23,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (1/1) ... [2024-11-07 16:45:23,149 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 11, 9]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 11 writes are split as follows [0, 9, 2]. [2024-11-07 16:45:23,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (1/1) ... [2024-11-07 16:45:23,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (1/1) ... [2024-11-07 16:45:23,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (1/1) ... [2024-11-07 16:45:23,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (1/1) ... [2024-11-07 16:45:23,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (1/1) ... [2024-11-07 16:45:23,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (1/1) ... [2024-11-07 16:45:23,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:45:23,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:45:23,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:45:23,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:45:23,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (1/1) ... [2024-11-07 16:45:23,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:45:23,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:23,209 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:45:23,215 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:45:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:45:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:45:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 16:45:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-07 16:45:23,236 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-07 16:45:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:45:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:45:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:45:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:45:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:45:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:45:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:45:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:45:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:45:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:45:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 16:45:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 16:45:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 16:45:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:45:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:45:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 16:45:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:45:23,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:45:23,378 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:45:23,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:45:23,705 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-07 16:45:23,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:45:23,719 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:45:23,721 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 16:45:23,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:45:23 BoogieIcfgContainer [2024-11-07 16:45:23,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:45:23,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:45:23,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:45:23,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:45:23,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:45:22" (1/3) ... [2024-11-07 16:45:23,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28075dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:45:23, skipping insertion in model container [2024-11-07 16:45:23,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:23" (2/3) ... [2024-11-07 16:45:23,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28075dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:45:23, skipping insertion in model container [2024-11-07 16:45:23,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:45:23" (3/3) ... [2024-11-07 16:45:23,731 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2024-11-07 16:45:23,743 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:45:23,743 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-07 16:45:23,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:45:23,795 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;@287fa7af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:45:23,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-07 16:45:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 98 states have internal predecessors, (107), 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:45:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:45:23,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:23,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:45:23,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:23,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash 893979442, now seen corresponding path program 1 times [2024-11-07 16:45:23,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:23,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497015231] [2024-11-07 16:45:23,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:23,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:23,994 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:45:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497015231] [2024-11-07 16:45:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497015231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:23,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:45:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139542982] [2024-11-07 16:45:23,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:24,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:45:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:24,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:45:24,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:45:24,021 INFO L87 Difference]: Start difference. First operand has 102 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 98 states have internal predecessors, (107), 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:45:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:24,148 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2024-11-07 16:45:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:45:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-07 16:45:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:24,158 INFO L225 Difference]: With dead ends: 98 [2024-11-07 16:45:24,158 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 16:45:24,160 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:45:24,163 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:24,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 146 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:45:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 16:45:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-07 16:45:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 91 states have internal predecessors, (95), 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:45:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-07 16:45:24,209 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 6 [2024-11-07 16:45:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:24,209 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-07 16:45:24,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:45:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-07 16:45:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:45:24,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:24,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:45:24,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:45:24,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:24,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash 893979443, now seen corresponding path program 1 times [2024-11-07 16:45:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:24,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907947672] [2024-11-07 16:45:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:24,361 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:45:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:24,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907947672] [2024-11-07 16:45:24,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907947672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:24,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:24,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:45:24,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212586818] [2024-11-07 16:45:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:24,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:45:24,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:24,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:45:24,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:45:24,364 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:45:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:24,458 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-07 16:45:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:45:24,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-07 16:45:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:24,459 INFO L225 Difference]: With dead ends: 92 [2024-11-07 16:45:24,459 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 16:45:24,459 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:45:24,460 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:24,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:45:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 16:45:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 16:45:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 88 states have internal predecessors, (92), 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:45:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-07 16:45:24,466 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 6 [2024-11-07 16:45:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:24,466 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-07 16:45:24,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:45:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-07 16:45:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:45:24,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:24,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:24,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:45:24,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:24,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:24,472 INFO L85 PathProgramCache]: Analyzing trace with hash -931409769, now seen corresponding path program 1 times [2024-11-07 16:45:24,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:24,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352817248] [2024-11-07 16:45:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:24,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:24,649 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:45:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352817248] [2024-11-07 16:45:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352817248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:45:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273554692] [2024-11-07 16:45:24,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:24,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:45:24,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:24,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:45:24,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:45:24,651 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:45:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:24,774 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2024-11-07 16:45:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:45:24,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-11-07 16:45:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:24,776 INFO L225 Difference]: With dead ends: 103 [2024-11-07 16:45:24,776 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 16:45:24,776 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:45:24,777 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:24,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 213 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:45:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 16:45:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2024-11-07 16:45:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 50 states have (on average 1.86) internal successors, (93), 89 states have internal predecessors, (93), 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:45:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-07 16:45:24,784 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 14 [2024-11-07 16:45:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:24,784 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-07 16:45:24,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:45:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-07 16:45:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:45:24,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:24,785 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:24,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:45:24,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:24,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:24,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1115366016, now seen corresponding path program 1 times [2024-11-07 16:45:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:24,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004812130] [2024-11-07 16:45:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:24,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:24,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:45:25,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:25,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004812130] [2024-11-07 16:45:25,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004812130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:25,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:25,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:45:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493884385] [2024-11-07 16:45:25,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:25,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:45:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:45:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:45:25,038 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:45:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:25,255 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-07 16:45:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:45:25,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2024-11-07 16:45:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:25,256 INFO L225 Difference]: With dead ends: 92 [2024-11-07 16:45:25,256 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 16:45:25,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:45:25,257 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:25,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 285 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:45:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 16:45:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 16:45:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.84) internal successors, (92), 88 states have internal predecessors, (92), 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:45:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-07 16:45:25,265 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 24 [2024-11-07 16:45:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:25,266 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-07 16:45:25,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:45:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-07 16:45:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:45:25,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:25,270 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:25,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:45:25,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:25,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1115366017, now seen corresponding path program 1 times [2024-11-07 16:45:25,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:25,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778452381] [2024-11-07 16:45:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:25,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:25,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:25,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:25,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778452381] [2024-11-07 16:45:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778452381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:25,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:25,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:45:25,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645286469] [2024-11-07 16:45:25,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:25,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:45:25,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:25,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:45:25,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:45:25,646 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:25,835 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-07 16:45:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:45:25,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2024-11-07 16:45:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:25,837 INFO L225 Difference]: With dead ends: 91 [2024-11-07 16:45:25,838 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 16:45:25,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:45:25,838 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 6 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:25,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 309 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:45:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 16:45:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 16:45:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.82) internal successors, (91), 87 states have internal predecessors, (91), 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:45:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-07 16:45:25,863 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 24 [2024-11-07 16:45:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:25,863 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-07 16:45:25,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:45:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-07 16:45:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:45:25,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:25,864 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:25,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:45:25,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:25,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:25,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1875082911, now seen corresponding path program 1 times [2024-11-07 16:45:25,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:25,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646383268] [2024-11-07 16:45:25,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:25,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:26,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:26,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:26,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646383268] [2024-11-07 16:45:26,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646383268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100171185] [2024-11-07 16:45:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:26,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:26,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:26,218 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:45:26,229 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:45:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:26,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 16:45:26,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:26,421 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:45:26,483 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:45:26,567 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-07 16:45:26,567 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:45:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-07 16:45:26,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:45:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100171185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:26,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:45:26,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-11-07 16:45:26,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364096711] [2024-11-07 16:45:26,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:45:26,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:45:26,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:26,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:45:26,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-07 16:45:26,648 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:45:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:26,988 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-07 16:45:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:45:26,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-07 16:45:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:26,990 INFO L225 Difference]: With dead ends: 96 [2024-11-07 16:45:26,991 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 16:45:26,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-11-07 16:45:26,992 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:26,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2024-11-07 16:45:26,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 16:45:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-07 16:45:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 91 states have internal predecessors, (97), 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:45:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-11-07 16:45:27,005 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2024-11-07 16:45:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:27,005 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-11-07 16:45:27,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:45:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-07 16:45:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:45:27,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:27,006 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:27,025 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:45:27,206 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:45:27,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:27,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1875082910, now seen corresponding path program 1 times [2024-11-07 16:45:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:27,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780932269] [2024-11-07 16:45:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:27,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:27,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:27,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:27,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780932269] [2024-11-07 16:45:27,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780932269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:27,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128553776] [2024-11-07 16:45:27,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:27,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:27,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:27,697 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:45:27,699 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:45:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:27,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 16:45:27,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:27,838 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:45:27,844 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:45:28,090 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:45:28,090 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:45:28,112 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:45:28,112 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 11 treesize of output 11 [2024-11-07 16:45:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:45:28,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:45:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128553776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:28,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:45:28,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-07 16:45:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285917006] [2024-11-07 16:45:28,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:45:28,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 16:45:28,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:28,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 16:45:28,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:45:28,311 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:45:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:28,867 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2024-11-07 16:45:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:45:28,868 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-07 16:45:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:28,869 INFO L225 Difference]: With dead ends: 96 [2024-11-07 16:45:28,869 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 16:45:28,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2024-11-07 16:45:28,870 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:28,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 535 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 16:45:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 16:45:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-07 16:45:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 91 states have internal predecessors, (96), 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:45:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-07 16:45:28,877 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 26 [2024-11-07 16:45:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:28,877 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-07 16:45:28,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:45:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-07 16:45:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:45:28,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:28,878 INFO L215 NwaCegarLoop]: trace histogram [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:45:28,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 16:45:29,078 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:45:29,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:29,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1931740983, now seen corresponding path program 1 times [2024-11-07 16:45:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:29,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539461112] [2024-11-07 16:45:29,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:29,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:29,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:29,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539461112] [2024-11-07 16:45:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539461112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:29,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008087414] [2024-11-07 16:45:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:29,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:29,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:29,246 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:45:29,248 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:45:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:29,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 16:45:29,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:29,364 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:45:29,431 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-07 16:45:29,455 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:45:29,455 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 12 treesize of output 14 [2024-11-07 16:45:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-07 16:45:29,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:45:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008087414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:45:29,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:45:29,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2024-11-07 16:45:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511898463] [2024-11-07 16:45:29,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:45:29,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:45:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:29,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:45:29,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=131, Unknown=1, NotChecked=22, Total=182 [2024-11-07 16:45:29,663 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:45:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:29,969 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-11-07 16:45:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:45:29,970 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-11-07 16:45:29,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:29,971 INFO L225 Difference]: With dead ends: 95 [2024-11-07 16:45:29,971 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 16:45:29,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2024-11-07 16:45:29,972 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:29,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 619 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2024-11-07 16:45:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 16:45:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-07 16:45:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 90 states have internal predecessors, (94), 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:45:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-07 16:45:29,980 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 28 [2024-11-07 16:45:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:29,980 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-07 16:45:29,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:45:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-07 16:45:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:45:29,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:29,985 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:30,003 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:45:30,185 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:45:30,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:30,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash -250352333, now seen corresponding path program 1 times [2024-11-07 16:45:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829407290] [2024-11-07 16:45:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:30,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829407290] [2024-11-07 16:45:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829407290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711563565] [2024-11-07 16:45:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:30,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:30,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:30,477 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:45:30,478 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:45:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:30,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 16:45:30,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:30,618 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:45:30,620 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:45:30,749 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-07 16:45:30,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:45:30,785 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:45:30,793 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:45:30,794 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 11 treesize of output 11 [2024-11-07 16:45:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-07 16:45:30,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:45:30,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711563565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:30,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:45:30,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-07 16:45:30,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584755067] [2024-11-07 16:45:30,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:45:30,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 16:45:30,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:30,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 16:45:30,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-07 16:45:30,939 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:45:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:31,326 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-11-07 16:45:31,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:45:31,326 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-07 16:45:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:31,328 INFO L225 Difference]: With dead ends: 112 [2024-11-07 16:45:31,328 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 16:45:31,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-11-07 16:45:31,329 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:31,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 632 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 476 Invalid, 0 Unknown, 115 Unchecked, 0.3s Time] [2024-11-07 16:45:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 16:45:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2024-11-07 16:45:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 99 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2024-11-07 16:45:31,333 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 29 [2024-11-07 16:45:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:31,334 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2024-11-07 16:45:31,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:45:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2024-11-07 16:45:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:45:31,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:31,334 INFO L215 NwaCegarLoop]: trace histogram [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:45:31,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 16:45:31,536 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:45:31,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:31,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash 829012243, now seen corresponding path program 1 times [2024-11-07 16:45:31,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:31,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294309121] [2024-11-07 16:45:31,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:31,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:31,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:31,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:45:31,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:31,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294309121] [2024-11-07 16:45:31,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294309121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:31,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:31,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:45:31,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129982108] [2024-11-07 16:45:31,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:31,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:45:31,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:31,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:45:31,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:45:31,680 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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:45:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:31,901 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2024-11-07 16:45:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:45:31,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2024-11-07 16:45:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:31,902 INFO L225 Difference]: With dead ends: 104 [2024-11-07 16:45:31,902 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 16:45:31,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:45:31,903 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 7 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:31,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 314 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:45:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 16:45:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-07 16:45:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 98 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2024-11-07 16:45:31,911 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 30 [2024-11-07 16:45:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:31,911 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2024-11-07 16:45:31,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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:45:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2024-11-07 16:45:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:45:31,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:31,911 INFO L215 NwaCegarLoop]: trace histogram [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:45:31,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:45:31,912 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:31,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash 829012244, now seen corresponding path program 1 times [2024-11-07 16:45:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:31,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45288844] [2024-11-07 16:45:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:32,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45288844] [2024-11-07 16:45:32,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45288844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:32,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:45:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067608483] [2024-11-07 16:45:32,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:32,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:45:32,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:32,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:45:32,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:45:32,206 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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:45:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:32,402 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2024-11-07 16:45:32,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:45:32,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 30 [2024-11-07 16:45:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:32,403 INFO L225 Difference]: With dead ends: 103 [2024-11-07 16:45:32,404 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 16:45:32,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:45:32,404 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:32,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 339 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:45:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 16:45:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 16:45:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 97 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2024-11-07 16:45:32,408 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 30 [2024-11-07 16:45:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:32,409 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2024-11-07 16:45:32,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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:45:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2024-11-07 16:45:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:45:32,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:32,409 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 16:45:32,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:45:32,410 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:32,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2064334218, now seen corresponding path program 1 times [2024-11-07 16:45:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:32,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440510092] [2024-11-07 16:45:32,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:32,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:32,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:32,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:45:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:32,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440510092] [2024-11-07 16:45:32,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440510092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:32,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:32,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:45:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333717305] [2024-11-07 16:45:32,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:32,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:45:32,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:32,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:45:32,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:45:32,714 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:45:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:32,893 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2024-11-07 16:45:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:45:32,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 34 [2024-11-07 16:45:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:32,894 INFO L225 Difference]: With dead ends: 138 [2024-11-07 16:45:32,894 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 16:45:32,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:45:32,895 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 108 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:32,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 124 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:45:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 16:45:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2024-11-07 16:45:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 96 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2024-11-07 16:45:32,899 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 34 [2024-11-07 16:45:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:32,899 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2024-11-07 16:45:32,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:45:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2024-11-07 16:45:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:45:32,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:32,903 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 16:45:32,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:45:32,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:32,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2064334217, now seen corresponding path program 1 times [2024-11-07 16:45:32,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:32,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110119303] [2024-11-07 16:45:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:32,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:33,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:33,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 16:45:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110119303] [2024-11-07 16:45:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110119303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735976772] [2024-11-07 16:45:33,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:33,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:33,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:33,330 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:45:33,331 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:45:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:33,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 16:45:33,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:33,502 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:45:33,514 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:45:33,531 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:45:33,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:45:33,570 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:45:33,592 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:45:33,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:45:33,632 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:45:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 16:45:33,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:45:33,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735976772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:33,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:45:33,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2024-11-07 16:45:33,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526029981] [2024-11-07 16:45:33,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:45:33,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:45:33,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:45:33,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2024-11-07 16:45:33,792 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:45:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:33,971 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2024-11-07 16:45:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:45:33,972 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-07 16:45:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:33,972 INFO L225 Difference]: With dead ends: 94 [2024-11-07 16:45:33,973 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 16:45:33,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2024-11-07 16:45:33,973 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 135 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:33,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 119 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 171 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2024-11-07 16:45:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 16:45:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-07 16:45:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 88 states have internal predecessors, (98), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2024-11-07 16:45:33,976 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 34 [2024-11-07 16:45:33,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:33,977 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2024-11-07 16:45:33,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:45:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2024-11-07 16:45:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 16:45:33,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:33,978 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 16:45:33,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 16:45:34,181 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,SelfDestructingSolverStorable12 [2024-11-07 16:45:34,182 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:34,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash 430148705, now seen corresponding path program 1 times [2024-11-07 16:45:34,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:34,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621594983] [2024-11-07 16:45:34,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:34,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:34,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:45:34,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:34,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621594983] [2024-11-07 16:45:34,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621594983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:34,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:45:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892433503] [2024-11-07 16:45:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:34,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:45:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:45:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:45:34,400 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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:45:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:34,710 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2024-11-07 16:45:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:45:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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 35 [2024-11-07 16:45:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:34,712 INFO L225 Difference]: With dead ends: 124 [2024-11-07 16:45:34,712 INFO L226 Difference]: Without dead ends: 124 [2024-11-07 16:45:34,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:45:34,712 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 68 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:34,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 359 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:45:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-07 16:45:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2024-11-07 16:45:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.492537313432836) internal successors, (100), 89 states have internal predecessors, (100), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-11-07 16:45:34,715 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 35 [2024-11-07 16:45:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:34,716 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-11-07 16:45:34,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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:45:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-11-07 16:45:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 16:45:34,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:34,716 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 16:45:34,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:45:34,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:34,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash 430148706, now seen corresponding path program 1 times [2024-11-07 16:45:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:34,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045514167] [2024-11-07 16:45:34,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:34,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:34,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045514167] [2024-11-07 16:45:35,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045514167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:35,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:35,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:45:35,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728103721] [2024-11-07 16:45:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:35,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:45:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:35,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:45:35,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:45:35,074 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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:45:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:35,401 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-11-07 16:45:35,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:45:35,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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 35 [2024-11-07 16:45:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:35,403 INFO L225 Difference]: With dead ends: 127 [2024-11-07 16:45:35,403 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 16:45:35,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:45:35,404 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 71 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:35,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 428 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:45:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 16:45:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2024-11-07 16:45:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 89 states have internal predecessors, (99), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-11-07 16:45:35,410 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 35 [2024-11-07 16:45:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:35,410 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-11-07 16:45:35,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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:45:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-11-07 16:45:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 16:45:35,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:35,412 INFO L215 NwaCegarLoop]: trace histogram [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:45:35,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 16:45:35,412 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:35,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash 449706142, now seen corresponding path program 1 times [2024-11-07 16:45:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:35,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040787175] [2024-11-07 16:45:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:35,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:35,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:45:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040787175] [2024-11-07 16:45:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040787175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:35,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:35,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:45:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928535109] [2024-11-07 16:45:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:35,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:45:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:35,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:45:35,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:45:35,501 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 5 states, 5 states have (on average 5.0) 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:45:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:35,576 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2024-11-07 16:45:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:45:35,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) 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 36 [2024-11-07 16:45:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:35,577 INFO L225 Difference]: With dead ends: 128 [2024-11-07 16:45:35,577 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 16:45:35,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:45:35,577 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 120 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:35,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 177 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:45:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 16:45:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2024-11-07 16:45:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 88 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-11-07 16:45:35,582 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 36 [2024-11-07 16:45:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:35,582 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-11-07 16:45:35,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) 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:45:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-11-07 16:45:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 16:45:35,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:35,584 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-07 16:45:35,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 16:45:35,585 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:35,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash 28664815, now seen corresponding path program 1 times [2024-11-07 16:45:35,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:35,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805130185] [2024-11-07 16:45:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:35,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:35,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:35,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:45:35,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:35,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805130185] [2024-11-07 16:45:35,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805130185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:35,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:35,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:45:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137355214] [2024-11-07 16:45:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:35,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:45:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:35,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:45:35,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:45:35,698 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:35,816 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2024-11-07 16:45:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:45:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 40 [2024-11-07 16:45:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:35,817 INFO L225 Difference]: With dead ends: 93 [2024-11-07 16:45:35,817 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 16:45:35,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:45:35,818 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 23 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:35,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 203 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:45:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 16:45:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 16:45:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 87 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2024-11-07 16:45:35,821 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 40 [2024-11-07 16:45:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:35,821 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2024-11-07 16:45:35,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2024-11-07 16:45:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 16:45:35,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:35,822 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-07 16:45:35,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 16:45:35,822 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:35,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:35,823 INFO L85 PathProgramCache]: Analyzing trace with hash 28664816, now seen corresponding path program 1 times [2024-11-07 16:45:35,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:35,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245930595] [2024-11-07 16:45:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:35,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:36,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:36,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:36,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:36,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245930595] [2024-11-07 16:45:36,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245930595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:36,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 16:45:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197306372] [2024-11-07 16:45:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:36,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:45:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:36,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:45:36,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:45:36,249 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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:45:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:36,592 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2024-11-07 16:45:36,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:45:36,593 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 40 [2024-11-07 16:45:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:36,594 INFO L225 Difference]: With dead ends: 123 [2024-11-07 16:45:36,594 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 16:45:36,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:45:36,595 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 61 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:36,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 438 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:45:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 16:45:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2024-11-07 16:45:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 92 states have internal predecessors, (102), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2024-11-07 16:45:36,599 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 40 [2024-11-07 16:45:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:36,600 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2024-11-07 16:45:36,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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:45:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2024-11-07 16:45:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 16:45:36,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:36,601 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-07 16:45:36,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:45:36,601 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:36,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash 28650912, now seen corresponding path program 1 times [2024-11-07 16:45:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:36,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955550653] [2024-11-07 16:45:36,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:36,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:36,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:36,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955550653] [2024-11-07 16:45:36,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955550653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:36,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:36,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:45:36,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009135867] [2024-11-07 16:45:36,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:36,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:45:36,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:36,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:45:36,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:45:36,834 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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:45:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:37,102 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-07 16:45:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:45:37,102 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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 40 [2024-11-07 16:45:37,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:37,103 INFO L225 Difference]: With dead ends: 136 [2024-11-07 16:45:37,103 INFO L226 Difference]: Without dead ends: 136 [2024-11-07 16:45:37,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:45:37,104 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 72 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:37,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 520 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:45:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-07 16:45:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2024-11-07 16:45:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 104 states have internal predecessors, (122), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2024-11-07 16:45:37,109 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 40 [2024-11-07 16:45:37,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:37,109 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2024-11-07 16:45:37,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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:45:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2024-11-07 16:45:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 16:45:37,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:37,110 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:37,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:45:37,110 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:37,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:37,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1390382460, now seen corresponding path program 1 times [2024-11-07 16:45:37,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:37,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724751609] [2024-11-07 16:45:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:37,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:37,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:37,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:37,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 16:45:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 16:45:37,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:37,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724751609] [2024-11-07 16:45:37,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724751609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:37,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017943468] [2024-11-07 16:45:37,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:37,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:37,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:37,222 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:45:37,224 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:45:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:37,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:45:37,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 16:45:37,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:45:37,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017943468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:37,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:45:37,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-07 16:45:37,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093404980] [2024-11-07 16:45:37,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:37,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:45:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:45:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:45:37,443 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:45:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:37,457 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2024-11-07 16:45:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:45:37,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-07 16:45:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:37,458 INFO L225 Difference]: With dead ends: 92 [2024-11-07 16:45:37,458 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 16:45:37,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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:45:37,459 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:37,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:45:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 16:45:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 16:45:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 88 states have internal predecessors, (99), 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:45:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2024-11-07 16:45:37,463 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 41 [2024-11-07 16:45:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:37,463 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2024-11-07 16:45:37,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:45:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2024-11-07 16:45:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 16:45:37,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:37,464 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-11-07 16:45:37,486 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:45:37,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:37,665 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:37,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:37,665 INFO L85 PathProgramCache]: Analyzing trace with hash 888178371, now seen corresponding path program 1 times [2024-11-07 16:45:37,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:37,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143192246] [2024-11-07 16:45:37,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:37,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:37,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:37,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:37,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:37,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143192246] [2024-11-07 16:45:37,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143192246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:37,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:37,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:45:37,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107208026] [2024-11-07 16:45:37,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:37,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:45:37,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:37,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:45:37,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:45:37,904 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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:45:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:38,165 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-11-07 16:45:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:45:38,165 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 41 [2024-11-07 16:45:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:38,166 INFO L225 Difference]: With dead ends: 115 [2024-11-07 16:45:38,166 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 16:45:38,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:45:38,167 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 53 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:38,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 418 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:45:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 16:45:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2024-11-07 16:45:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 91 states have internal predecessors, (102), 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:45:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-11-07 16:45:38,174 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 41 [2024-11-07 16:45:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:38,174 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-11-07 16:45:38,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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:45:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-11-07 16:45:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:45:38,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:38,174 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-07 16:45:38,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:45:38,175 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:38,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:38,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1777085136, now seen corresponding path program 1 times [2024-11-07 16:45:38,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:38,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526252569] [2024-11-07 16:45:38,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:38,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526252569] [2024-11-07 16:45:38,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526252569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659923071] [2024-11-07 16:45:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:38,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:38,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:38,857 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:45:38,858 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:45:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:39,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-07 16:45:39,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:39,272 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:45:39,401 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:45:39,401 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 11 treesize of output 11 [2024-11-07 16:45:39,478 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 11 treesize of output 7 [2024-11-07 16:45:39,555 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:45:39,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-07 16:45:39,657 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:45:39,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-07 16:45:39,703 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 33 treesize of output 24 [2024-11-07 16:45:39,898 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 56 treesize of output 32 [2024-11-07 16:45:39,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:45:39,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-07 16:45:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:45:39,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:45:40,084 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 26 treesize of output 18 [2024-11-07 16:45:40,086 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 29 treesize of output 17 [2024-11-07 16:45:40,166 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-07 16:45:40,166 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 19 treesize of output 18 [2024-11-07 16:45:40,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:45:40,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-07 16:45:40,319 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 122 treesize of output 110 [2024-11-07 16:45:40,327 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 20 treesize of output 16 [2024-11-07 16:45:40,337 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:45:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659923071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:40,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:45:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 36 [2024-11-07 16:45:40,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656641747] [2024-11-07 16:45:40,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:45:40,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-07 16:45:40,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:40,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-07 16:45:40,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2099, Unknown=2, NotChecked=0, Total=2256 [2024-11-07 16:45:40,486 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:41,422 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2024-11-07 16:45:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 16:45:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2024-11-07 16:45:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:41,424 INFO L225 Difference]: With dead ends: 100 [2024-11-07 16:45:41,424 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 16:45:41,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=212, Invalid=2756, Unknown=2, NotChecked=0, Total=2970 [2024-11-07 16:45:41,426 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 112 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:41,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 753 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 16:45:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 16:45:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-07 16:45:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 93 states have internal predecessors, (105), 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:45:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-11-07 16:45:41,430 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 42 [2024-11-07 16:45:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:41,430 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-11-07 16:45:41,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-11-07 16:45:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:45:41,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:41,431 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-07 16:45:41,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 16:45:41,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:41,632 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:41,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1777085137, now seen corresponding path program 1 times [2024-11-07 16:45:41,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:41,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279534711] [2024-11-07 16:45:41,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:41,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:42,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:42,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:42,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279534711] [2024-11-07 16:45:42,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279534711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:42,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502680491] [2024-11-07 16:45:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:42,640 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:45:42,642 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:45:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:42,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-07 16:45:42,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:42,888 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:45:42,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:45:43,127 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:45:43,128 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:45:43,147 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:45:43,147 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 11 treesize of output 11 [2024-11-07 16:45:43,246 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 11 treesize of output 7 [2024-11-07 16:45:43,251 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 11 treesize of output 7 [2024-11-07 16:45:43,315 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:45:43,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-07 16:45:43,328 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 24 treesize of output 11 [2024-11-07 16:45:43,450 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:45:43,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-07 16:45:43,466 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:45:43,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-07 16:45:43,512 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 23 treesize of output 11 [2024-11-07 16:45:43,523 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 33 treesize of output 24 [2024-11-07 16:45:43,804 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 11 treesize of output 3 [2024-11-07 16:45:43,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:45:43,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 20 [2024-11-07 16:45:43,914 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 8 treesize of output 4 [2024-11-07 16:45:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:45:43,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:45:44,143 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 58 treesize of output 42 [2024-11-07 16:45:44,145 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 53 treesize of output 33 [2024-11-07 16:45:44,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:45:44,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-07 16:45:44,434 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 138 treesize of output 126 [2024-11-07 16:45:44,439 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 24 treesize of output 20 [2024-11-07 16:45:44,448 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 5 [2024-11-07 16:45:44,455 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 16:45:44,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2024-11-07 16:45:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502680491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:44,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:45:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2024-11-07 16:45:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708140626] [2024-11-07 16:45:44,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:45:44,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-07 16:45:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:44,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-07 16:45:44,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2581, Unknown=1, NotChecked=0, Total=2756 [2024-11-07 16:45:44,647 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 40 states, 38 states have (on average 1.736842105263158) internal successors, (66), 34 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:45,571 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2024-11-07 16:45:45,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:45:45,572 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.736842105263158) internal successors, (66), 34 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2024-11-07 16:45:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:45,572 INFO L225 Difference]: With dead ends: 113 [2024-11-07 16:45:45,572 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 16:45:45,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=267, Invalid=3514, Unknown=1, NotChecked=0, Total=3782 [2024-11-07 16:45:45,574 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 134 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:45,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 787 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 16:45:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 16:45:45,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2024-11-07 16:45:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 93 states have internal predecessors, (104), 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:45:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-07 16:45:45,577 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 42 [2024-11-07 16:45:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:45,577 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-07 16:45:45,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.736842105263158) internal successors, (66), 34 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:45:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-07 16:45:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:45:45,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:45,578 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-07 16:45:45,594 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:45:45,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:45,779 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:45,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1763725826, now seen corresponding path program 1 times [2024-11-07 16:45:45,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:45,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816478280] [2024-11-07 16:45:45,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:45,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:45,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:45,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:45:45,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:45,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816478280] [2024-11-07 16:45:45,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816478280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:45,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:45,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:45:45,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064699364] [2024-11-07 16:45:45,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:45,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:45:45,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:45:45,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:45:45,872 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:45:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:45,970 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-11-07 16:45:45,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:45:45,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 42 [2024-11-07 16:45:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:45,971 INFO L225 Difference]: With dead ends: 96 [2024-11-07 16:45:45,971 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 16:45:45,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:45:45,971 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:45,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 182 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:45:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 16:45:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-07 16:45:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.36) internal successors, (102), 92 states have internal predecessors, (102), 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:45:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2024-11-07 16:45:45,974 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 42 [2024-11-07 16:45:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:45,974 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2024-11-07 16:45:45,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:45:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2024-11-07 16:45:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 16:45:45,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:45,974 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-07 16:45:45,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 16:45:45,975 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:45,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash -744935575, now seen corresponding path program 1 times [2024-11-07 16:45:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958448757] [2024-11-07 16:45:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:46,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:46,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:46,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958448757] [2024-11-07 16:45:46,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958448757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:46,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:46,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 16:45:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726069282] [2024-11-07 16:45:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:46,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 16:45:46,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:46,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 16:45:46,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:45:46,484 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 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:45:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:46,756 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-07 16:45:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:45:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 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 43 [2024-11-07 16:45:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:46,757 INFO L225 Difference]: With dead ends: 99 [2024-11-07 16:45:46,757 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 16:45:46,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:45:46,757 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 22 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:46,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 532 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:45:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 16:45:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-07 16:45:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.368421052631579) internal successors, (104), 93 states have internal predecessors, (104), 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:45:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-07 16:45:46,760 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 43 [2024-11-07 16:45:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:46,761 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-07 16:45:46,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 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:45:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-07 16:45:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 16:45:46,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:46,761 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-07 16:45:46,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 16:45:46,762 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:46,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:46,764 INFO L85 PathProgramCache]: Analyzing trace with hash -744935574, now seen corresponding path program 1 times [2024-11-07 16:45:46,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:46,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163038108] [2024-11-07 16:45:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:46,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 16:45:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163038108] [2024-11-07 16:45:47,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163038108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762503225] [2024-11-07 16:45:47,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:47,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:47,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:47,484 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:45:47,485 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:45:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:47,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-07 16:45:47,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:48,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:45:48,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:45:48,369 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 26 [2024-11-07 16:45:48,404 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 23 treesize of output 15 [2024-11-07 16:45:48,406 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 26 treesize of output 14 [2024-11-07 16:45:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:48,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:45:48,711 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 62 treesize of output 46 [2024-11-07 16:45:48,713 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 57 treesize of output 37 [2024-11-07 16:45:48,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:45:48,893 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 19 treesize of output 23 [2024-11-07 16:45:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762503225] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:45:49,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:45:49,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 18] total 49 [2024-11-07 16:45:49,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646947958] [2024-11-07 16:45:49,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:45:49,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-07 16:45:49,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:49,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-07 16:45:49,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2290, Unknown=0, NotChecked=0, Total=2450 [2024-11-07 16:45:49,114 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 50 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 43 states have internal predecessors, (94), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-07 16:45:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:50,018 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2024-11-07 16:45:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:45:50,018 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 43 states have internal predecessors, (94), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2024-11-07 16:45:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:50,019 INFO L225 Difference]: With dead ends: 109 [2024-11-07 16:45:50,019 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 16:45:50,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=302, Invalid=3730, Unknown=0, NotChecked=0, Total=4032 [2024-11-07 16:45:50,020 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 192 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:50,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 957 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:45:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 16:45:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2024-11-07 16:45:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.355263157894737) internal successors, (103), 93 states have internal predecessors, (103), 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:45:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2024-11-07 16:45:50,024 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 43 [2024-11-07 16:45:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:50,024 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2024-11-07 16:45:50,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 43 states have internal predecessors, (94), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-07 16:45:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2024-11-07 16:45:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 16:45:50,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:50,025 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-07 16:45:50,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-07 16:45:50,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:50,225 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:50,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:50,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1159074138, now seen corresponding path program 1 times [2024-11-07 16:45:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:50,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22380348] [2024-11-07 16:45:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:50,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22380348] [2024-11-07 16:45:50,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22380348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474148233] [2024-11-07 16:45:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:50,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:50,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:50,501 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:45:50,504 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:45:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:50,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:45:50,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:50,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:45:50,847 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:45:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:45:50,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:45:50,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474148233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:50,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:45:50,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2024-11-07 16:45:50,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669166952] [2024-11-07 16:45:50,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:50,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:45:50,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:50,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:45:50,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-07 16:45:50,851 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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:45:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:50,957 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-11-07 16:45:50,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:45:50,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 43 [2024-11-07 16:45:50,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:50,958 INFO L225 Difference]: With dead ends: 96 [2024-11-07 16:45:50,958 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 16:45:50,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:45:50,959 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 90 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:50,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 107 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:45:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 16:45:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-07 16:45:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 92 states have internal predecessors, (101), 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:45:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2024-11-07 16:45:50,962 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 43 [2024-11-07 16:45:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:50,963 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2024-11-07 16:45:50,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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:45:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-11-07 16:45:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 16:45:50,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:50,963 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:50,981 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:45:51,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-07 16:45:51,164 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:51,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:51,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1376452779, now seen corresponding path program 1 times [2024-11-07 16:45:51,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:51,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901602645] [2024-11-07 16:45:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:51,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:51,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:51,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901602645] [2024-11-07 16:45:51,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901602645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:51,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:51,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:45:51,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134681373] [2024-11-07 16:45:51,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:51,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:45:51,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:51,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:45:51,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:45:51,350 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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:45:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:51,543 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2024-11-07 16:45:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:45:51,543 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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 45 [2024-11-07 16:45:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:51,544 INFO L225 Difference]: With dead ends: 119 [2024-11-07 16:45:51,544 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 16:45:51,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:45:51,545 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 53 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:51,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 463 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:45:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 16:45:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2024-11-07 16:45:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 99 states have internal predecessors, (113), 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:45:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2024-11-07 16:45:51,548 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 45 [2024-11-07 16:45:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:51,548 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2024-11-07 16:45:51,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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:45:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2024-11-07 16:45:51,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 16:45:51,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:51,549 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:51,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 16:45:51,549 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:51,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:51,549 INFO L85 PathProgramCache]: Analyzing trace with hash -279636685, now seen corresponding path program 1 times [2024-11-07 16:45:51,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:51,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855239498] [2024-11-07 16:45:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855239498] [2024-11-07 16:45:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855239498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:45:51,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110577174] [2024-11-07 16:45:51,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:51,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:45:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:45:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:45:51,753 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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:45:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:51,987 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-11-07 16:45:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:45:51,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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:45:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:51,988 INFO L225 Difference]: With dead ends: 112 [2024-11-07 16:45:51,989 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 16:45:51,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:45:51,990 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 33 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:51,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 409 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:45:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 16:45:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2024-11-07 16:45:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 102 states have internal predecessors, (116), 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:45:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2024-11-07 16:45:51,993 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 46 [2024-11-07 16:45:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:51,993 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2024-11-07 16:45:51,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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:45:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2024-11-07 16:45:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 16:45:51,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:51,993 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-07 16:45:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 16:45:51,994 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:51,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1559486405, now seen corresponding path program 1 times [2024-11-07 16:45:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089250443] [2024-11-07 16:45:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:52,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:52,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:45:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089250443] [2024-11-07 16:45:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089250443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566589758] [2024-11-07 16:45:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:52,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:52,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:52,098 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:45:52,100 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:45:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:52,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 16:45:52,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:52,340 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:45:52,349 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:45:52,358 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:45:52,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:45:52,384 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:45:52,392 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:45:52,395 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-07 16:45:52,408 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:45:52,408 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 12 treesize of output 14 [2024-11-07 16:45:52,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:45:52,470 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:45:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2024-11-07 16:45:52,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:45:54,134 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_62| Int) (v_ArrVal_3611 Int) (|ULTIMATE.start_dll_circular_remove_first_#t~mem10#1.base| Int)) (or (= (select (store (store |c_#valid| |v_node_create_~temp~0#1.base_62| 1) |ULTIMATE.start_dll_circular_remove_first_#t~mem10#1.base| v_ArrVal_3611) |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |ULTIMATE.start_dll_circular_remove_first_#t~mem10#1.base| 1)))) is different from false [2024-11-07 16:45:54,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566589758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:54,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:45:54,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 10 [2024-11-07 16:45:54,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060615260] [2024-11-07 16:45:54,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:45:54,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:45:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:54,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:45:54,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=87, Unknown=3, NotChecked=60, Total=182 [2024-11-07 16:45:54,137 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 11 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:45:54,150 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) (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:45:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:54,325 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2024-11-07 16:45:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:45:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-11-07 16:45:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:54,327 INFO L225 Difference]: With dead ends: 122 [2024-11-07 16:45:54,327 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 16:45:54,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=58, Invalid=136, Unknown=4, NotChecked=108, Total=306 [2024-11-07 16:45:54,327 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 163 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:54,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 156 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 263 Unchecked, 0.1s Time] [2024-11-07 16:45:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 16:45:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2024-11-07 16:45:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.313953488372093) internal successors, (113), 100 states have internal predecessors, (113), 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:45:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2024-11-07 16:45:54,330 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 46 [2024-11-07 16:45:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:54,331 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2024-11-07 16:45:54,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:45:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2024-11-07 16:45:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 16:45:54,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:54,332 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:54,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-07 16:45:54,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:54,532 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:54,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:54,533 INFO L85 PathProgramCache]: Analyzing trace with hash -78802515, now seen corresponding path program 1 times [2024-11-07 16:45:54,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:54,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688266926] [2024-11-07 16:45:54,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:54,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:54,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:54,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:45:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:54,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688266926] [2024-11-07 16:45:54,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688266926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:54,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:45:54,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:45:54,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364898372] [2024-11-07 16:45:54,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:54,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:45:54,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:45:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:45:54,630 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:45:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:54,734 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-07 16:45:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:45:54,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 47 [2024-11-07 16:45:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:54,735 INFO L225 Difference]: With dead ends: 103 [2024-11-07 16:45:54,735 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 16:45:54,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:45:54,736 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 17 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:54,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 178 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:45:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 16:45:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 16:45:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.302325581395349) internal successors, (112), 99 states have internal predecessors, (112), 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:45:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-07 16:45:54,738 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 47 [2024-11-07 16:45:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:54,739 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-07 16:45:54,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:45:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-07 16:45:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 16:45:54,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:54,740 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2024-11-07 16:45:54,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 16:45:54,740 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:54,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:54,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1099438322, now seen corresponding path program 1 times [2024-11-07 16:45:54,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:54,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546739649] [2024-11-07 16:45:54,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:54,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:55,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:55,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:55,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:55,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546739649] [2024-11-07 16:45:55,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546739649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:55,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926745851] [2024-11-07 16:45:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:55,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:55,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:55,570 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:45:55,572 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:45:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:55,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-07 16:45:55,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:55,858 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:45:55,942 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:45:55,942 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 11 treesize of output 11 [2024-11-07 16:45:55,992 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 11 treesize of output 7 [2024-11-07 16:45:56,035 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 16 treesize of output 11 [2024-11-07 16:45:56,100 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 16 treesize of output 11 [2024-11-07 16:45:56,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:45:56,107 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 26 treesize of output 21 [2024-11-07 16:45:56,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:45:56,350 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-07 16:45:56,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 41 [2024-11-07 16:45:56,455 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:45:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:45:56,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:45:56,631 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 8 treesize of output 4 [2024-11-07 16:45:56,662 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 25 treesize of output 13 [2024-11-07 16:45:56,673 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3921 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3921) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2024-11-07 16:45:56,755 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3921 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3920) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3921) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) is different from false [2024-11-07 16:45:56,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:45:56,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-07 16:45:56,771 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 85 treesize of output 81 [2024-11-07 16:45:56,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:45:56,782 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 94 treesize of output 98 [2024-11-07 16:45:56,789 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 98 treesize of output 94 [2024-11-07 16:45:56,795 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 85 treesize of output 83 [2024-11-07 16:45:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-07 16:45:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926745851] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:45:57,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:45:57,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 25] total 55 [2024-11-07 16:45:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464359705] [2024-11-07 16:45:57,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:45:57,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-07 16:45:57,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:57,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-07 16:45:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2571, Unknown=18, NotChecked=206, Total=2970 [2024-11-07 16:45:57,342 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 55 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 48 states have internal predecessors, (95), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:45:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:58,466 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-07 16:45:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:45:58,466 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 48 states have internal predecessors, (95), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 47 [2024-11-07 16:45:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:58,467 INFO L225 Difference]: With dead ends: 85 [2024-11-07 16:45:58,467 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 16:45:58,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=287, Invalid=3735, Unknown=18, NotChecked=250, Total=4290 [2024-11-07 16:45:58,468 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 54 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:58,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1097 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1145 Invalid, 0 Unknown, 84 Unchecked, 0.7s Time] [2024-11-07 16:45:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 16:45:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-07 16:45:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.234375) internal successors, (79), 77 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:45:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2024-11-07 16:45:58,472 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 47 [2024-11-07 16:45:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:58,473 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2024-11-07 16:45:58,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 48 states have internal predecessors, (95), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:45:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2024-11-07 16:45:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 16:45:58,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:58,473 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:58,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-07 16:45:58,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:58,674 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:58,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:58,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1852089462, now seen corresponding path program 1 times [2024-11-07 16:45:58,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:58,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356356817] [2024-11-07 16:45:58,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:58,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:45:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:58,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:45:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:45:58,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:45:58,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356356817] [2024-11-07 16:45:58,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356356817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:45:58,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872464574] [2024-11-07 16:45:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:58,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:58,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:45:58,895 INFO L229 MonitoredProcess]: Starting monitored process 14 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:45:58,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-07 16:45:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:45:59,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:45:59,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:45:59,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:45:59,258 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:45:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:45:59,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:45:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872464574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:45:59,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:45:59,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2024-11-07 16:45:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242701983] [2024-11-07 16:45:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:45:59,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:45:59,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:45:59,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:45:59,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-07 16:45:59,261 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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:45:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:45:59,348 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2024-11-07 16:45:59,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:45:59,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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:45:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:45:59,349 INFO L225 Difference]: With dead ends: 80 [2024-11-07 16:45:59,349 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 16:45:59,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:45:59,350 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 75 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:45:59,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 127 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:45:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 16:45:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 16:45:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.21875) internal successors, (78), 76 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:45:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2024-11-07 16:45:59,352 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 48 [2024-11-07 16:45:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:45:59,353 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2024-11-07 16:45:59,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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:45:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2024-11-07 16:45:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 16:45:59,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:45:59,353 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:45:59,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-07 16:45:59,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:45:59,554 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:45:59,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:45:59,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1739178274, now seen corresponding path program 1 times [2024-11-07 16:45:59,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:45:59,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753506352] [2024-11-07 16:45:59,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:45:59,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:45:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:46:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:46:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:46:00,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753506352] [2024-11-07 16:46:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753506352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408891171] [2024-11-07 16:46:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:00,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:00,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:00,433 INFO L229 MonitoredProcess]: Starting monitored process 15 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:46:00,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-07 16:46:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:00,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-07 16:46:00,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:00,720 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:46:00,873 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:46:00,873 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 11 treesize of output 11 [2024-11-07 16:46:00,934 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 11 treesize of output 7 [2024-11-07 16:46:00,937 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 11 treesize of output 7 [2024-11-07 16:46:00,981 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 16 treesize of output 11 [2024-11-07 16:46:00,985 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 16 treesize of output 11 [2024-11-07 16:46:01,057 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 16 treesize of output 11 [2024-11-07 16:46:01,066 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 16 treesize of output 11 [2024-11-07 16:46:01,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:01,108 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 27 treesize of output 11 [2024-11-07 16:46:01,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:01,111 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 35 treesize of output 26 [2024-11-07 16:46:01,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:01,477 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-07 16:46:01,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 46 [2024-11-07 16:46:01,495 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:01,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:01,501 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 27 treesize of output 19 [2024-11-07 16:46:01,892 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 45 treesize of output 37 [2024-11-07 16:46:02,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:02,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 9 [2024-11-07 16:46:02,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-07 16:46:02,076 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:46:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:02,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:02,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 8 treesize of output 4 [2024-11-07 16:46:02,701 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 56 treesize of output 32 [2024-11-07 16:46:02,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:02,922 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 60 treesize of output 64 [2024-11-07 16:46:02,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_4339 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store .cse0 .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) (or (and (forall ((v_ArrVal_4339 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_4339 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (forall ((v_ArrVal_4340 (Array Int Int)) (v_ArrVal_4341 Int)) (= (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4340) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_4341) 0) 0))))) is different from false [2024-11-07 16:46:03,239 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4340 (Array Int Int)) (v_ArrVal_4337 (Array Int Int)) (v_ArrVal_4338 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| Int) (v_ArrVal_4341 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| 4))) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4338) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4340) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 v_ArrVal_4341) 0) 0) (forall ((v_ArrVal_4339 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4337) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_4337 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_4339 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4337) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select .cse1 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store .cse1 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))))) (or (forall ((v_ArrVal_4337 (Array Int Int)) (v_ArrVal_4339 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4337) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (forall ((v_ArrVal_4340 (Array Int Int)) (v_ArrVal_4338 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4338) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4340) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)))) is different from false [2024-11-07 16:46:03,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:03,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-07 16:46:03,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:03,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-07 16:46:03,304 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 80 treesize of output 76 [2024-11-07 16:46:03,308 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 94 treesize of output 90 [2024-11-07 16:46:03,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 56 treesize of output 54 [2024-11-07 16:46:03,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:03,330 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 64 treesize of output 68 [2024-11-07 16:46:03,337 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 171 treesize of output 165 [2024-11-07 16:46:03,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:03,352 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 94 treesize of output 98 [2024-11-07 16:46:03,361 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 85 treesize of output 83 [2024-11-07 16:46:03,372 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 96 treesize of output 92 [2024-11-07 16:46:03,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:03,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-07 16:46:03,470 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:03,470 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:03,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-07 16:46:03,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:03,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-07 16:46:03,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:03,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:03,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-07 16:46:03,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:03,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 12 treesize of output 8 [2024-11-07 16:46:03,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:03,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2024-11-07 16:46:03,495 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:03,496 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:03,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-11-07 16:46:03,499 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:03,501 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 17 treesize of output 11 [2024-11-07 16:46:03,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408891171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:03,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:46:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 51 [2024-11-07 16:46:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061900825] [2024-11-07 16:46:03,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:03,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-07 16:46:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-07 16:46:03,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4429, Unknown=22, NotChecked=270, Total=4970 [2024-11-07 16:46:03,677 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 52 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 46 states have internal predecessors, (85), 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:46:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:04,906 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2024-11-07 16:46:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 16:46:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 46 states have internal predecessors, (85), 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 53 [2024-11-07 16:46:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:04,907 INFO L225 Difference]: With dead ends: 114 [2024-11-07 16:46:04,907 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 16:46:04,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=403, Invalid=6225, Unknown=22, NotChecked=322, Total=6972 [2024-11-07 16:46:04,909 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 99 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:04,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 803 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 16:46:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 16:46:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2024-11-07 16:46:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 83 states have internal predecessors, (87), 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:46:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2024-11-07 16:46:04,912 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 53 [2024-11-07 16:46:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:04,912 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2024-11-07 16:46:04,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 46 states have internal predecessors, (85), 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:46:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2024-11-07 16:46:04,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 16:46:04,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:04,912 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:04,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-07 16:46:05,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-07 16:46:05,113 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:46:05,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:05,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1739178273, now seen corresponding path program 1 times [2024-11-07 16:46:05,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:05,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971104480] [2024-11-07 16:46:05,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:05,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:06,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:46:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:46:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:46:06,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971104480] [2024-11-07 16:46:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971104480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281184470] [2024-11-07 16:46:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:06,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:06,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:06,263 INFO L229 MonitoredProcess]: Starting monitored process 16 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:46:06,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-07 16:46:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:06,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-07 16:46:06,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:06,555 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:46:06,560 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:46:06,798 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:46:06,798 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 11 treesize of output 11 [2024-11-07 16:46:06,803 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (or (exists ((|v_#length_BEFORE_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_12| |c_#length|))) (and (<= 12 (select |v_#length_BEFORE_CALL_12| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_12| .cse0 (select |c_#length| .cse0)))))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0)) is different from false [2024-11-07 16:46:06,804 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (or (exists ((|v_#length_BEFORE_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_12| |c_#length|))) (and (<= 12 (select |v_#length_BEFORE_CALL_12| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_12| .cse0 (select |c_#length| .cse0)))))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0)) is different from true [2024-11-07 16:46:06,848 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 11 treesize of output 7 [2024-11-07 16:46:06,853 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 11 treesize of output 7 [2024-11-07 16:46:06,915 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:46:06,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-07 16:46:06,922 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 24 treesize of output 11 [2024-11-07 16:46:07,017 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:46:07,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-07 16:46:07,028 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:46:07,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-07 16:46:07,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:07,073 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 27 treesize of output 11 [2024-11-07 16:46:07,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:07,076 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 35 treesize of output 26 [2024-11-07 16:46:07,422 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-07 16:46:07,422 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 27 treesize of output 19 [2024-11-07 16:46:07,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:07,445 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-07 16:46:07,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 46 [2024-11-07 16:46:07,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 16:46:07,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-07 16:46:07,996 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:46:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:08,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:08,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:08,590 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 130 treesize of output 129 [2024-11-07 16:46:08,704 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 44 treesize of output 28 [2024-11-07 16:46:08,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_4569 Int) (v_ArrVal_4566 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4566) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4569) 0))) (forall ((v_ArrVal_4569 Int) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4567 (Array Int Int))) (<= (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4566) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4569) 0) 4) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4567) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2024-11-07 16:46:09,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:09,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-07 16:46:09,520 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 178 treesize of output 172 [2024-11-07 16:46:09,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:09,532 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 54 treesize of output 58 [2024-11-07 16:46:09,559 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 57 treesize of output 55 [2024-11-07 16:46:09,565 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 58 treesize of output 54 [2024-11-07 16:46:09,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:09,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2024-11-07 16:46:09,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:09,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:09,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-07 16:46:09,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:09,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-07 16:46:09,649 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:09,650 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:09,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-07 16:46:09,657 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:09,658 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 23 treesize of output 19 [2024-11-07 16:46:09,661 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:09,663 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 16 treesize of output 12 [2024-11-07 16:46:09,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281184470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:09,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:46:09,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 49 [2024-11-07 16:46:09,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590731105] [2024-11-07 16:46:09,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:09,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-07 16:46:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:09,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-07 16:46:09,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4129, Unknown=91, NotChecked=262, Total=4692 [2024-11-07 16:46:09,945 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 50 states, 49 states have (on average 1.836734693877551) internal successors, (90), 44 states have internal predecessors, (90), 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:46:10,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (or (exists ((|v_#length_BEFORE_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_12| |c_#length|))) (and (<= 12 (select |v_#length_BEFORE_CALL_12| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_12| .cse0 (select |c_#length| .cse0)))))) (< 11 .cse1)) (= .cse1 12) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0))) is different from false [2024-11-07 16:46:10,347 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (or (exists ((|v_#length_BEFORE_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_12| |c_#length|))) (and (<= 12 (select |v_#length_BEFORE_CALL_12| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_12| .cse0 (select |c_#length| .cse0)))))) (< 11 .cse1)) (= .cse1 12) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0))) is different from true [2024-11-07 16:46:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:12,016 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2024-11-07 16:46:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 16:46:12,016 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.836734693877551) internal successors, (90), 44 states have internal predecessors, (90), 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 53 [2024-11-07 16:46:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:12,017 INFO L225 Difference]: With dead ends: 115 [2024-11-07 16:46:12,017 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 16:46:12,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=370, Invalid=6844, Unknown=108, NotChecked=510, Total=7832 [2024-11-07 16:46:12,019 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 109 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:12,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1091 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1841 Invalid, 0 Unknown, 164 Unchecked, 1.0s Time] [2024-11-07 16:46:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 16:46:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2024-11-07 16:46:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 83 states have internal predecessors, (86), 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:46:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2024-11-07 16:46:12,021 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 53 [2024-11-07 16:46:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:12,022 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2024-11-07 16:46:12,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.836734693877551) internal successors, (90), 44 states have internal predecessors, (90), 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:46:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2024-11-07 16:46:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 16:46:12,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:12,022 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:12,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-07 16:46:12,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-07 16:46:12,223 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:46:12,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1920046529, now seen corresponding path program 1 times [2024-11-07 16:46:12,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:12,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931429275] [2024-11-07 16:46:12,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:12,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:12,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:46:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:12,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:46:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:46:12,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:12,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931429275] [2024-11-07 16:46:12,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931429275] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:12,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773096794] [2024-11-07 16:46:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:12,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:12,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:12,312 INFO L229 MonitoredProcess]: Starting monitored process 17 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:46:12,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-07 16:46:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:12,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:46:12,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:46:12,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:46:12,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773096794] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:46:12,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:46:12,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-07 16:46:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254815478] [2024-11-07 16:46:12,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:12,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:46:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:12,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:46:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:46:12,731 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:46:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:12,785 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2024-11-07 16:46:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:46:12,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-07 16:46:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:12,786 INFO L225 Difference]: With dead ends: 87 [2024-11-07 16:46:12,786 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 16:46:12,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:46:12,787 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 71 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:12,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 241 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:46:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 16:46:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-07 16:46:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 83 states have internal predecessors, (85), 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:46:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2024-11-07 16:46:12,789 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 54 [2024-11-07 16:46:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:12,789 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2024-11-07 16:46:12,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:46:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2024-11-07 16:46:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 16:46:12,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:12,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2024-11-07 16:46:12,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-07 16:46:12,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:12,991 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:46:12,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:12,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1982838675, now seen corresponding path program 1 times [2024-11-07 16:46:12,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:12,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359933792] [2024-11-07 16:46:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:12,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:13,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:46:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:13,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:46:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:46:13,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:13,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359933792] [2024-11-07 16:46:13,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359933792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:13,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672343562] [2024-11-07 16:46:13,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:13,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:13,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:13,229 INFO L229 MonitoredProcess]: Starting monitored process 18 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:46:13,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-07 16:46:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:13,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-07 16:46:13,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:13,555 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:46:13,675 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:46:13,675 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 11 treesize of output 11 [2024-11-07 16:46:13,722 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 11 treesize of output 7 [2024-11-07 16:46:13,764 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:46:13,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-07 16:46:13,828 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:46:13,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-07 16:46:13,837 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 24 treesize of output 19 [2024-11-07 16:46:14,179 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2024-11-07 16:46:14,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 68 [2024-11-07 16:46:14,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-07 16:46:14,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-07 16:46:14,702 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 23 treesize of output 15 [2024-11-07 16:46:14,704 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 26 treesize of output 14 [2024-11-07 16:46:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:14,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:15,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:15,088 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 39 treesize of output 43 [2024-11-07 16:46:15,556 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-07 16:46:15,557 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 67 treesize of output 51 [2024-11-07 16:46:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:46:15,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672343562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:46:15,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:46:15,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 32, 11] total 48 [2024-11-07 16:46:15,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525205048] [2024-11-07 16:46:15,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:15,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-07 16:46:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:15,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-07 16:46:15,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2148, Unknown=0, NotChecked=0, Total=2352 [2024-11-07 16:46:15,598 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 49 states, 47 states have (on average 2.6595744680851063) internal successors, (125), 45 states have internal predecessors, (125), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:46:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:16,594 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2024-11-07 16:46:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-07 16:46:16,594 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 2.6595744680851063) internal successors, (125), 45 states have internal predecessors, (125), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2024-11-07 16:46:16,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:16,595 INFO L225 Difference]: With dead ends: 120 [2024-11-07 16:46:16,595 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 16:46:16,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=442, Invalid=3464, Unknown=0, NotChecked=0, Total=3906 [2024-11-07 16:46:16,596 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 264 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:16,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 824 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 16:46:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 16:46:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 96. [2024-11-07 16:46:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.225) internal successors, (98), 92 states have internal predecessors, (98), 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:46:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-07 16:46:16,597 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 58 [2024-11-07 16:46:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:16,598 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-07 16:46:16,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 2.6595744680851063) internal successors, (125), 45 states have internal predecessors, (125), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:46:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-07 16:46:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 16:46:16,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:16,598 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:16,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-07 16:46:16,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:16,799 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:46:16,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1982824771, now seen corresponding path program 1 times [2024-11-07 16:46:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:16,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782423276] [2024-11-07 16:46:16,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:16,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:46:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:46:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:46:17,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:17,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782423276] [2024-11-07 16:46:17,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782423276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:17,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027800848] [2024-11-07 16:46:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:17,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:17,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:17,651 INFO L229 MonitoredProcess]: Starting monitored process 19 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:46:17,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-07 16:46:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:17,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-07 16:46:17,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:17,985 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:46:18,155 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:46:18,156 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 11 treesize of output 11 [2024-11-07 16:46:18,231 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 15 treesize of output 1 [2024-11-07 16:46:18,302 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 16 treesize of output 11 [2024-11-07 16:46:18,403 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 16 treesize of output 11 [2024-11-07 16:46:18,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:18,413 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 27 treesize of output 11 [2024-11-07 16:46:18,698 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-07 16:46:18,698 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 27 treesize of output 19 [2024-11-07 16:46:18,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-07 16:46:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:19,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:19,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:19,619 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 63 treesize of output 62 [2024-11-07 16:46:19,712 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 20 treesize of output 12 [2024-11-07 16:46:20,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:20,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-07 16:46:20,206 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 162 treesize of output 156 [2024-11-07 16:46:20,211 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 47 treesize of output 45 [2024-11-07 16:46:20,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:20,220 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 64 treesize of output 68 [2024-11-07 16:46:20,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 58 treesize of output 54 [2024-11-07 16:46:20,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027800848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:20,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:46:20,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 51 [2024-11-07 16:46:20,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894849174] [2024-11-07 16:46:20,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:20,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-07 16:46:20,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:20,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-07 16:46:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4660, Unknown=64, NotChecked=0, Total=4970 [2024-11-07 16:46:20,525 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 52 states, 50 states have (on average 2.0) internal successors, (100), 46 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:46:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:22,061 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2024-11-07 16:46:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 16:46:22,061 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.0) internal successors, (100), 46 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2024-11-07 16:46:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:22,062 INFO L225 Difference]: With dead ends: 134 [2024-11-07 16:46:22,062 INFO L226 Difference]: Without dead ends: 134 [2024-11-07 16:46:22,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=471, Invalid=8201, Unknown=70, NotChecked=0, Total=8742 [2024-11-07 16:46:22,063 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 201 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:22,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1352 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 16:46:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-07 16:46:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2024-11-07 16:46:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 107 states have internal predecessors, (119), 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:46:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2024-11-07 16:46:22,065 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 58 [2024-11-07 16:46:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:22,066 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2024-11-07 16:46:22,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.0) internal successors, (100), 46 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:46:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2024-11-07 16:46:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 16:46:22,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:22,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:22,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-07 16:46:22,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-07 16:46:22,267 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:46:22,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1338025856, now seen corresponding path program 1 times [2024-11-07 16:46:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:22,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964485951] [2024-11-07 16:46:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:46:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:46:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:46:23,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964485951] [2024-11-07 16:46:23,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964485951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777939865] [2024-11-07 16:46:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:23,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:23,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:23,239 INFO L229 MonitoredProcess]: Starting monitored process 20 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:46:23,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-07 16:46:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:23,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-07 16:46:23,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:23,630 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:46:23,680 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:46:23,722 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:46:23,722 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 11 treesize of output 11 [2024-11-07 16:46:23,787 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 15 treesize of output 1 [2024-11-07 16:46:23,833 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 16 treesize of output 11 [2024-11-07 16:46:23,908 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 16 treesize of output 11 [2024-11-07 16:46:23,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:23,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 16:46:24,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:24,204 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-07 16:46:24,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 46 [2024-11-07 16:46:24,427 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 47 treesize of output 39 [2024-11-07 16:46:24,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2024-11-07 16:46:24,573 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:46:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:24,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:24,976 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 8 treesize of output 4 [2024-11-07 16:46:25,057 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 20 treesize of output 12 [2024-11-07 16:46:25,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5447 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5447) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-07 16:46:25,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:25,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-07 16:46:25,241 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 79 treesize of output 75 [2024-11-07 16:46:25,246 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 52 treesize of output 50 [2024-11-07 16:46:25,250 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 118 treesize of output 114 [2024-11-07 16:46:25,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:25,259 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 71 treesize of output 75 [2024-11-07 16:46:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777939865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:25,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:46:25,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 43 [2024-11-07 16:46:25,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694737080] [2024-11-07 16:46:25,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:25,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-07 16:46:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:25,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-07 16:46:25,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2548, Unknown=43, NotChecked=102, Total=2862 [2024-11-07 16:46:25,429 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 39 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:46:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:26,465 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2024-11-07 16:46:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 16:46:26,465 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 39 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2024-11-07 16:46:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:26,466 INFO L225 Difference]: With dead ends: 132 [2024-11-07 16:46:26,466 INFO L226 Difference]: Without dead ends: 132 [2024-11-07 16:46:26,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=222, Invalid=3398, Unknown=44, NotChecked=118, Total=3782 [2024-11-07 16:46:26,467 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:26,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 829 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 16:46:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-07 16:46:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2024-11-07 16:46:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 110 states have internal predecessors, (122), 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:46:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2024-11-07 16:46:26,469 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 59 [2024-11-07 16:46:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:26,470 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2024-11-07 16:46:26,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 39 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:46:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2024-11-07 16:46:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 16:46:26,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:26,470 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2024-11-07 16:46:26,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-07 16:46:26,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:26,671 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:46:26,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1457512013, now seen corresponding path program 1 times [2024-11-07 16:46:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088111769] [2024-11-07 16:46:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:28,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:46:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:46:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:46:28,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:28,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088111769] [2024-11-07 16:46:28,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088111769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:28,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446445854] [2024-11-07 16:46:28,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:28,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:28,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:28,145 INFO L229 MonitoredProcess]: Starting monitored process 21 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:46:28,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-07 16:46:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:28,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 150 conjuncts are in the unsatisfiable core [2024-11-07 16:46:28,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:28,497 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:46:28,696 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:46:28,696 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 11 treesize of output 11 [2024-11-07 16:46:28,777 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 11 treesize of output 7 [2024-11-07 16:46:28,780 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 11 treesize of output 7 [2024-11-07 16:46:28,836 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 16 treesize of output 11 [2024-11-07 16:46:28,841 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 16 treesize of output 11 [2024-11-07 16:46:28,934 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 16 treesize of output 11 [2024-11-07 16:46:28,939 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 16 treesize of output 11 [2024-11-07 16:46:28,944 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 19 treesize of output 18 [2024-11-07 16:46:28,947 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 24 treesize of output 19 [2024-11-07 16:46:29,480 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2024-11-07 16:46:29,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 68 [2024-11-07 16:46:29,504 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:29,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:29,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 63 [2024-11-07 16:46:29,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:46:29,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:46:30,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-07 16:46:30,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 16:46:30,550 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 27 treesize of output 11 [2024-11-07 16:46:30,554 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 11 treesize of output 3 [2024-11-07 16:46:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:30,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:31,253 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 124 treesize of output 96 [2024-11-07 16:46:31,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:31,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:31,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:31,871 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 157 treesize of output 156 [2024-11-07 16:46:31,907 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 48 treesize of output 28 [2024-11-07 16:46:32,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_5669 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5669) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (= (select .cse0 0) (select .cse0 4)))) (forall ((v_ArrVal_5668 (Array Int Int))) (let ((.cse2 (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5668) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse2 0) (select .cse2 4)))))) is different from false [2024-11-07 16:46:32,067 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_5668 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5668) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 4) (select .cse0 0)))) (forall ((v_ArrVal_5669 (Array Int Int))) (let ((.cse2 (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5669) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (= (select .cse2 0) (select .cse2 4)))))) is different from false [2024-11-07 16:46:32,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_5666 (Array Int Int)) (v_ArrVal_5669 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5666) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5669) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (= (select .cse0 0) (select .cse0 4)))) (forall ((v_ArrVal_5668 (Array Int Int)) (v_ArrVal_5667 (Array Int Int))) (let ((.cse2 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5667) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5668) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse2 0) (select .cse2 4)))))) is different from false [2024-11-07 16:46:32,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:32,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2024-11-07 16:46:32,095 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 222 treesize of output 212 [2024-11-07 16:46:32,100 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 82 treesize of output 74 [2024-11-07 16:46:32,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:32,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 115 [2024-11-07 16:46:32,193 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 110 treesize of output 94 [2024-11-07 16:46:32,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:32,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-07 16:46:32,206 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:32,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:46:32,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-07 16:46:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446445854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:32,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:46:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 62 [2024-11-07 16:46:32,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419593487] [2024-11-07 16:46:32,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:32,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-07 16:46:32,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:32,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-07 16:46:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=6067, Unknown=3, NotChecked=474, Total=6806 [2024-11-07 16:46:32,317 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 62 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 56 states have internal predecessors, (104), 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:46:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:34,007 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2024-11-07 16:46:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-07 16:46:34,007 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 56 states have internal predecessors, (104), 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 60 [2024-11-07 16:46:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:34,008 INFO L225 Difference]: With dead ends: 116 [2024-11-07 16:46:34,008 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 16:46:34,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=429, Invalid=8700, Unknown=3, NotChecked=570, Total=9702 [2024-11-07 16:46:34,009 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:34,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1110 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 16:46:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 16:46:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-07 16:46:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 110 states have internal predecessors, (121), 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:46:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2024-11-07 16:46:34,011 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 60 [2024-11-07 16:46:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:34,012 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2024-11-07 16:46:34,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 56 states have internal predecessors, (104), 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:46:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2024-11-07 16:46:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 16:46:34,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:34,013 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:34,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-07 16:46:34,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-07 16:46:34,213 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:46:34,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:34,214 INFO L85 PathProgramCache]: Analyzing trace with hash -709232657, now seen corresponding path program 1 times [2024-11-07 16:46:34,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:34,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452179819] [2024-11-07 16:46:34,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:34,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:46:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:46:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:46:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452179819] [2024-11-07 16:46:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452179819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830884163] [2024-11-07 16:46:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:34,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:34,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:34,311 INFO L229 MonitoredProcess]: Starting monitored process 22 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:46:34,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-07 16:46:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:34,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:46:34,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:46:34,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:46:34,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830884163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:34,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:46:34,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-07 16:46:34,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758452722] [2024-11-07 16:46:34,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:34,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:46:34,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:34,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:46:34,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:46:34,747 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:46:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:34,759 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2024-11-07 16:46:34,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:46:34,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 65 [2024-11-07 16:46:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:34,759 INFO L225 Difference]: With dead ends: 63 [2024-11-07 16:46:34,759 INFO L226 Difference]: Without dead ends: 63 [2024-11-07 16:46:34,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:46:34,760 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:34,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:46:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-07 16:46:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-07 16:46:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 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:46:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2024-11-07 16:46:34,762 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 65 [2024-11-07 16:46:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:34,762 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2024-11-07 16:46:34,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:46:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2024-11-07 16:46:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 16:46:34,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:34,763 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:34,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-07 16:46:34,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-07 16:46:34,971 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:46:34,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash -511377712, now seen corresponding path program 1 times [2024-11-07 16:46:34,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:34,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781392482] [2024-11-07 16:46:34,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:34,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:46:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:46:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:46:37,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:37,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781392482] [2024-11-07 16:46:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781392482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:37,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338840024] [2024-11-07 16:46:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:37,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:37,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:37,220 INFO L229 MonitoredProcess]: Starting monitored process 23 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:46:37,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-07 16:46:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:37,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-07 16:46:37,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:38,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:46:38,307 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:46:38,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 152 [2024-11-07 16:46:38,626 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:46:38,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 138 [2024-11-07 16:46:38,665 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 163 treesize of output 122 [2024-11-07 16:46:40,154 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2024-11-07 16:46:40,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 283 treesize of output 211