./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_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/dll2n_update_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', 'c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494'] 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/dll2n_update_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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:46:50,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:46:50,729 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:46:50,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:46:50,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:46:50,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:46:50,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:46:50,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:46:50,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:46:50,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:46:50,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:46:50,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:46:50,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:46:50,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:46:50,753 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:46:50,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:46:50,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:46:50,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:46:50,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:46:50,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:46:50,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:46:50,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:46:50,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:46:50,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:46:50,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:46:50,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:46:50,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:46:50,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:46:50,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:46:50,756 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2024-11-07 16:46:50,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:46:50,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:46:50,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:46:50,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:46:50,995 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:46:50,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2024-11-07 16:46:52,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:46:52,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:46:52,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2024-11-07 16:46:52,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb2a8617f/c0b63d6944ab47a5bb3e6603e06d5d78/FLAG6a6290878 [2024-11-07 16:46:52,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb2a8617f/c0b63d6944ab47a5bb3e6603e06d5d78 [2024-11-07 16:46:52,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:46:52,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:46:52,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:46:52,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:46:52,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:46:52,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2d262f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52, skipping insertion in model container [2024-11-07 16:46:52,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:46:52,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:46:52,698 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:46:52,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:46:52,749 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:46:52,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52 WrapperNode [2024-11-07 16:46:52,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:46:52,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:46:52,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:46:52,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:46:52,755 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:46:52" (1/1) ... [2024-11-07 16:46:52,771 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:46:52" (1/1) ... [2024-11-07 16:46:52,789 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 120 [2024-11-07 16:46:52,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:46:52,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:46:52,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:46:52,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:46:52,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,818 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-07 16:46:52,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:46:52,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:46:52,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:46:52,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:46:52,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (1/1) ... [2024-11-07 16:46:52,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:46:52,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:52,874 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:46:52,878 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:46:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-07 16:46:52,897 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-07 16:46:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:46:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:46:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:46:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:46:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:46:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:46:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:46:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:46:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:46:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:46:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:46:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:46:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:46:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:46:52,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:46:52,991 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:46:52,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:46:53,009 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-07 16:46:53,198 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-07 16:46:53,198 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:46:53,205 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:46:53,206 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-07 16:46:53,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:46:53 BoogieIcfgContainer [2024-11-07 16:46:53,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:46:53,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:46:53,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:46:53,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:46:53,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:46:52" (1/3) ... [2024-11-07 16:46:53,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ab3cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:46:53, skipping insertion in model container [2024-11-07 16:46:53,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:52" (2/3) ... [2024-11-07 16:46:53,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ab3cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:46:53, skipping insertion in model container [2024-11-07 16:46:53,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:46:53" (3/3) ... [2024-11-07 16:46:53,214 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2024-11-07 16:46:53,224 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:46:53,225 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-07 16:46:53,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:46:53,271 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;@2a5d2c9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:46:53,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-07 16:46:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 68 states have internal predecessors, (84), 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:46:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:46:53,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:53,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:46:53,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:53,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:53,300 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2024-11-07 16:46:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:53,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965837018] [2024-11-07 16:46:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:53,463 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:46:53,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965837018] [2024-11-07 16:46:53,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965837018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:53,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:46:53,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:46:53,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879147040] [2024-11-07 16:46:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:53,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:46:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:53,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:46:53,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:46:53,495 INFO L87 Difference]: Start difference. First operand has 70 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 68 states have internal predecessors, (84), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:53,554 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-11-07 16:46:53,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:46:53,556 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 16:46:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:53,560 INFO L225 Difference]: With dead ends: 66 [2024-11-07 16:46:53,560 INFO L226 Difference]: Without dead ends: 61 [2024-11-07 16:46:53,561 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:46:53,563 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:53,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 102 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:46:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-07 16:46:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-07 16:46:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-11-07 16:46:53,593 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 5 [2024-11-07 16:46:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:53,594 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-07 16:46:53,594 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-11-07 16:46:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:46:53,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:53,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:46:53,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:46:53,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:53,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2024-11-07 16:46:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122594705] [2024-11-07 16:46:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:53,684 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:46:53,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:53,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122594705] [2024-11-07 16:46:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122594705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:53,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:46:53,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:46:53,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204977738] [2024-11-07 16:46:53,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:53,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:46:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:53,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:46:53,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:46:53,687 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:53,719 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-11-07 16:46:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:46:53,719 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 16:46:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:53,719 INFO L225 Difference]: With dead ends: 58 [2024-11-07 16:46:53,719 INFO L226 Difference]: Without dead ends: 58 [2024-11-07 16:46:53,720 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:46:53,720 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:53,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:46:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-07 16:46:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-07 16:46:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 57 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2024-11-07 16:46:53,724 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 5 [2024-11-07 16:46:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:53,724 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2024-11-07 16:46:53,724 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-11-07 16:46:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 16:46:53,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:53,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:53,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:46:53,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:53,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:53,727 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2024-11-07 16:46:53,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:53,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277034458] [2024-11-07 16:46:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:53,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:53,762 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:46:53,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:53,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277034458] [2024-11-07 16:46:53,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277034458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:53,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:46:53,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:46:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661889655] [2024-11-07 16:46:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:53,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:46:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:53,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:46:53,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:46:53,764 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:53,773 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-07 16:46:53,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:46:53,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-07 16:46:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:53,774 INFO L225 Difference]: With dead ends: 68 [2024-11-07 16:46:53,775 INFO L226 Difference]: Without dead ends: 68 [2024-11-07 16:46:53,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:53,775 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:53,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:46:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-07 16:46:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-11-07 16:46:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-07 16:46:53,779 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 8 [2024-11-07 16:46:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:53,779 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-07 16:46:53,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-07 16:46:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:46:53,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:53,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:53,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:46:53,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:53,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2024-11-07 16:46:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:53,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988743224] [2024-11-07 16:46:53,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:53,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:53,855 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:46:53,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:53,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988743224] [2024-11-07 16:46:53,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988743224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:53,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:46:53,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:46:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296776089] [2024-11-07 16:46:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:53,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:46:53,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:46:53,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:46:53,856 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:53,874 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-07 16:46:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:46:53,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 16:46:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:53,875 INFO L225 Difference]: With dead ends: 64 [2024-11-07 16:46:53,875 INFO L226 Difference]: Without dead ends: 64 [2024-11-07 16:46:53,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:53,876 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 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:46:53,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:46:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-07 16:46:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-07 16:46:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-07 16:46:53,883 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 9 [2024-11-07 16:46:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:53,884 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-07 16:46:53,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-07 16:46:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:46:53,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:53,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:53,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:46:53,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:53,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2024-11-07 16:46:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:53,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278054000] [2024-11-07 16:46:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:54,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:54,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278054000] [2024-11-07 16:46:54,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278054000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:54,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780762057] [2024-11-07 16:46:54,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:54,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:54,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:54,003 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:46:54,005 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:46:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:54,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:46:54,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:54,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:54,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780762057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:46:54,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:46:54,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-07 16:46:54,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739483419] [2024-11-07 16:46:54,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:54,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:46:54,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:46:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:46:54,136 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:54,150 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-07 16:46:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:46:54,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 16:46:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:54,151 INFO L225 Difference]: With dead ends: 66 [2024-11-07 16:46:54,151 INFO L226 Difference]: Without dead ends: 66 [2024-11-07 16:46:54,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:46:54,152 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:54,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 130 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:46:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-07 16:46:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-07 16:46:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.469387755102041) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-07 16:46:54,155 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 15 [2024-11-07 16:46:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:54,156 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-07 16:46:54,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-07 16:46:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:46:54,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:54,156 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:54,169 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:46:54,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:54,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:54,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2024-11-07 16:46:54,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:54,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847260556] [2024-11-07 16:46:54,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:54,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847260556] [2024-11-07 16:46:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847260556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714965086] [2024-11-07 16:46:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:54,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:54,554 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:46:54,555 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:46:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:54,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:46:54,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:54,656 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:54,688 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:46:54,688 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:46:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:54,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:54,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714965086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:46:54,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:46:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-07 16:46:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121044958] [2024-11-07 16:46:54,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:54,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:46:54,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:54,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:46:54,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:46:54,739 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:54,807 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2024-11-07 16:46:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:46:54,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 16:46:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:54,808 INFO L225 Difference]: With dead ends: 65 [2024-11-07 16:46:54,808 INFO L226 Difference]: Without dead ends: 65 [2024-11-07 16:46:54,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:46:54,809 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:54,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 160 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:46:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-07 16:46:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-07 16:46:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-07 16:46:54,815 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 16 [2024-11-07 16:46:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:54,815 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-07 16:46:54,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-07 16:46:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:46:54,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:54,816 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:54,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 16:46:55,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:55,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:55,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2024-11-07 16:46:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399921735] [2024-11-07 16:46:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:55,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:55,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399921735] [2024-11-07 16:46:55,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399921735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:55,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030699064] [2024-11-07 16:46:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:55,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:55,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:55,192 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:46:55,194 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:46:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:55,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 16:46:55,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:55,280 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:55,284 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:55,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:55,340 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:46:55,347 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:46:55,347 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:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:55,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:55,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030699064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:46:55,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:46:55,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-07 16:46:55,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998699670] [2024-11-07 16:46:55,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:55,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:46:55,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:55,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:46:55,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:46:55,606 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:55,727 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-07 16:46:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:46:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 16:46:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:55,729 INFO L225 Difference]: With dead ends: 64 [2024-11-07 16:46:55,729 INFO L226 Difference]: Without dead ends: 64 [2024-11-07 16:46:55,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:46:55,729 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 19 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:55,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 277 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:46:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-07 16:46:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-07 16:46:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-07 16:46:55,735 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 16 [2024-11-07 16:46:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:55,735 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-07 16:46:55,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-07 16:46:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:46:55,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:55,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:55,749 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:46:55,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:55,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:55,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:55,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2024-11-07 16:46:55,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:55,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258137652] [2024-11-07 16:46:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:55,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:55,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258137652] [2024-11-07 16:46:55,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258137652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:55,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948315628] [2024-11-07 16:46:55,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:46:55,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:55,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:55,994 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:46:55,995 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:46:56,060 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:46:56,061 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:46:56,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:46:56,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:56,079 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:46:56,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:46:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948315628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:56,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:46:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-07 16:46:56,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949031473] [2024-11-07 16:46:56,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:56,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:46:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:56,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:46:56,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:46:56,080 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:56,106 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-07 16:46:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:46:56,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-07 16:46:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:56,107 INFO L225 Difference]: With dead ends: 88 [2024-11-07 16:46:56,107 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 16:46:56,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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:46:56,107 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:56,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 160 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:46:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 16:46:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2024-11-07 16:46:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 65 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-11-07 16:46:56,113 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 22 [2024-11-07 16:46:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:56,113 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-11-07 16:46:56,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-07 16:46:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:46:56,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:56,115 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:56,128 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:46:56,315 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,SelfDestructingSolverStorable7 [2024-11-07 16:46:56,316 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:56,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:56,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969322, now seen corresponding path program 1 times [2024-11-07 16:46:56,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:56,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081851487] [2024-11-07 16:46:56,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:56,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081851487] [2024-11-07 16:46:56,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081851487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260710353] [2024-11-07 16:46:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:56,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:56,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:56,374 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:46:56,375 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:46:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:56,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:46:56,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:56,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:46:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260710353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:46:56,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:46:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-07 16:46:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117205053] [2024-11-07 16:46:56,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:56,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:46:56,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:56,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:46:56,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:46:56,491 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:56,516 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-07 16:46:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:46:56,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-07 16:46:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:56,521 INFO L225 Difference]: With dead ends: 66 [2024-11-07 16:46:56,521 INFO L226 Difference]: Without dead ends: 66 [2024-11-07 16:46:56,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:46:56,521 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:56,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:46:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-07 16:46:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-07 16:46:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.411764705882353) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-07 16:46:56,526 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 22 [2024-11-07 16:46:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:56,526 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-07 16:46:56,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-07 16:46:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:46:56,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:56,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:56,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 16:46:56,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:56,728 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:56,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022437, now seen corresponding path program 1 times [2024-11-07 16:46:56,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:56,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909075477] [2024-11-07 16:46:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:56,820 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:46:56,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:56,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909075477] [2024-11-07 16:46:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909075477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:56,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:46:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:46:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32759477] [2024-11-07 16:46:56,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:56,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:46:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:56,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:46:56,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:46:56,821 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:56,940 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-11-07 16:46:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:46:56,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:46:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:56,941 INFO L225 Difference]: With dead ends: 69 [2024-11-07 16:46:56,941 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 16:46:56,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:46:56,942 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 47 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:56,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 174 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:46:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 16:46:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-07 16:46:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-11-07 16:46:56,944 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 23 [2024-11-07 16:46:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:56,944 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-11-07 16:46:56,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-11-07 16:46:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:46:56,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:56,945 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:56,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:46:56,946 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:56,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022436, now seen corresponding path program 1 times [2024-11-07 16:46:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:56,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565978782] [2024-11-07 16:46:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:57,130 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:46:57,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:57,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565978782] [2024-11-07 16:46:57,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565978782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:57,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:46:57,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:46:57,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762859285] [2024-11-07 16:46:57,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:57,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:46:57,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:57,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:46:57,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:46:57,132 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:57,238 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-11-07 16:46:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:46:57,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:46:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:57,240 INFO L225 Difference]: With dead ends: 69 [2024-11-07 16:46:57,240 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 16:46:57,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:46:57,240 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 44 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:57,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 198 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:46:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 16:46:57,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-07 16:46:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-11-07 16:46:57,243 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 23 [2024-11-07 16:46:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:57,243 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-07 16:46:57,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-11-07 16:46:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:46:57,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:57,246 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:57,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:46:57,246 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:57,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2024-11-07 16:46:57,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:57,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569396158] [2024-11-07 16:46:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:57,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:57,337 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:46:57,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:57,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569396158] [2024-11-07 16:46:57,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569396158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:57,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:46:57,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:46:57,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500520646] [2024-11-07 16:46:57,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:57,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:46:57,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:57,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:46:57,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:46:57,339 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:57,446 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2024-11-07 16:46:57,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:46:57,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-07 16:46:57,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:57,447 INFO L225 Difference]: With dead ends: 72 [2024-11-07 16:46:57,447 INFO L226 Difference]: Without dead ends: 72 [2024-11-07 16:46:57,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:46:57,448 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:57,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 174 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:46:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-07 16:46:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-07 16:46:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-11-07 16:46:57,452 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 25 [2024-11-07 16:46:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:57,452 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-11-07 16:46:57,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-11-07 16:46:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:46:57,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:57,453 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:57,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:46:57,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:57,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2024-11-07 16:46:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:57,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928125047] [2024-11-07 16:46:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:57,514 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:46:57,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:57,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928125047] [2024-11-07 16:46:57,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928125047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:57,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:46:57,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:46:57,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252173656] [2024-11-07 16:46:57,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:57,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:46:57,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:57,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:46:57,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:46:57,517 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:57,530 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-11-07 16:46:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:46:57,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-07 16:46:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:57,532 INFO L225 Difference]: With dead ends: 95 [2024-11-07 16:46:57,532 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 16:46:57,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:46:57,532 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 76 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:57,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 109 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:46:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 16:46:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2024-11-07 16:46:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2024-11-07 16:46:57,534 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 25 [2024-11-07 16:46:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:57,535 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-11-07 16:46:57,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2024-11-07 16:46:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:46:57,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:57,535 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:46:57,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 16:46:57,536 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:57,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:57,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551634, now seen corresponding path program 1 times [2024-11-07 16:46:57,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:57,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779744089] [2024-11-07 16:46:57,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:46:57,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:57,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779744089] [2024-11-07 16:46:57,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779744089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:46:57,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:46:57,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:46:57,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496808080] [2024-11-07 16:46:57,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:46:57,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:46:57,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:46:57,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:46:57,741 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:57,850 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-07 16:46:57,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:46:57,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-07 16:46:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:57,851 INFO L225 Difference]: With dead ends: 73 [2024-11-07 16:46:57,851 INFO L226 Difference]: Without dead ends: 73 [2024-11-07 16:46:57,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:46:57,852 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:57,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 198 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:46:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-07 16:46:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-07 16:46:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-07 16:46:57,854 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 30 [2024-11-07 16:46:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:57,854 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-07 16:46:57,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-07 16:46:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:46:57,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:57,855 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] [2024-11-07 16:46:57,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:46:57,855 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:57,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash -669697558, now seen corresponding path program 1 times [2024-11-07 16:46:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485278970] [2024-11-07 16:46:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:46:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485278970] [2024-11-07 16:46:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485278970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322270649] [2024-11-07 16:46:57,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:57,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:57,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:57,950 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:46:57,951 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:46:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:58,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:46:58,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:46:58,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:46:58,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322270649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:46:58,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:46:58,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-07 16:46:58,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125859020] [2024-11-07 16:46:58,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:46:58,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:46:58,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:46:58,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:46:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:46:58,117 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:46:58,197 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2024-11-07 16:46:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:46:58,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-07 16:46:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:46:58,198 INFO L225 Difference]: With dead ends: 94 [2024-11-07 16:46:58,198 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 16:46:58,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:46:58,198 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 105 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:46:58,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 204 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:46:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 16:46:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 70. [2024-11-07 16:46:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-11-07 16:46:58,200 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 31 [2024-11-07 16:46:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:46:58,201 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-11-07 16:46:58,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:46:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-11-07 16:46:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:46:58,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:46:58,201 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] [2024-11-07 16:46:58,215 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:46:58,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 16:46:58,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:46:58,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:46:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash -669697613, now seen corresponding path program 1 times [2024-11-07 16:46:58,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:46:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968386195] [2024-11-07 16:46:58,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:58,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:46:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:46:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:46:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968386195] [2024-11-07 16:46:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968386195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:46:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468569229] [2024-11-07 16:46:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:46:58,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:46:58,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:46:58,879 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:46:58,881 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:46:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:46:58,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 16:46:59,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:46:59,003 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:59,029 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:46:59,029 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:59,048 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 13 treesize of output 9 [2024-11-07 16:46:59,070 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 22 [2024-11-07 16:46:59,116 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:46:59,117 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 51 treesize of output 48 [2024-11-07 16:46:59,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:59,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:46:59,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:59,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 31 [2024-11-07 16:46:59,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:46:59,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2024-11-07 16:46:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:46:59,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:46:59,376 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_838 (Array Int Int))) (or (not (= v_ArrVal_838 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_838 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_838) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1))) is different from false [2024-11-07 16:46:59,484 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-07 16:46:59,484 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 21 treesize of output 20 [2024-11-07 16:47:00,139 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_837) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-11-07 16:47:00,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:00,147 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 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-07 16:47:00,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:00,151 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 46 treesize of output 28 [2024-11-07 16:47:00,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-07 16:47:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-07 16:47:00,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468569229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:00,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:00,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2024-11-07 16:47:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115515558] [2024-11-07 16:47:00,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:00,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-07 16:47:00,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:00,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-07 16:47:00,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=890, Unknown=14, NotChecked=122, Total=1122 [2024-11-07 16:47:00,225 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:00,912 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2024-11-07 16:47:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 16:47:00,912 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-07 16:47:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:00,913 INFO L225 Difference]: With dead ends: 109 [2024-11-07 16:47:00,913 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 16:47:00,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=256, Invalid=1717, Unknown=15, NotChecked=174, Total=2162 [2024-11-07 16:47:00,914 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 71 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:00,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 772 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 765 Invalid, 0 Unknown, 137 Unchecked, 0.4s Time] [2024-11-07 16:47:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 16:47:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2024-11-07 16:47:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-11-07 16:47:00,916 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 31 [2024-11-07 16:47:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:00,916 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-11-07 16:47:00,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-11-07 16:47:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:47:00,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:00,917 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] [2024-11-07 16:47:00,930 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:47:01,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:01,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:01,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -669697612, now seen corresponding path program 1 times [2024-11-07 16:47:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:01,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70732289] [2024-11-07 16:47:01,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:47:01,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:01,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70732289] [2024-11-07 16:47:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70732289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:01,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260303458] [2024-11-07 16:47:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:01,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:01,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:01,708 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:47:01,709 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:47:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:01,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-07 16:47:01,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:01,830 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:47:01,889 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:47:01,889 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:47:01,914 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 13 treesize of output 9 [2024-11-07 16:47:01,917 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 13 treesize of output 9 [2024-11-07 16:47:01,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 23 treesize of output 22 [2024-11-07 16:47:01,949 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 29 treesize of output 13 [2024-11-07 16:47:02,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:47:02,008 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 79 treesize of output 72 [2024-11-07 16:47:02,012 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 49 treesize of output 30 [2024-11-07 16:47:02,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:02,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:02,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2024-11-07 16:47:02,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:02,206 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 44 treesize of output 26 [2024-11-07 16:47:02,269 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 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-07 16:47:02,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2024-11-07 16:47:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:47:02,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:02,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_952 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)) (not (= v_ArrVal_952 (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_952 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_951 (Array Int Int))) (or (not (= v_ArrVal_951 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_951 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_952 (Array Int Int))) (or (< (+ 3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_951) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (not (= v_ArrVal_952 (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_952 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))))))) is different from false [2024-11-07 16:47:02,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:02,689 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 46 treesize of output 50 [2024-11-07 16:47:02,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_950 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_949 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) is different from false [2024-11-07 16:47:02,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_946 Int) (v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_946)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_946 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_946)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (forall ((v_ArrVal_950 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2024-11-07 16:47:02,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:02,738 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 2 case distinctions, treesize of input 29 treesize of output 35 [2024-11-07 16:47:02,741 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 40 treesize of output 28 [2024-11-07 16:47:02,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-07 16:47:02,747 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-07 16:47:02,747 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2024-11-07 16:47:02,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:02,753 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-07 16:47:02,761 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:02,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2024-11-07 16:47:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-07 16:47:02,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260303458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:02,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:02,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2024-11-07 16:47:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582806957] [2024-11-07 16:47:02,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:02,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-07 16:47:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:02,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-07 16:47:02,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1231, Unknown=3, NotChecked=216, Total=1560 [2024-11-07 16:47:02,885 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:03,890 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-11-07 16:47:03,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 16:47:03,890 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-07 16:47:03,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:03,891 INFO L225 Difference]: With dead ends: 84 [2024-11-07 16:47:03,891 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 16:47:03,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=278, Invalid=2181, Unknown=3, NotChecked=294, Total=2756 [2024-11-07 16:47:03,892 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 78 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:03,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 701 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 704 Invalid, 0 Unknown, 174 Unchecked, 0.4s Time] [2024-11-07 16:47:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 16:47:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2024-11-07 16:47:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 76 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2024-11-07 16:47:03,894 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2024-11-07 16:47:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:03,894 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2024-11-07 16:47:03,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2024-11-07 16:47:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:47:03,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:03,895 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:47:03,910 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:47:04,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 16:47:04,096 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:04,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:04,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1015753968, now seen corresponding path program 1 times [2024-11-07 16:47:04,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:04,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18178158] [2024-11-07 16:47:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:04,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:47:04,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:04,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18178158] [2024-11-07 16:47:04,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18178158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:47:04,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:47:04,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:47:04,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480839853] [2024-11-07 16:47:04,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:47:04,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:47:04,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:04,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:47:04,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:47:04,149 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:04,166 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-11-07 16:47:04,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:47:04,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-07 16:47:04,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:04,167 INFO L225 Difference]: With dead ends: 90 [2024-11-07 16:47:04,167 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 16:47:04,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:47:04,167 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 14 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:04,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 155 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:47:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 16:47:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-11-07 16:47:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.303030303030303) internal successors, (86), 77 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2024-11-07 16:47:04,170 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 33 [2024-11-07 16:47:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:04,170 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2024-11-07 16:47:04,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2024-11-07 16:47:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 16:47:04,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:04,171 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:47:04,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:47:04,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:04,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:04,174 INFO L85 PathProgramCache]: Analyzing trace with hash 928411696, now seen corresponding path program 1 times [2024-11-07 16:47:04,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:04,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585033160] [2024-11-07 16:47:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:47:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585033160] [2024-11-07 16:47:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585033160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505355130] [2024-11-07 16:47:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:04,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:04,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:04,274 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:47:04,275 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:47:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:04,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:47:04,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:04,426 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:47:04,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:04,459 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:47:04,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505355130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:04,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:04,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-07 16:47:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575423861] [2024-11-07 16:47:04,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:04,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:47:04,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:47:04,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:47:04,461 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:04,497 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2024-11-07 16:47:04,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:47:04,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-07 16:47:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:04,498 INFO L225 Difference]: With dead ends: 121 [2024-11-07 16:47:04,498 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 16:47:04,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:47:04,498 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 107 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:04,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 235 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:47:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 16:47:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2024-11-07 16:47:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-11-07 16:47:04,500 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 36 [2024-11-07 16:47:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:04,500 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-11-07 16:47:04,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-07 16:47:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 16:47:04,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:04,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:47:04,514 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:47:04,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:04,706 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:04,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1013618123, now seen corresponding path program 2 times [2024-11-07 16:47:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944640066] [2024-11-07 16:47:04,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:47:04,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:04,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944640066] [2024-11-07 16:47:04,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944640066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:04,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27710073] [2024-11-07 16:47:04,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:47:04,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:04,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:04,802 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:47:04,804 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:47:04,923 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:47:04,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:47:04,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:47:04,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:47:04,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:47:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27710073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:47:04,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:47:04,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-11-07 16:47:04,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527253081] [2024-11-07 16:47:04,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:47:04,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:47:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:04,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:47:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:47:04,990 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:05,007 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2024-11-07 16:47:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:47:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 16:47:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:05,008 INFO L225 Difference]: With dead ends: 86 [2024-11-07 16:47:05,008 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 16:47:05,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:47:05,009 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:05,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 141 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:47:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 16:47:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2024-11-07 16:47:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-07 16:47:05,011 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2024-11-07 16:47:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:05,011 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-07 16:47:05,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-07 16:47:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 16:47:05,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:05,011 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 16:47:05,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-07 16:47:05,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:05,212 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:05,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:05,213 INFO L85 PathProgramCache]: Analyzing trace with hash 294244708, now seen corresponding path program 2 times [2024-11-07 16:47:05,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:05,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808150128] [2024-11-07 16:47:05,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:47:05,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:05,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808150128] [2024-11-07 16:47:05,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808150128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:05,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433172663] [2024-11-07 16:47:05,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:47:05,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:05,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:05,311 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:47:05,312 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:47:05,457 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:47:05,458 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:47:05,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:47:05,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:47:05,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:47:05,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433172663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:05,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-11-07 16:47:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405177975] [2024-11-07 16:47:05,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:05,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:47:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:47:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:47:05,506 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:05,578 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-07 16:47:05,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:47:05,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-07 16:47:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:05,582 INFO L225 Difference]: With dead ends: 82 [2024-11-07 16:47:05,582 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 16:47:05,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:47:05,582 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 127 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:05,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 327 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:47:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 16:47:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-07 16:47:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-07 16:47:05,584 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 41 [2024-11-07 16:47:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:05,584 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-07 16:47:05,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-07 16:47:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 16:47:05,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:05,585 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 16:47:05,599 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:47:05,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-07 16:47:05,791 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:05,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1726931736, now seen corresponding path program 1 times [2024-11-07 16:47:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098934209] [2024-11-07 16:47:05,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:47:06,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098934209] [2024-11-07 16:47:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098934209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283712089] [2024-11-07 16:47:06,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:06,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:06,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:06,468 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:47:06,469 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:47:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:06,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-07 16:47:06,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:06,622 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:47:06,672 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:47:06,673 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:47:06,698 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 13 treesize of output 9 [2024-11-07 16:47:06,724 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 22 [2024-11-07 16:47:06,761 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:47:06,761 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 40 treesize of output 39 [2024-11-07 16:47:06,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:06,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-07 16:47:06,931 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:47:07,027 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 0 case distinctions, treesize of input 29 treesize of output 11 [2024-11-07 16:47:07,093 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:47:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:47:07,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:07,347 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1464 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1464) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-07 16:47:07,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:07,420 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:47:07,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:07,425 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 48 treesize of output 51 [2024-11-07 16:47:07,430 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 18 treesize of output 16 [2024-11-07 16:47:07,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1460) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2024-11-07 16:47:07,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:07,638 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 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-07 16:47:07,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:07,642 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 49 treesize of output 31 [2024-11-07 16:47:07,648 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 8 treesize of output 4 [2024-11-07 16:47:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-07 16:47:07,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283712089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:07,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:07,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 59 [2024-11-07 16:47:07,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417635095] [2024-11-07 16:47:07,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:07,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-07 16:47:07,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:07,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-07 16:47:07,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2921, Unknown=68, NotChecked=222, Total=3422 [2024-11-07 16:47:07,722 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 59 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:08,669 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-07 16:47:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 16:47:08,670 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 59 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-07 16:47:08,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:08,670 INFO L225 Difference]: With dead ends: 84 [2024-11-07 16:47:08,670 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 16:47:08,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=534, Invalid=5412, Unknown=68, NotChecked=306, Total=6320 [2024-11-07 16:47:08,672 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 135 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:08,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 991 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1123 Invalid, 0 Unknown, 133 Unchecked, 0.4s Time] [2024-11-07 16:47:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 16:47:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-07 16:47:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.208955223880597) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-07 16:47:08,674 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 44 [2024-11-07 16:47:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:08,675 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-07 16:47:08,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 59 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-07 16:47:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 16:47:08,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:08,676 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] [2024-11-07 16:47:08,689 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:47:08,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:08,876 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:08,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash 594303695, now seen corresponding path program 1 times [2024-11-07 16:47:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:08,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370542819] [2024-11-07 16:47:08,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:47:09,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:09,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370542819] [2024-11-07 16:47:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370542819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:09,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380011008] [2024-11-07 16:47:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:09,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:09,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:09,838 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:47:09,839 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:47:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:09,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-07 16:47:09,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:09,977 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:47:10,019 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:47:10,019 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:47:10,040 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 13 treesize of output 9 [2024-11-07 16:47:10,065 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 22 [2024-11-07 16:47:10,098 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:47:10,098 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 51 treesize of output 48 [2024-11-07 16:47:10,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:10,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:10,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:10,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 31 [2024-11-07 16:47:10,395 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:47:10,395 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 51 treesize of output 48 [2024-11-07 16:47:10,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:10,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2024-11-07 16:47:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:47:10,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:10,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1586) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2024-11-07 16:47:10,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1586) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2024-11-07 16:47:10,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1585 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1585 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1585)) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1585))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1586)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1))) is different from false [2024-11-07 16:47:10,660 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1585 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= v_ArrVal_1585 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1585 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1585) (select v_ArrVal_1585 .cse0) v_ArrVal_1586) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2024-11-07 16:47:10,669 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1585 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1585 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)) v_ArrVal_1585)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1585) (select v_ArrVal_1585 .cse0) v_ArrVal_1586) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0))) 1))) is different from false [2024-11-07 16:47:10,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1585 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= v_ArrVal_1585 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1585 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1585) (select v_ArrVal_1585 .cse0) v_ArrVal_1586) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0))) 1))) is different from false [2024-11-07 16:47:10,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1585 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= v_ArrVal_1585 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1585 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1585) (select v_ArrVal_1585 .cse0) v_ArrVal_1586) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) 1) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2024-11-07 16:47:10,708 INFO L349 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2024-11-07 16:47:10,708 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 31 treesize of output 30 [2024-11-07 16:47:10,718 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1584 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1584))) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1585) (select v_ArrVal_1585 .cse1) v_ArrVal_1586) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1585 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)) v_ArrVal_1585))))) is different from false [2024-11-07 16:47:10,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1584 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1584) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1585 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)) v_ArrVal_1585)) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1584) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1585) (select v_ArrVal_1585 .cse0) v_ArrVal_1586) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2024-11-07 16:47:10,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:10,746 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 66 [2024-11-07 16:47:10,751 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 51 treesize of output 45 [2024-11-07 16:47:10,757 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 16:47:10,757 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2024-11-07 16:47:10,761 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:10,762 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:10,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:10,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 51 [2024-11-07 16:47:10,774 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 15 treesize of output 11 [2024-11-07 16:47:10,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:10,785 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 36 treesize of output 22 [2024-11-07 16:47:10,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:10,789 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 17 treesize of output 9 [2024-11-07 16:47:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2024-11-07 16:47:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380011008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:10,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 19] total 54 [2024-11-07 16:47:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955158568] [2024-11-07 16:47:10,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:10,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-07 16:47:10,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:10,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-07 16:47:10,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1904, Unknown=52, NotChecked=864, Total=2970 [2024-11-07 16:47:10,858 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 55 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 55 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:12,070 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2024-11-07 16:47:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:47:12,071 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 55 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-07 16:47:12,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:12,071 INFO L225 Difference]: With dead ends: 88 [2024-11-07 16:47:12,071 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 16:47:12,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=430, Invalid=3711, Unknown=55, NotChecked=1206, Total=5402 [2024-11-07 16:47:12,072 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 228 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:12,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 918 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1350 Invalid, 0 Unknown, 674 Unchecked, 0.5s Time] [2024-11-07 16:47:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 16:47:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2024-11-07 16:47:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-07 16:47:12,074 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 48 [2024-11-07 16:47:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:12,074 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-07 16:47:12,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 55 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-07 16:47:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 16:47:12,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:12,075 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] [2024-11-07 16:47:12,088 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:47:12,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:12,276 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:12,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash 594303696, now seen corresponding path program 1 times [2024-11-07 16:47:12,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:12,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546206759] [2024-11-07 16:47:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:47:13,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:13,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546206759] [2024-11-07 16:47:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546206759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:13,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063816073] [2024-11-07 16:47:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:13,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:13,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:13,127 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:47:13,128 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:47:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:13,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-07 16:47:13,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:13,282 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:47:13,286 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:47:13,353 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:47:13,353 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:47:13,357 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:47:13,395 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:47:13,401 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:47:13,437 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 23 treesize of output 11 [2024-11-07 16:47:13,442 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 19 treesize of output 18 [2024-11-07 16:47:13,488 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-07 16:47:13,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 49 [2024-11-07 16:47:13,492 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:47:13,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:13,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:13,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2024-11-07 16:47:13,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:13,660 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:47:13,833 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:47:13,834 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:47:13,839 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:47:13,962 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 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-07 16:47:13,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-07 16:47:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:47:13,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:14,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1715 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1715))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1715 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1715)) (forall ((v_ArrVal_1714 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1714 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1714)) (forall ((v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1714))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))) (<= (+ 4 (select (select (store .cse2 .cse3 v_ArrVal_1717) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1716) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4)))))))) (< (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) 0)))) (forall ((v_ArrVal_1715 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1715))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1715 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1715)) (forall ((v_ArrVal_1714 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1714 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1714)) (forall ((v_ArrVal_1717 (Array Int Int))) (<= 0 (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) v_ArrVal_1717) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))))) (< (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) 0)))))) is different from false [2024-11-07 16:47:14,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1715 (Array Int Int))) (or (not (= v_ArrVal_1715 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1715 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))) (< (select v_ArrVal_1715 .cse1) 0) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1715) (select .cse2 .cse1) v_ArrVal_1717) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_1715 (Array Int Int))) (or (forall ((v_ArrVal_1714 (Array Int Int))) (or (forall ((v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (let ((.cse3 (select v_ArrVal_1714 .cse1))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1715) .cse3 v_ArrVal_1717) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1714) .cse3 v_ArrVal_1716) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) (not (= v_ArrVal_1714 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1714 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))))) (not (= v_ArrVal_1715 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1715 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))) (< (select v_ArrVal_1715 .cse1) 0))))))) is different from false [2024-11-07 16:47:14,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1715 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1715) (select .cse0 .cse1) v_ArrVal_1717) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1) 1)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (not (= (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1715 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_1715)) (< (select v_ArrVal_1715 .cse1) 0))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_1715 (Array Int Int))) (or (forall ((v_ArrVal_1714 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1714 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_1714)) (forall ((v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (let ((.cse3 (select v_ArrVal_1714 .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1715) .cse3 v_ArrVal_1717) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1714) .cse3 v_ArrVal_1716) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1))))))) (not (= (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1715 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_1715)) (< (select v_ArrVal_1715 .cse1) 0))))))) is different from false [2024-11-07 16:47:24,586 INFO L349 Elim1Store]: treesize reduction 41, result has 53.9 percent of original size [2024-11-07 16:47:24,587 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 136 [2024-11-07 16:47:24,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:24,603 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 148 [2024-11-07 16:47:24,612 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 41 treesize of output 37 [2024-11-07 16:47:24,627 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 16:47:24,628 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2024-11-07 16:47:24,635 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:24,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:24,642 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2024-11-07 16:47:24,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-11-07 16:47:24,656 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 19 treesize of output 15 [2024-11-07 16:47:24,665 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 92 treesize of output 82 [2024-11-07 16:47:24,670 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:24,673 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 73 treesize of output 53 [2024-11-07 16:47:24,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:24,699 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 32 treesize of output 22 [2024-11-07 16:47:24,716 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 8 treesize of output 4 [2024-11-07 16:47:24,720 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:24,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:24,732 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-07 16:47:24,733 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 2 case distinctions, treesize of input 39 treesize of output 1 [2024-11-07 16:47:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-07 16:47:24,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063816073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:24,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:24,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 50 [2024-11-07 16:47:24,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208598326] [2024-11-07 16:47:24,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:24,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-07 16:47:24,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:24,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-07 16:47:24,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2055, Unknown=21, NotChecked=282, Total=2550 [2024-11-07 16:47:24,923 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 51 states, 50 states have (on average 2.7) internal successors, (135), 51 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:26,551 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-07 16:47:26,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:47:26,552 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.7) internal successors, (135), 51 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-07 16:47:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:26,552 INFO L225 Difference]: With dead ends: 88 [2024-11-07 16:47:26,552 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 16:47:26,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=388, Invalid=3263, Unknown=21, NotChecked=360, Total=4032 [2024-11-07 16:47:26,553 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:26,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1169 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1256 Invalid, 0 Unknown, 206 Unchecked, 1.0s Time] [2024-11-07 16:47:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 16:47:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-11-07 16:47:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-07 16:47:26,556 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 48 [2024-11-07 16:47:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:26,556 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-07 16:47:26,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.7) internal successors, (135), 51 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-07 16:47:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 16:47:26,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:26,557 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] [2024-11-07 16:47:26,570 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:47:26,757 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,SelfDestructingSolverStorable23 [2024-11-07 16:47:26,758 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:26,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash -307265039, now seen corresponding path program 1 times [2024-11-07 16:47:26,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:26,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144491790] [2024-11-07 16:47:26,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:26,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 16:47:26,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:26,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144491790] [2024-11-07 16:47:26,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144491790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:26,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284353923] [2024-11-07 16:47:26,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:26,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:26,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:26,824 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:47:26,826 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:47:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:26,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:47:26,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 16:47:26,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 16:47:27,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284353923] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:27,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:27,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-07 16:47:27,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644165380] [2024-11-07 16:47:27,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:27,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:47:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:47:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:47:27,023 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:27,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:27,063 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-07 16:47:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:47:27,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-07 16:47:27,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:27,065 INFO L225 Difference]: With dead ends: 81 [2024-11-07 16:47:27,065 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 16:47:27,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:47:27,066 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 52 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:27,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 191 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:47:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 16:47:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 16:47:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-07 16:47:27,067 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 51 [2024-11-07 16:47:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:27,067 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-07 16:47:27,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-07 16:47:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 16:47:27,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:27,067 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] [2024-11-07 16:47:27,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-07 16:47:27,268 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,SelfDestructingSolverStorable24 [2024-11-07 16:47:27,268 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:27,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1047895438, now seen corresponding path program 2 times [2024-11-07 16:47:27,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:27,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397601289] [2024-11-07 16:47:27,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:27,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 16:47:27,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:27,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397601289] [2024-11-07 16:47:27,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397601289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:27,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236968206] [2024-11-07 16:47:27,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:47:27,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:27,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:27,345 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:47:27,346 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:47:27,505 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:47:27,506 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:47:27,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:47:27,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 16:47:27,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 16:47:27,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236968206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:27,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:27,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-07 16:47:27,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014133448] [2024-11-07 16:47:27,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:27,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:47:27,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:27,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:47:27,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:47:27,631 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:27,690 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2024-11-07 16:47:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:47:27,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-07 16:47:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:27,691 INFO L225 Difference]: With dead ends: 72 [2024-11-07 16:47:27,691 INFO L226 Difference]: Without dead ends: 72 [2024-11-07 16:47:27,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:47:27,692 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:27,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 190 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:47:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-07 16:47:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-07 16:47:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.123076923076923) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-11-07 16:47:27,693 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 51 [2024-11-07 16:47:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:27,693 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-07 16:47:27,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:27,693 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2024-11-07 16:47:27,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 16:47:27,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:27,694 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] [2024-11-07 16:47:27,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-07 16:47:27,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:27,898 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:27,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:27,898 INFO L85 PathProgramCache]: Analyzing trace with hash 677237458, now seen corresponding path program 1 times [2024-11-07 16:47:27,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:27,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442539226] [2024-11-07 16:47:27,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:47:29,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:29,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442539226] [2024-11-07 16:47:29,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442539226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:29,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059707561] [2024-11-07 16:47:29,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:29,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:29,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:29,049 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:47:29,050 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:47:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:29,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-07 16:47:29,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:29,223 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:47:29,294 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:47:29,294 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:47:29,329 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 13 treesize of output 9 [2024-11-07 16:47:29,364 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 22 [2024-11-07 16:47:29,419 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:47:29,419 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 40 treesize of output 39 [2024-11-07 16:47:29,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:29,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:29,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:29,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-07 16:47:29,938 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:47:29,938 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 89 treesize of output 80 [2024-11-07 16:47:29,942 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 29 treesize of output 19 [2024-11-07 16:47:29,946 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 40 treesize of output 23 [2024-11-07 16:47:30,276 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 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-07 16:47:30,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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:47:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:47:30,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:30,766 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 86 treesize of output 64 [2024-11-07 16:47:30,904 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2074) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_2076 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2076) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2024-11-07 16:47:30,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:30,916 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 50 treesize of output 43 [2024-11-07 16:47:30,919 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 13 [2024-11-07 16:47:31,078 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2072 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2072) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2072 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2072)))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2024-11-07 16:47:31,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:31,499 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 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-07 16:47:31,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:31,508 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 49 treesize of output 31 [2024-11-07 16:47:31,516 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 8 treesize of output 4 [2024-11-07 16:47:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-07 16:47:31,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059707561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:31,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:31,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 25] total 73 [2024-11-07 16:47:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690417528] [2024-11-07 16:47:31,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:31,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-11-07 16:47:31,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:31,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-07 16:47:31,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=4702, Unknown=49, NotChecked=278, Total=5256 [2024-11-07 16:47:31,696 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 73 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 73 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:33,872 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2024-11-07 16:47:33,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-07 16:47:33,873 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 73 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 16:47:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:33,873 INFO L225 Difference]: With dead ends: 74 [2024-11-07 16:47:33,873 INFO L226 Difference]: Without dead ends: 74 [2024-11-07 16:47:33,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=611, Invalid=8853, Unknown=50, NotChecked=386, Total=9900 [2024-11-07 16:47:33,875 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 109 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:33,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1351 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2131 Invalid, 0 Unknown, 119 Unchecked, 1.0s Time] [2024-11-07 16:47:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-07 16:47:33,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-07 16:47:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2024-11-07 16:47:33,877 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 54 [2024-11-07 16:47:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:33,877 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2024-11-07 16:47:33,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 73 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2024-11-07 16:47:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 16:47:33,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:33,877 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-07 16:47:33,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-07 16:47:34,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:34,078 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:34,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:34,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317609, now seen corresponding path program 1 times [2024-11-07 16:47:34,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:34,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532750997] [2024-11-07 16:47:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:34,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-07 16:47:34,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:34,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532750997] [2024-11-07 16:47:34,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532750997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:47:34,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:47:34,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:47:34,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303928982] [2024-11-07 16:47:34,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:47:34,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:47:34,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:34,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:47:34,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:47:34,154 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:34,261 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-07 16:47:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:47:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 16:47:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:34,262 INFO L225 Difference]: With dead ends: 69 [2024-11-07 16:47:34,262 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 16:47:34,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:47:34,262 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:34,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:47:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 16:47:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-07 16:47:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.125) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-07 16:47:34,264 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 56 [2024-11-07 16:47:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:34,264 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-07 16:47:34,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-07 16:47:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 16:47:34,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:34,264 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-07 16:47:34,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 16:47:34,265 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:34,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:34,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317608, now seen corresponding path program 1 times [2024-11-07 16:47:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512197666] [2024-11-07 16:47:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:47:34,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512197666] [2024-11-07 16:47:34,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512197666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:47:34,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:47:34,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:47:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64278531] [2024-11-07 16:47:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:47:34,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:47:34,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:34,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:47:34,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:47:34,398 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:34,524 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2024-11-07 16:47:34,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:47:34,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 16:47:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:34,525 INFO L225 Difference]: With dead ends: 71 [2024-11-07 16:47:34,525 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 16:47:34,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:47:34,526 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:34,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 131 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:47:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 16:47:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-07 16:47:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.106060606060606) internal successors, (73), 70 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2024-11-07 16:47:34,527 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 56 [2024-11-07 16:47:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:34,527 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2024-11-07 16:47:34,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2024-11-07 16:47:34,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 16:47:34,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:34,528 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-07 16:47:34,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 16:47:34,528 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:34,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:34,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1291305125, now seen corresponding path program 1 times [2024-11-07 16:47:34,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:34,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102621898] [2024-11-07 16:47:34,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:34,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:47:34,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:34,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102621898] [2024-11-07 16:47:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102621898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:47:34,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:47:34,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:47:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641814073] [2024-11-07 16:47:34,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:47:34,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:47:34,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:34,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:47:34,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:47:34,595 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:34,672 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-11-07 16:47:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:47:34,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-07 16:47:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:34,673 INFO L225 Difference]: With dead ends: 73 [2024-11-07 16:47:34,673 INFO L226 Difference]: Without dead ends: 73 [2024-11-07 16:47:34,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:47:34,673 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:34,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 165 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:47:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-07 16:47:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-07 16:47:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2024-11-07 16:47:34,675 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 57 [2024-11-07 16:47:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:34,675 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2024-11-07 16:47:34,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2024-11-07 16:47:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 16:47:34,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:34,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-07 16:47:34,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 16:47:34,675 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:34,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:34,675 INFO L85 PathProgramCache]: Analyzing trace with hash 302765524, now seen corresponding path program 1 times [2024-11-07 16:47:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:34,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893820859] [2024-11-07 16:47:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:47:34,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:34,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893820859] [2024-11-07 16:47:34,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893820859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:47:34,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:47:34,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:47:34,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801993720] [2024-11-07 16:47:34,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:47:34,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:47:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:34,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:47:34,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:47:34,755 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:34,850 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2024-11-07 16:47:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:47:34,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-07 16:47:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:34,851 INFO L225 Difference]: With dead ends: 72 [2024-11-07 16:47:34,851 INFO L226 Difference]: Without dead ends: 72 [2024-11-07 16:47:34,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:47:34,851 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:34,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 153 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:47:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-07 16:47:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-07 16:47:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-11-07 16:47:34,853 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 59 [2024-11-07 16:47:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:34,853 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-07 16:47:34,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2024-11-07 16:47:34,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 16:47:34,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:34,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2024-11-07 16:47:34,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 16:47:34,853 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:34,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash 256575356, now seen corresponding path program 1 times [2024-11-07 16:47:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:34,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699125891] [2024-11-07 16:47:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:34,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 16:47:35,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:35,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699125891] [2024-11-07 16:47:35,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699125891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:35,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270422826] [2024-11-07 16:47:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:35,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:35,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:35,628 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:47:35,629 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:47:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:35,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-07 16:47:35,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:35,812 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:47:35,840 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:47:35,840 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:47:35,867 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:47:35,893 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 19 treesize of output 18 [2024-11-07 16:47:35,934 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:47:35,935 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 41 treesize of output 38 [2024-11-07 16:47:36,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:36,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:36,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:36,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-07 16:47:36,219 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:47:36,219 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 41 treesize of output 38 [2024-11-07 16:47:36,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:36,369 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 34 treesize of output 32 [2024-11-07 16:47:36,512 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:47:36,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-07 16:47:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:47:36,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:36,714 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2432 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2432) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2024-11-07 16:47:36,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2432 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2432) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2024-11-07 16:47:36,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2431))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2432)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2431 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2431)))) is different from false [2024-11-07 16:47:36,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2431 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2431)) (= 1 (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2431) (select v_ArrVal_2431 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2432) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2024-11-07 16:47:36,881 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2431) (select v_ArrVal_2431 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2432) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 1) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (not (= v_ArrVal_2431 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2431 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))))) is different from false [2024-11-07 16:47:36,894 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2431 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2431)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2431) (select v_ArrVal_2431 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2432) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1))) is different from false [2024-11-07 16:47:36,935 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2431) (select v_ArrVal_2431 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2432) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2431 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2431)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) is different from false [2024-11-07 16:47:36,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:36,948 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 51 treesize of output 55 [2024-11-07 16:47:36,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2430))) (or (forall ((v_ArrVal_2432 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2431) (select v_ArrVal_2431 .cse1) v_ArrVal_2432) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2431 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2431))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2430))) (or (not (= (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2431 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)) v_ArrVal_2431)) (forall ((v_ArrVal_2432 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2431) (select v_ArrVal_2431 .cse1) v_ArrVal_2432) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))))) is different from false [2024-11-07 16:47:37,047 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (forall ((v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (or (not (= v_ArrVal_2431 (store (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2431 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (forall ((v_ArrVal_2432 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2431) (select v_ArrVal_2431 .cse1) v_ArrVal_2432) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (or (forall ((v_ArrVal_2432 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2431) (select v_ArrVal_2431 .cse1) v_ArrVal_2432) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= v_ArrVal_2431 (store (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2431 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))))) is different from false [2024-11-07 16:47:37,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:37,063 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2024-11-07 16:47:37,068 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 51 treesize of output 45 [2024-11-07 16:47:37,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:37,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:37,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:37,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 56 [2024-11-07 16:47:37,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:37,089 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2024-11-07 16:47:37,094 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 13 treesize of output 11 [2024-11-07 16:47:37,108 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 8 treesize of output 6 [2024-11-07 16:47:37,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:37,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2024-11-07 16:47:37,144 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:47:37,149 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-07 16:47:37,149 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 2 case distinctions, treesize of input 60 treesize of output 1 [2024-11-07 16:47:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2024-11-07 16:47:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270422826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:47:37,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:47:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 53 [2024-11-07 16:47:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020325357] [2024-11-07 16:47:37,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:47:37,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-07 16:47:37,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:47:37,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-07 16:47:37,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1801, Unknown=41, NotChecked=846, Total=2862 [2024-11-07 16:47:37,252 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 54 states, 53 states have (on average 2.8679245283018866) internal successors, (152), 54 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:47:38,427 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-07 16:47:38,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:47:38,428 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.8679245283018866) internal successors, (152), 54 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-07 16:47:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:47:38,428 INFO L225 Difference]: With dead ends: 81 [2024-11-07 16:47:38,428 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 16:47:38,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=364, Invalid=3286, Unknown=46, NotChecked=1134, Total=4830 [2024-11-07 16:47:38,430 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 625 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:47:38,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 484 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 961 Invalid, 0 Unknown, 625 Unchecked, 0.4s Time] [2024-11-07 16:47:38,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 16:47:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2024-11-07 16:47:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-07 16:47:38,434 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2024-11-07 16:47:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:47:38,434 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-07 16:47:38,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.8679245283018866) internal successors, (152), 54 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:47:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-07 16:47:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 16:47:38,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:47:38,434 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2024-11-07 16:47:38,462 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:47:38,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:38,635 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:47:38,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:47:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash 256575357, now seen corresponding path program 1 times [2024-11-07 16:47:38,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:47:38,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356894919] [2024-11-07 16:47:38,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:38,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:47:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:47:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:47:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356894919] [2024-11-07 16:47:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356894919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:47:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309397112] [2024-11-07 16:47:39,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:47:39,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:47:39,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:47:39,688 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:47:39,689 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:47:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:47:39,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-07 16:47:39,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:47:39,879 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:47:39,943 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:47:39,943 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:47:39,981 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:47:39,985 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:47:40,024 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 19 treesize of output 18 [2024-11-07 16:47:40,029 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 23 treesize of output 11 [2024-11-07 16:47:40,079 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:47:40,079 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 63 treesize of output 56 [2024-11-07 16:47:40,084 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 32 treesize of output 19 [2024-11-07 16:47:40,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:40,298 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 31 treesize of output 19 [2024-11-07 16:47:40,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:40,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:47:40,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:40,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 33 [2024-11-07 16:47:40,540 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:47:40,540 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 63 treesize of output 56 [2024-11-07 16:47:40,544 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 39 treesize of output 24 [2024-11-07 16:47:40,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:40,792 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 32 treesize of output 26 [2024-11-07 16:47:40,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:47:40,802 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 36 treesize of output 34 [2024-11-07 16:47:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:47:40,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:47:41,653 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2560 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2560 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2560)) (forall ((v_ArrVal_2561 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2561))) (or (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2560))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))) (<= (+ (select (select (store .cse1 .cse2 v_ArrVal_2563) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2562) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (< (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) 0) (not (= (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2561 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2561))))))) (forall ((v_ArrVal_2560 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2560 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2560)) (forall ((v_ArrVal_2561 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2561))) (or (< (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) 0) (not (= (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2561 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2561)) (forall ((v_ArrVal_2563 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2560) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) v_ArrVal_2563) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))))))))) is different from false [2024-11-07 16:47:41,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (forall ((v_ArrVal_2560 (Array Int Int))) (or (forall ((v_ArrVal_2561 (Array Int Int))) (or (< (select v_ArrVal_2561 .cse0) 0) (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (let ((.cse1 (select v_ArrVal_2560 .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2561) .cse1 v_ArrVal_2563) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2560) .cse1 v_ArrVal_2562) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (not (= v_ArrVal_2561 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2561 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)))))) (not (= (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2560 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)) v_ArrVal_2560)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int) (v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2561 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (< (select v_ArrVal_2561 .cse0) 0) (not (= v_ArrVal_2561 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2561 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2561) (select .cse3 .cse0) v_ArrVal_2563) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 5)))))) is different from false [2024-11-07 16:47:41,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (forall ((v_ArrVal_2560 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2560 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)) v_ArrVal_2560)) (forall ((v_ArrVal_2561 (Array Int Int))) (or (< (select v_ArrVal_2561 .cse1) 0) (not (= (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2561 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)) v_ArrVal_2561)) (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2560 .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2561) .cse3 v_ArrVal_2563) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2560) .cse3 v_ArrVal_2562) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))))))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int) (v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2561 (Array Int Int))) (or (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2561) (select .cse0 .cse1) v_ArrVal_2563) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (< (select v_ArrVal_2561 .cse1) 0) (not (= (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2561 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)) v_ArrVal_2561)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|))))) is different from false [2024-11-07 16:48:18,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:18,602 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 141 treesize of output 145 [2024-11-07 16:48:18,836 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_2559 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int) (v_ArrVal_2562 (Array Int Int)) (v_ArrVal_2560 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2558))) (or (not (= v_ArrVal_2560 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2560 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (= (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2560) (select v_ArrVal_2560 .cse0) v_ArrVal_2562) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_15))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_17) (not (= (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_17 (select v_prenex_19 v_prenex_17)) v_prenex_19)) (< 0 (+ 5 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_19) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_prenex_18) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (< (select v_prenex_19 .cse0) 0)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int)) (or (forall ((v_ArrVal_2561 (Array Int Int))) (or (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2563 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2559))) (or (< (select (select (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2561) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_2563) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (not (= v_ArrVal_2561 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2561 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|))))))) (< (select v_ArrVal_2561 .cse0) 0))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|))))) is different from false [2024-11-07 16:48:18,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 0))) (.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_2558 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int) (v_ArrVal_2562 (Array Int Int)) (v_ArrVal_2560 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2560) (select v_ArrVal_2560 .cse0) v_ArrVal_2562) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (store (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2560 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)) v_ArrVal_2560)))) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2556 Int)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_2556)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 0))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int) (v_ArrVal_2556 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (forall ((v_ArrVal_2561 (Array Int Int))) (or (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2563 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2561) (select (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2558) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_2563) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (not (= v_ArrVal_2561 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_2556)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2561 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)))))) (< (select v_ArrVal_2561 .cse0) 0))))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_17 Int) (v_ArrVal_2556 Int) (v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_17) (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_2556)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_17 (select v_prenex_19 v_prenex_17)) v_prenex_19)) (< (select v_prenex_19 .cse0) 0) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_19) (select (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_prenex_18) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 5))))))) is different from false [2024-11-07 16:48:18,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:18,977 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 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-07 16:48:18,982 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 20 [2024-11-07 16:48:18,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-07 16:48:19,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:19,015 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2024-11-07 16:48:19,026 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 51 treesize of output 45 [2024-11-07 16:48:19,034 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:48:19,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:48:19,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:19,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 56 [2024-11-07 16:48:19,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:19,069 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2024-11-07 16:48:19,078 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 13 treesize of output 11 [2024-11-07 16:48:19,104 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 8 treesize of output 6 [2024-11-07 16:48:19,118 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:48:19,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:19,160 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 23 treesize of output 31 [2024-11-07 16:48:19,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:19,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 35 [2024-11-07 16:48:19,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:48:19,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:19,281 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 106 [2024-11-07 16:48:19,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:19,311 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 74 [2024-11-07 16:48:19,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:48:19,320 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 0 case distinctions, treesize of input 68 treesize of output 44 [2024-11-07 16:48:19,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:48:19,328 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 41 [2024-11-07 16:48:19,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:48:19,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:48:19,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2024-11-07 16:48:19,363 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:48:19,363 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 28 [2024-11-07 16:48:19,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 11 treesize of output 9 [2024-11-07 16:48:19,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:48:19,386 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-07 16:48:19,386 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 1 [2024-11-07 16:48:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2024-11-07 16:48:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309397112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:48:19,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:48:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 21] total 60 [2024-11-07 16:48:19,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866924213] [2024-11-07 16:48:19,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:48:19,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-07 16:48:19,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:48:19,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-07 16:48:19,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2862, Unknown=47, NotChecked=560, Total=3660 [2024-11-07 16:48:19,641 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 61 states, 60 states have (on average 2.7) internal successors, (162), 61 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:48:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:48:26,578 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-07 16:48:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 16:48:26,578 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.7) internal successors, (162), 61 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-07 16:48:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:48:26,579 INFO L225 Difference]: With dead ends: 83 [2024-11-07 16:48:26,579 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 16:48:26,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=430, Invalid=5243, Unknown=47, NotChecked=760, Total=6480 [2024-11-07 16:48:26,581 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 77 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:48:26,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 760 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1535 Invalid, 0 Unknown, 336 Unchecked, 3.1s Time] [2024-11-07 16:48:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 16:48:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2024-11-07 16:48:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:48:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2024-11-07 16:48:26,582 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 62 [2024-11-07 16:48:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:48:26,582 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-11-07 16:48:26,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.7) internal successors, (162), 61 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:48:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2024-11-07 16:48:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 16:48:26,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:48:26,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-07 16:48:26,600 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:48:26,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:26,783 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-07 16:48:26,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:48:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash -636099946, now seen corresponding path program 1 times [2024-11-07 16:48:26,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:48:26,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162426185] [2024-11-07 16:48:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:26,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:48:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-07 16:48:27,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:48:27,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162426185] [2024-11-07 16:48:27,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162426185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:48:27,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444012746] [2024-11-07 16:48:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:48:27,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:48:27,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:48:27,449 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:48:27,449 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:48:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:48:27,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-07 16:48:27,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:48:27,998 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