./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_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/sll2n_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', '1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_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 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:49:09,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:49:09,456 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:49:09,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:49:09,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:49:09,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:49:09,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:49:09,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:49:09,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:49:09,477 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:49:09,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:49:09,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:49:09,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:49:09,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:49:09,478 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:49:09,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:49:09,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:49:09,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:49:09,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:49:09,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:49:09,478 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:49:09,478 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:49:09,478 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:49:09,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:49:09,479 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:49:09,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:49:09,479 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:49:09,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:49:09,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:49:09,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:49:09,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:49:09,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:49:09,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:49:09,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:49:09,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:49:09,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:49:09,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:49:09,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:49:09,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:49:09,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:49:09,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:49:09,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:49:09,480 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 -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2024-11-07 16:49:09,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:49:09,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:49:09,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:49:09,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:49:09,728 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:49:09,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all.i [2024-11-07 16:49:10,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:49:11,208 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:49:11,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2024-11-07 16:49:11,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/052c385fa/93d8121395404559a23142b787d8c024/FLAG495282f76 [2024-11-07 16:49:11,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/052c385fa/93d8121395404559a23142b787d8c024 [2024-11-07 16:49:11,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:49:11,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:49:11,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:49:11,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:49:11,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:49:11,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6089bb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11, skipping insertion in model container [2024-11-07 16:49:11,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:49:11,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:49:11,493 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:49:11,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:49:11,564 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:49:11,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11 WrapperNode [2024-11-07 16:49:11,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:49:11,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:49:11,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:49:11,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:49:11,570 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:49:11" (1/1) ... [2024-11-07 16:49:11,578 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:49:11" (1/1) ... [2024-11-07 16:49:11,599 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 127 [2024-11-07 16:49:11,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:49:11,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:49:11,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:49:11,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:49:11,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,630 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-07 16:49:11,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:49:11,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:49:11,642 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:49:11,642 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:49:11,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (1/1) ... [2024-11-07 16:49:11,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:49:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:11,663 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:49:11,666 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:49:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:49:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:49:11,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:49:11,763 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:49:11,765 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:49:11,916 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-07 16:49:11,917 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:49:11,923 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:49:11,923 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-07 16:49:11,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:49:11 BoogieIcfgContainer [2024-11-07 16:49:11,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:49:11,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:49:11,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:49:11,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:49:11,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:49:11" (1/3) ... [2024-11-07 16:49:11,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21984a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:49:11, skipping insertion in model container [2024-11-07 16:49:11,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:11" (2/3) ... [2024-11-07 16:49:11,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21984a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:49:11, skipping insertion in model container [2024-11-07 16:49:11,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:49:11" (3/3) ... [2024-11-07 16:49:11,931 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2024-11-07 16:49:11,940 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:49:11,941 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-07 16:49:11,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:49:11,971 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;@2daa936d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:49:11,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-07 16:49:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 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:49:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:49:11,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:11,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:49:11,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:11,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2024-11-07 16:49:11,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:11,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230908892] [2024-11-07 16:49:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:12,097 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:49:12,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:12,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230908892] [2024-11-07 16:49:12,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230908892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:12,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:12,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:49:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590408497] [2024-11-07 16:49:12,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:12,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:49:12,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:49:12,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:49:12,121 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 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) 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:49:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:12,171 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-07 16:49:12,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:49:12,172 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:49:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:12,176 INFO L225 Difference]: With dead ends: 64 [2024-11-07 16:49:12,176 INFO L226 Difference]: Without dead ends: 61 [2024-11-07 16:49:12,177 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:49:12,179 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:12,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-07 16:49:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-07 16:49:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 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:49:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-07 16:49:12,197 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 5 [2024-11-07 16:49:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:12,198 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-07 16:49:12,198 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:49:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-07 16:49:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:49:12,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:12,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:49:12,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:49:12,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:12,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:12,199 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2024-11-07 16:49:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:12,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589151642] [2024-11-07 16:49:12,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:12,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:12,286 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:49:12,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:12,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589151642] [2024-11-07 16:49:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589151642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:12,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:12,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:49:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549236552] [2024-11-07 16:49:12,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:12,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:49:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:49:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:49:12,288 INFO L87 Difference]: Start difference. First operand 61 states and 66 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:49:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:12,334 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-07 16:49:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:49:12,338 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:49:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:12,339 INFO L225 Difference]: With dead ends: 59 [2024-11-07 16:49:12,339 INFO L226 Difference]: Without dead ends: 59 [2024-11-07 16:49:12,339 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:49:12,339 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:12,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-07 16:49:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-07 16:49:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 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:49:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-07 16:49:12,346 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2024-11-07 16:49:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:12,346 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-07 16:49:12,346 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:49:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-07 16:49:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 16:49:12,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:12,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:12,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:49:12,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:12,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2024-11-07 16:49:12,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:12,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391756514] [2024-11-07 16:49:12,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:12,432 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:49:12,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391756514] [2024-11-07 16:49:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391756514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:12,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:12,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:49:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876728531] [2024-11-07 16:49:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:12,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:49:12,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:12,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:49:12,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:49:12,434 INFO L87 Difference]: Start difference. First operand 59 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:49:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:12,443 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-07 16:49:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:49:12,444 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:49:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:12,444 INFO L225 Difference]: With dead ends: 70 [2024-11-07 16:49:12,444 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 16:49:12,444 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:49:12,445 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:49:12,445 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:49:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 16:49:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-07 16:49:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 59 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:49:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-07 16:49:12,448 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 8 [2024-11-07 16:49:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:12,449 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-07 16:49:12,449 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:49:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-07 16:49:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:49:12,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:12,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:12,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:49:12,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:12,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2024-11-07 16:49:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:12,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636656324] [2024-11-07 16:49:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:12,540 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:49:12,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:12,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636656324] [2024-11-07 16:49:12,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636656324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:12,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:12,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:49:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131703803] [2024-11-07 16:49:12,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:12,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:49:12,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:12,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:49:12,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:49:12,542 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:49:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:12,600 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-07 16:49:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:49:12,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:49:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:12,601 INFO L225 Difference]: With dead ends: 59 [2024-11-07 16:49:12,601 INFO L226 Difference]: Without dead ends: 59 [2024-11-07 16:49:12,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:49:12,602 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:12,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:49:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-07 16:49:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-07 16:49:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 58 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:49:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-07 16:49:12,605 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 9 [2024-11-07 16:49:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:12,605 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-07 16:49:12,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:49:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-07 16:49:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:49:12,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:12,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:12,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:49:12,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:12,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2024-11-07 16:49:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:12,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632170325] [2024-11-07 16:49:12,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:12,703 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:49:12,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:12,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632170325] [2024-11-07 16:49:12,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632170325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:12,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:12,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:49:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498798368] [2024-11-07 16:49:12,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:12,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:49:12,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:12,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:49:12,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:49:12,706 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:49:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:12,747 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-07 16:49:12,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:49:12,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:49:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:12,748 INFO L225 Difference]: With dead ends: 58 [2024-11-07 16:49:12,748 INFO L226 Difference]: Without dead ends: 58 [2024-11-07 16:49:12,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:49:12,748 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:12,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-07 16:49:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-07 16:49:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 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:49:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-07 16:49:12,751 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 9 [2024-11-07 16:49:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:12,751 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-07 16:49:12,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:49:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-07 16:49:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:49:12,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:12,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:12,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:49:12,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:12,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2024-11-07 16:49:12,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:12,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306145365] [2024-11-07 16:49:12,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:12,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:12,822 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:49:12,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:12,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306145365] [2024-11-07 16:49:12,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306145365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:12,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948315722] [2024-11-07 16:49:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:12,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:12,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:12,825 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:49:12,826 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:49:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:12,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:49:12,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:12,937 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:49:12,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:12,970 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:49:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948315722] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:12,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-07 16:49:12,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239500884] [2024-11-07 16:49:12,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:12,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:49:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:49:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:49:12,972 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:49:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:12,982 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-07 16:49:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:49:12,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 17 [2024-11-07 16:49:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:12,983 INFO L225 Difference]: With dead ends: 67 [2024-11-07 16:49:12,983 INFO L226 Difference]: Without dead ends: 67 [2024-11-07 16:49:12,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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:49:12,983 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 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:49:12,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-07 16:49:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-07 16:49:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 66 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:49:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-07 16:49:12,986 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 17 [2024-11-07 16:49:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:12,986 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-07 16:49:12,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:49:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-07 16:49:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:49:12,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:12,987 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:12,999 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:49:13,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:13,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:13,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2024-11-07 16:49:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251900126] [2024-11-07 16:49:13,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:13,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:49:13,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:13,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251900126] [2024-11-07 16:49:13,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251900126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:13,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:13,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:49:13,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686898785] [2024-11-07 16:49:13,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:13,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:49:13,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:13,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:49:13,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:49:13,323 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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:49:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:13,477 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-07 16:49:13,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:49:13,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 26 [2024-11-07 16:49:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:13,478 INFO L225 Difference]: With dead ends: 70 [2024-11-07 16:49:13,478 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 16:49:13,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:49:13,479 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:13,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 239 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:49:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 16:49:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-07 16:49:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 69 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:49:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-07 16:49:13,482 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 26 [2024-11-07 16:49:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:13,482 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-07 16:49:13,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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:49:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-07 16:49:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:49:13,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:13,482 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:13,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:49:13,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:13,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:13,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2024-11-07 16:49:13,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:13,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740005956] [2024-11-07 16:49:13,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:13,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:49:13,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:13,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740005956] [2024-11-07 16:49:13,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740005956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:13,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:13,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:49:13,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165501820] [2024-11-07 16:49:13,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:13,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:49:13,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:13,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:49:13,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:49:13,702 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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:49:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:13,847 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-07 16:49:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:49:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-07 16:49:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:13,848 INFO L225 Difference]: With dead ends: 70 [2024-11-07 16:49:13,848 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 16:49:13,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:49:13,848 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:13,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 275 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:49:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 16:49:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-07 16:49:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3818181818181818) 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:49:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-11-07 16:49:13,851 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 26 [2024-11-07 16:49:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:13,851 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-11-07 16:49:13,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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:49:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-11-07 16:49:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:49:13,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:13,852 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:13,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:49:13,852 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:13,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash -893075880, now seen corresponding path program 1 times [2024-11-07 16:49:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:13,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317200172] [2024-11-07 16:49:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:13,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:49:13,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:13,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317200172] [2024-11-07 16:49:13,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317200172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:13,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:13,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:49:13,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968473964] [2024-11-07 16:49:13,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:13,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:49:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:13,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:49:13,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:49:13,925 INFO L87 Difference]: Start difference. First operand 70 states and 76 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:49:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:13,938 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-11-07 16:49:13,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:49:13,938 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 28 [2024-11-07 16:49:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:13,939 INFO L225 Difference]: With dead ends: 101 [2024-11-07 16:49:13,939 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 16:49:13,939 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:49:13,939 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 90 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 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:49:13,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 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:49:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 16:49:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2024-11-07 16:49:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 71 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:49:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-07 16:49:13,942 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 28 [2024-11-07 16:49:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:13,942 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-07 16:49:13,942 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:49:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-07 16:49:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:49:13,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:13,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:13,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:49:13,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:13,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:13,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2024-11-07 16:49:13,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:13,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459893737] [2024-11-07 16:49:13,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:49:14,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:14,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459893737] [2024-11-07 16:49:14,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459893737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:14,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:14,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:49:14,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337216832] [2024-11-07 16:49:14,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:14,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:49:14,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:14,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:49:14,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:49:14,014 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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:49:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:14,034 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2024-11-07 16:49:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:49:14,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 29 [2024-11-07 16:49:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:14,036 INFO L225 Difference]: With dead ends: 92 [2024-11-07 16:49:14,036 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 16:49:14,036 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:49:14,036 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 164 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:49:14,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 164 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 16:49:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2024-11-07 16:49:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 72 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:49:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-07 16:49:14,039 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 29 [2024-11-07 16:49:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:14,039 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-07 16:49:14,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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:49:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-07 16:49:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:49:14,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:14,040 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:14,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:49:14,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:14,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1668563828, now seen corresponding path program 1 times [2024-11-07 16:49:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998617088] [2024-11-07 16:49:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:49:14,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:14,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998617088] [2024-11-07 16:49:14,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998617088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:14,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:14,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:49:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804906072] [2024-11-07 16:49:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:14,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:49:14,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:49:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:49:14,153 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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:49:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:14,288 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-11-07 16:49:14,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:49:14,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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:49:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:14,289 INFO L225 Difference]: With dead ends: 76 [2024-11-07 16:49:14,289 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 16:49:14,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:49:14,290 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:14,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 239 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:49:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 16:49:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-07 16:49:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 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:49:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-07 16:49:14,305 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 33 [2024-11-07 16:49:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:14,305 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-07 16:49:14,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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:49:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-07 16:49:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:49:14,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:14,306 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:14,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:49:14,306 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:14,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:14,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1668563827, now seen corresponding path program 1 times [2024-11-07 16:49:14,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:14,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194552944] [2024-11-07 16:49:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:14,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:49:14,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:14,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194552944] [2024-11-07 16:49:14,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194552944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:14,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177090033] [2024-11-07 16:49:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:14,417 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:49:14,418 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:49:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:14,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:49:14,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:49:14,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:49:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177090033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:14,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:14,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-07 16:49:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582319931] [2024-11-07 16:49:14,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:14,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:49:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:14,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:49:14,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:49:14,647 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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:49:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:14,675 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2024-11-07 16:49:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:49:14,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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 33 [2024-11-07 16:49:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:14,676 INFO L225 Difference]: With dead ends: 100 [2024-11-07 16:49:14,676 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 16:49:14,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:49:14,677 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 128 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:14,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 16:49:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2024-11-07 16:49:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 91 states have internal predecessors, (110), 0 states have call successors, (0), 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:49:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2024-11-07 16:49:14,683 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 33 [2024-11-07 16:49:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:14,683 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2024-11-07 16:49:14,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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:49:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2024-11-07 16:49:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:49:14,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:14,684 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] [2024-11-07 16:49:14,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 16:49:14,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:14,888 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:14,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash -146010198, now seen corresponding path program 1 times [2024-11-07 16:49:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474449035] [2024-11-07 16:49:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:49:15,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:15,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474449035] [2024-11-07 16:49:15,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474449035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:15,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160667212] [2024-11-07 16:49:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:15,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:15,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:15,588 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:49:15,590 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:49:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:15,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-07 16:49:15,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:15,730 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:49:15,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-07 16:49:15,838 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 19 treesize of output 1 [2024-11-07 16:49:16,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:16,002 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 37 treesize of output 19 [2024-11-07 16:49:16,069 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 21 treesize of output 9 [2024-11-07 16:49:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:49:16,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:49:16,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160667212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:16,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:16,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 35 [2024-11-07 16:49:16,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243967491] [2024-11-07 16:49:16,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:16,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-07 16:49:16,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:16,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-07 16:49:16,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 16:49:16,389 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 36 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:49:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:17,040 INFO L93 Difference]: Finished difference Result 147 states and 185 transitions. [2024-11-07 16:49:17,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:49:17,041 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 36 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 34 [2024-11-07 16:49:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:17,042 INFO L225 Difference]: With dead ends: 147 [2024-11-07 16:49:17,042 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 16:49:17,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=1917, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 16:49:17,043 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 124 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:17,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 781 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:49:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 16:49:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 102. [2024-11-07 16:49:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 101 states have internal predecessors, (125), 0 states have call successors, (0), 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:49:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-11-07 16:49:17,047 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 34 [2024-11-07 16:49:17,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:17,047 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-11-07 16:49:17,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 36 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:49:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-11-07 16:49:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:49:17,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:17,048 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] [2024-11-07 16:49:17,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 16:49:17,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:17,253 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:17,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash -146010197, now seen corresponding path program 1 times [2024-11-07 16:49:17,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:17,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475604173] [2024-11-07 16:49:17,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:17,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:49:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475604173] [2024-11-07 16:49:17,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475604173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053053222] [2024-11-07 16:49:17,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:17,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:17,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:17,895 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:49:17,896 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:49:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:17,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-07 16:49:17,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:18,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:49:18,076 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:49:18,076 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:49:18,080 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:49:18,167 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 13 treesize of output 9 [2024-11-07 16:49:18,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:49:18,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:18,376 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 25 treesize of output 13 [2024-11-07 16:49:18,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:18,381 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 37 treesize of output 19 [2024-11-07 16:49:18,440 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 31 treesize of output 13 [2024-11-07 16:49:18,446 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 9 treesize of output 3 [2024-11-07 16:49:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:49:18,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:18,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_565 (Array Int Int))) (or (not (= v_ArrVal_565 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_565 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_563 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_565) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_563)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) (forall ((v_ArrVal_565 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_565) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)) (not (= v_ArrVal_565 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_565 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-07 16:49:19,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:19,049 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 37 treesize of output 55 [2024-11-07 16:49:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-07 16:49:19,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053053222] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:19,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:19,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 42 [2024-11-07 16:49:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758696779] [2024-11-07 16:49:19,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:19,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-07 16:49:19,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-07 16:49:19,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1608, Unknown=1, NotChecked=80, Total=1806 [2024-11-07 16:49:19,189 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 43 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 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:49:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:20,293 INFO L93 Difference]: Finished difference Result 161 states and 202 transitions. [2024-11-07 16:49:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:49:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 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 34 [2024-11-07 16:49:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:20,294 INFO L225 Difference]: With dead ends: 161 [2024-11-07 16:49:20,295 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 16:49:20,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=248, Invalid=2725, Unknown=1, NotChecked=106, Total=3080 [2024-11-07 16:49:20,296 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 86 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:20,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1251 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1362 Invalid, 0 Unknown, 90 Unchecked, 0.6s Time] [2024-11-07 16:49:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 16:49:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2024-11-07 16:49:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 109 states have internal predecessors, (136), 0 states have call successors, (0), 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:49:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-11-07 16:49:20,299 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 34 [2024-11-07 16:49:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:20,299 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-11-07 16:49:20,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 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:49:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-11-07 16:49:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 16:49:20,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:20,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:20,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 16:49:20,504 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,SelfDestructingSolverStorable13 [2024-11-07 16:49:20,505 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:20,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1013729350, now seen corresponding path program 2 times [2024-11-07 16:49:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:20,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371886316] [2024-11-07 16:49:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:49:20,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371886316] [2024-11-07 16:49:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371886316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709013933] [2024-11-07 16:49:20,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:49:20,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:20,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:20,600 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:49:20,601 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:49:20,695 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:49:20,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:49:20,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:49:20,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:49:20,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:49:20,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709013933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:20,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2024-11-07 16:49:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315592223] [2024-11-07 16:49:20,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:20,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:49:20,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:20,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:49:20,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:49:20,756 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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:49:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:20,780 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2024-11-07 16:49:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:49:20,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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 37 [2024-11-07 16:49:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:20,780 INFO L225 Difference]: With dead ends: 96 [2024-11-07 16:49:20,781 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 16:49:20,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:49:20,781 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 24 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:20,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 162 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 16:49:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-07 16:49:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.369047619047619) internal successors, (115), 95 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:49:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2024-11-07 16:49:20,783 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 37 [2024-11-07 16:49:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:20,783 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2024-11-07 16:49:20,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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:49:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2024-11-07 16:49:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 16:49:20,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:20,784 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:20,799 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:49:20,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 16:49:20,989 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:20,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1104183591, now seen corresponding path program 2 times [2024-11-07 16:49:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:20,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005081770] [2024-11-07 16:49:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:20,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:49:21,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005081770] [2024-11-07 16:49:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005081770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704056051] [2024-11-07 16:49:21,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:49:21,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:21,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:21,048 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:49:21,049 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:49:21,154 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:49:21,154 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:49:21,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:49:21,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:49:21,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:49:21,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704056051] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:21,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:21,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 16:49:21,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137516668] [2024-11-07 16:49:21,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:21,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:49:21,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:21,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:49:21,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:49:21,187 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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:49:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:21,210 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2024-11-07 16:49:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:49:21,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 38 [2024-11-07 16:49:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:21,211 INFO L225 Difference]: With dead ends: 100 [2024-11-07 16:49:21,211 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 16:49:21,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:49:21,211 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 62 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:21,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 229 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:21,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 16:49:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2024-11-07 16:49:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.35) internal successors, (108), 91 states have internal predecessors, (108), 0 states have call successors, (0), 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:49:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2024-11-07 16:49:21,216 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 38 [2024-11-07 16:49:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:21,216 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2024-11-07 16:49:21,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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:49:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2024-11-07 16:49:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 16:49:21,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:21,216 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:21,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 16:49:21,416 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,SelfDestructingSolverStorable15 [2024-11-07 16:49:21,417 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:21,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1861613195, now seen corresponding path program 1 times [2024-11-07 16:49:21,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:21,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878338576] [2024-11-07 16:49:21,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:49:21,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:21,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878338576] [2024-11-07 16:49:21,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878338576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:21,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:21,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:49:21,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194194079] [2024-11-07 16:49:21,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:21,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:49:21,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:21,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:49:21,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:49:21,590 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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:49:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:21,709 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2024-11-07 16:49:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:49:21,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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:49:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:21,709 INFO L225 Difference]: With dead ends: 92 [2024-11-07 16:49:21,710 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 16:49:21,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:49:21,710 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:21,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 268 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:49:21,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 16:49:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 16:49:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.3) internal successors, (104), 91 states have internal predecessors, (104), 0 states have call successors, (0), 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:49:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2024-11-07 16:49:21,713 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 41 [2024-11-07 16:49:21,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:21,713 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2024-11-07 16:49:21,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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:49:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2024-11-07 16:49:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:49:21,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:21,714 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:21,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 16:49:21,715 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:21,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:21,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1835573310, now seen corresponding path program 3 times [2024-11-07 16:49:21,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:21,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601281906] [2024-11-07 16:49:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:21,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 16:49:21,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601281906] [2024-11-07 16:49:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601281906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747299137] [2024-11-07 16:49:21,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:49:21,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:21,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:21,797 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:49:21,799 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:49:21,917 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-07 16:49:21,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:49:21,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:49:21,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 16:49:21,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:49:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747299137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:49:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-07 16:49:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142653280] [2024-11-07 16:49:21,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:21,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:49:21,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:21,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:49:21,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:49:21,985 INFO L87 Difference]: Start difference. First operand 92 states and 104 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:49:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:22,003 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-07 16:49:22,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:49:22,003 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 42 [2024-11-07 16:49:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:22,003 INFO L225 Difference]: With dead ends: 94 [2024-11-07 16:49:22,003 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 16:49:22,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:49:22,004 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 35 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:22,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 182 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 16:49:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2024-11-07 16:49:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.28) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 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:49:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-07 16:49:22,005 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 42 [2024-11-07 16:49:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:22,005 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-07 16:49:22,005 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:49:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-07 16:49:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 16:49:22,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:22,006 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:22,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 16:49:22,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:22,206 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:22,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:22,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1595673087, now seen corresponding path program 1 times [2024-11-07 16:49:22,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:22,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815063024] [2024-11-07 16:49:22,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:22,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-07 16:49:22,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815063024] [2024-11-07 16:49:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815063024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:49:22,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625594481] [2024-11-07 16:49:22,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:22,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:49:22,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:22,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:49:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:49:22,256 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:49:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:22,271 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-07 16:49:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:49:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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 44 [2024-11-07 16:49:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:22,273 INFO L225 Difference]: With dead ends: 85 [2024-11-07 16:49:22,273 INFO L226 Difference]: Without dead ends: 85 [2024-11-07 16:49:22,273 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:49:22,273 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 14 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 152 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:49:22,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 152 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-07 16:49:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-07 16:49:22,275 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:49:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-07 16:49:22,275 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 44 [2024-11-07 16:49:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:22,276 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-07 16:49:22,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:49:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-07 16:49:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 16:49:22,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:22,277 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:49:22,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:49:22,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:22,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1354555913, now seen corresponding path program 1 times [2024-11-07 16:49:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:22,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30067878] [2024-11-07 16:49:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:22,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:49:23,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:23,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30067878] [2024-11-07 16:49:23,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30067878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:23,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520672396] [2024-11-07 16:49:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:23,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:23,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:23,100 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:49:23,101 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:49:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:23,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-07 16:49:23,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:23,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:49:23,315 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:49:23,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:49:23,902 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:49:23,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-07 16:49:24,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-07 16:49:24,152 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:49:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:49:24,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:24,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (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_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1078) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-07 16:49:24,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:24,567 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 32 treesize of output 33 [2024-11-07 16:49:24,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:24,579 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 58 treesize of output 61 [2024-11-07 16:49:24,586 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 21 [2024-11-07 16:49:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 16:49:24,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520672396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:24,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 22] total 62 [2024-11-07 16:49:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816203199] [2024-11-07 16:49:24,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:24,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-07 16:49:24,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:24,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-07 16:49:24,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3408, Unknown=52, NotChecked=118, Total=3782 [2024-11-07 16:49:24,915 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 62 states, 62 states have (on average 2.0) internal successors, (124), 62 states have internal predecessors, (124), 0 states have call successors, (0), 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:49:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:26,113 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-07 16:49:26,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 16:49:26,114 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 62 states have internal predecessors, (124), 0 states have call successors, (0), 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 47 [2024-11-07 16:49:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:26,114 INFO L225 Difference]: With dead ends: 87 [2024-11-07 16:49:26,114 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 16:49:26,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=478, Invalid=6277, Unknown=55, NotChecked=162, Total=6972 [2024-11-07 16:49:26,117 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 155 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:26,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1304 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1588 Invalid, 0 Unknown, 70 Unchecked, 0.6s Time] [2024-11-07 16:49:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 16:49:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2024-11-07 16:49:26,121 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:49:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-07 16:49:26,122 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 47 [2024-11-07 16:49:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:26,122 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-07 16:49:26,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 62 states have internal predecessors, (124), 0 states have call successors, (0), 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:49:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-07 16:49:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 16:49:26,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:26,122 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:49:26,141 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:49:26,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:26,323 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:26,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:26,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429550, now seen corresponding path program 1 times [2024-11-07 16:49:26,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:26,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878993933] [2024-11-07 16:49:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:49:27,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:27,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878993933] [2024-11-07 16:49:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878993933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:27,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765327681] [2024-11-07 16:49:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:27,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:27,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:27,366 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:49:27,367 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:49:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:27,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-07 16:49:27,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:27,548 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:49:27,549 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:49:27,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:49:27,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:27,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-07 16:49:27,887 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:49:27,887 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 42 treesize of output 41 [2024-11-07 16:49:27,985 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 31 treesize of output 13 [2024-11-07 16:49:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:49:27,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:28,071 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-07 16:49:28,071 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:49:28,074 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1186 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) is different from false [2024-11-07 16:49:28,078 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1186 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-11-07 16:49:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 11 refuted. 1 times theorem prover too weak. 2 trivial. 3 not checked. [2024-11-07 16:49:28,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765327681] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:28,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 18] total 51 [2024-11-07 16:49:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561403877] [2024-11-07 16:49:28,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:28,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-07 16:49:28,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:28,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-07 16:49:28,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2302, Unknown=20, NotChecked=194, Total=2652 [2024-11-07 16:49:28,391 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 52 states, 51 states have (on average 2.4313725490196076) internal successors, (124), 52 states have internal predecessors, (124), 0 states have call successors, (0), 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:49:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:29,534 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-07 16:49:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 16:49:29,534 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.4313725490196076) internal successors, (124), 52 states have internal predecessors, (124), 0 states have call successors, (0), 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:49:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:29,535 INFO L225 Difference]: With dead ends: 91 [2024-11-07 16:49:29,535 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 16:49:29,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=357, Invalid=4743, Unknown=20, NotChecked=282, Total=5402 [2024-11-07 16:49:29,537 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 207 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:29,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1088 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1520 Invalid, 0 Unknown, 149 Unchecked, 0.6s Time] [2024-11-07 16:49:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 16:49:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-11-07 16:49:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 84 states have internal predecessors, (91), 0 states have call successors, (0), 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:49:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-07 16:49:29,539 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 51 [2024-11-07 16:49:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:29,539 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-07 16:49:29,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.4313725490196076) internal successors, (124), 52 states have internal predecessors, (124), 0 states have call successors, (0), 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:49:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-07 16:49:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 16:49:29,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:29,540 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:49:29,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-07 16:49:29,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:29,743 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:29,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429551, now seen corresponding path program 1 times [2024-11-07 16:49:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:29,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467597937] [2024-11-07 16:49:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:29,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:49:30,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:30,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467597937] [2024-11-07 16:49:30,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467597937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:30,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694789491] [2024-11-07 16:49:30,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:30,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:30,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:30,960 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:49:30,962 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:49:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:31,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-07 16:49:31,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:31,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:49:31,255 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:49:31,255 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:49:31,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:49:31,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:49:31,369 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 13 treesize of output 9 [2024-11-07 16:49:31,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:31,583 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 37 treesize of output 19 [2024-11-07 16:49:31,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:31,592 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 25 treesize of output 13 [2024-11-07 16:49:31,784 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:49:31,784 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 62 treesize of output 57 [2024-11-07 16:49:31,788 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 30 treesize of output 13 [2024-11-07 16:49:31,866 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 31 treesize of output 13 [2024-11-07 16:49:31,869 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 9 treesize of output 3 [2024-11-07 16:49:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:49:31,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:32,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2024-11-07 16:49:32,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2024-11-07 16:49:32,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-07 16:49:32,180 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2024-11-07 16:49:32,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1296 (Array Int Int))) (or (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1298)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1296) .cse0 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) (not (= v_ArrVal_1296 (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1296 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_1296 (Array Int Int))) (or (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1296) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= v_ArrVal_1296 (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1296 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-07 16:49:32,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1298)) .cse1 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1296 (Array Int Int))) (or (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))))) is different from false [2024-11-07 16:49:32,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1296)) (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1298)) .cse1 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2)))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1296)) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))))) is different from false [2024-11-07 16:49:32,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1298)) .cse1 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))))))))) is different from false [2024-11-07 16:49:32,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1298 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1298)) .cse1 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1296 (Array Int Int))) (or (not (= v_ArrVal_1296 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1296 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1296) .cse1 v_ArrVal_1300) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))))))))) is different from false [2024-11-07 16:49:32,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-07 16:49:32,409 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:32,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:32,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-07 16:49:32,413 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 7 [2024-11-07 16:49:32,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-07 16:49:32,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:32,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:32,429 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 41 treesize of output 47 [2024-11-07 16:49:32,431 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:32,432 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 37 treesize of output 35 [2024-11-07 16:49:32,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:32,435 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 28 treesize of output 16 [2024-11-07 16:49:32,438 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:32,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:32,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-07 16:49:32,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-07 16:49:32,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:32,733 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 34 treesize of output 52 [2024-11-07 16:49:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2024-11-07 16:49:32,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694789491] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:32,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:32,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 22] total 68 [2024-11-07 16:49:32,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084255835] [2024-11-07 16:49:32,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:32,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-11-07 16:49:32,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:32,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-11-07 16:49:32,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3342, Unknown=9, NotChecked=1116, Total=4692 [2024-11-07 16:49:32,874 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 69 states, 68 states have (on average 2.161764705882353) internal successors, (147), 69 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:49:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:35,313 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-07 16:49:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 16:49:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 2.161764705882353) internal successors, (147), 69 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 51 [2024-11-07 16:49:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:35,314 INFO L225 Difference]: With dead ends: 91 [2024-11-07 16:49:35,314 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 16:49:35,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=501, Invalid=5846, Unknown=9, NotChecked=1476, Total=7832 [2024-11-07 16:49:35,316 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 113 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 2649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:35,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1473 Invalid, 2649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1904 Invalid, 0 Unknown, 728 Unchecked, 0.9s Time] [2024-11-07 16:49:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 16:49:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2024-11-07 16:49:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 83 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:49:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-11-07 16:49:35,318 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 51 [2024-11-07 16:49:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:35,318 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-11-07 16:49:35,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 2.161764705882353) internal successors, (147), 69 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:49:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-11-07 16:49:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 16:49:35,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:35,318 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] [2024-11-07 16:49:35,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-07 16:49:35,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:35,519 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:35,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:35,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1114916376, now seen corresponding path program 1 times [2024-11-07 16:49:35,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:35,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788855147] [2024-11-07 16:49:35,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:35,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-07 16:49:35,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788855147] [2024-11-07 16:49:35,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788855147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231326214] [2024-11-07 16:49:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:35,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:35,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:35,575 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:49:35,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-07 16:49:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:35,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:49:35,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-07 16:49:35,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-07 16:49:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231326214] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:35,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:35,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-07 16:49:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861204107] [2024-11-07 16:49:35,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:35,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:49:35,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:35,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:49:35,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:49:35,767 INFO L87 Difference]: Start difference. First operand 84 states and 88 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:49:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:35,798 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-07 16:49:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:49:35,798 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 54 [2024-11-07 16:49:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:35,799 INFO L225 Difference]: With dead ends: 84 [2024-11-07 16:49:35,799 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 16:49:35,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 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:49:35,799 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:49:35,799 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:49:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 16:49:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 16:49:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 83 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:49:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-07 16:49:35,802 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 54 [2024-11-07 16:49:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:35,803 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-07 16:49:35,803 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:49:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-07 16:49:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 16:49:35,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:35,803 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] [2024-11-07 16:49:35,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-07 16:49:36,010 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,SelfDestructingSolverStorable22 [2024-11-07 16:49:36,011 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:36,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash 240244101, now seen corresponding path program 2 times [2024-11-07 16:49:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238492428] [2024-11-07 16:49:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-07 16:49:36,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238492428] [2024-11-07 16:49:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238492428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128146687] [2024-11-07 16:49:36,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:49:36,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:36,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:36,121 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:49:36,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-07 16:49:36,278 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:49:36,278 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:49:36,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:49:36,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:49:36,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:49:36,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128146687] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:36,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:36,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-07 16:49:36,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715594647] [2024-11-07 16:49:36,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:36,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:49:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:36,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:49:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:49:36,390 INFO L87 Difference]: Start difference. First operand 84 states and 87 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:49:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:36,453 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2024-11-07 16:49:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:49:36,454 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 54 [2024-11-07 16:49:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:36,454 INFO L225 Difference]: With dead ends: 75 [2024-11-07 16:49:36,454 INFO L226 Difference]: Without dead ends: 75 [2024-11-07 16:49:36,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:49:36,455 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 31 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:36,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 217 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-07 16:49:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-07 16:49:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 74 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:49:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-11-07 16:49:36,456 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 54 [2024-11-07 16:49:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:36,456 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-07 16:49:36,456 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:49:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2024-11-07 16:49:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 16:49:36,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:36,457 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] [2024-11-07 16:49:36,472 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:49:36,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:36,663 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:36,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash 343039153, now seen corresponding path program 1 times [2024-11-07 16:49:36,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:36,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708603695] [2024-11-07 16:49:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:49:38,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:38,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708603695] [2024-11-07 16:49:38,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708603695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:38,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809649119] [2024-11-07 16:49:38,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:38,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:38,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:38,167 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:49:38,171 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:49:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:38,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-07 16:49:38,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:38,534 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:49:38,534 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:49:38,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:49:38,660 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 19 treesize of output 1 [2024-11-07 16:49:38,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:38,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-07 16:49:38,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:38,915 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 25 treesize of output 13 [2024-11-07 16:49:39,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:49:39,178 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 80 treesize of output 73 [2024-11-07 16:49:39,181 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:49:39,184 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:49:39,485 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 39 treesize of output 21 [2024-11-07 16:49:39,487 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:49:39,611 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:39,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:39,613 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 15 treesize of output 10 [2024-11-07 16:49:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:49:39,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:40,230 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 59 treesize of output 46 [2024-11-07 16:49:40,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (let ((.cse0 (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0))) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (and (or .cse0 (< .cse1 1)) (or (forall ((v_ArrVal_1618 (Array Int Int))) (= .cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1618) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) .cse0) (or .cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (< .cse4 0) (< .cse4 (+ .cse1 1))))))))) is different from false [2024-11-07 16:49:40,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615))) (let ((.cse1 (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (< .cse1 0) (< .cse1 (+ (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 1)))))))) (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (< (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0)) (< (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 1)))) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615) .cse6 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1618 (Array Int Int))) (= .cse6 (select (select (store .cse7 .cse6 v_ArrVal_1618) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))))))) is different from false [2024-11-07 16:49:41,101 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= v_ArrVal_1615 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))) (forall ((v_ArrVal_1616 Int)) (or (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1618 (Array Int Int))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1616)) .cse1 v_ArrVal_1618) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= v_ArrVal_1615 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))) (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse4 (+ (select v_ArrVal_1615 .cse2) 1)) (< .cse4 0)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= v_ArrVal_1615 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))) (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)) (< (select v_ArrVal_1615 .cse2) 1))))) (or (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1615 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int) (v_ArrVal_1620 (Array Int Int))) (or (not (= v_ArrVal_1615 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))))))) is different from false [2024-11-07 16:49:41,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (select .cse4 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1615 (Array Int Int))) (or (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1615) .cse2 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (or (< .cse0 (+ (select v_ArrVal_1615 .cse1) 1)) (< .cse0 0)))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1615) .cse2 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 0))) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1618 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1616)) .cse2 v_ArrVal_1618) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse2)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)) (< (select v_ArrVal_1615 .cse1) 1) (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1615) .cse2 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 0))))))))) is different from false [2024-11-07 16:49:41,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse4 .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)) (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1615) .cse3 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (or (< .cse1 0) (< .cse1 (+ (select v_ArrVal_1615 .cse2) 1))))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1618 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1616)) .cse3 v_ArrVal_1618) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) .cse3)) (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1615) .cse3 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 0) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1615 (Array Int Int))) (or (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1615) .cse3 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 0)) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)) (< (select v_ArrVal_1615 .cse2) 1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))))) is different from false [2024-11-07 16:49:41,387 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)) (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 0)) (< (select v_ArrVal_1615 .cse2) 1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 0) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)))) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1618 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| v_ArrVal_1616)) .cse1 v_ArrVal_1618) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int)) (or (forall ((v_ArrVal_1615 (Array Int Int))) (or (forall ((v_ArrVal_1620 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1615) .cse1 v_ArrVal_1620) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (or (< .cse4 0) (< .cse4 (+ (select v_ArrVal_1615 .cse2) 1))))) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1615 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1615)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))))) is different from false [2024-11-07 16:49:41,436 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 61 treesize of output 59 [2024-11-07 16:49:41,444 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:41,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:41,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-07 16:49:41,454 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 21 treesize of output 13 [2024-11-07 16:49:41,460 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:49:41,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:41,471 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-07 16:49:41,471 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 25 treesize of output 1 [2024-11-07 16:49:41,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:41,482 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 24 treesize of output 22 [2024-11-07 16:49:41,485 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:41,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:41,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-07 16:49:41,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-07 16:49:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-07 16:49:41,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809649119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:41,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:41,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 29, 29] total 87 [2024-11-07 16:49:41,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899687995] [2024-11-07 16:49:41,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:41,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-11-07 16:49:41,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:41,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-11-07 16:49:41,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=6120, Unknown=124, NotChecked=978, Total=7482 [2024-11-07 16:49:41,963 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 87 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 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:49:43,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse9 (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0)) (.cse11 (<= 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse14 (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (.cse15 (<= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (<= (select .cse1 .cse2) 0) (not (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615))) (let ((.cse5 (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse5 0) (< .cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1)))))))) (forall ((v_ArrVal_1615 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615))) (or (not (= (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (< (select (select (store .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)) (< (select (select .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1)))) .cse9 (= (select .cse4 4) 0) (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1616 Int) (v_ArrVal_1620 (Array Int Int))) (or (not (= (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))) .cse10) .cse10 (= .cse7 .cse3) (<= |c_ULTIMATE.start_sll_update_at_~head#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) .cse11 (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_1615 (Array Int Int))) (or (not (= (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1615 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1615)) (forall ((v_ArrVal_1616 Int)) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1616)))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1620 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1615) .cse12 v_ArrVal_1620) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1618 (Array Int Int))) (= .cse12 (select (select (store .cse13 .cse12 v_ArrVal_1618) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))) .cse14 (= .cse1 .cse4) (or (and (not .cse0) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select .cse3 4)) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select .cse1 4)) .cse11 .cse14 .cse15) (and .cse0 .cse9 .cse11 .cse14)) .cse15 (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2024-11-07 16:49:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:45,504 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2024-11-07 16:49:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 16:49:45,504 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 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:49:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:45,504 INFO L225 Difference]: With dead ends: 77 [2024-11-07 16:49:45,504 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 16:49:45,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2908 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=672, Invalid=12089, Unknown=149, NotChecked=1610, Total=14520 [2024-11-07 16:49:45,507 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 130 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:45,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1485 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2620 Invalid, 0 Unknown, 447 Unchecked, 1.2s Time] [2024-11-07 16:49:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 16:49:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2024-11-07 16:49:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1076923076923078) 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:49:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2024-11-07 16:49:45,509 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 57 [2024-11-07 16:49:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:45,509 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2024-11-07 16:49:45,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 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:49:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2024-11-07 16:49:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 16:49:45,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:45,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-07 16:49:45,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-07 16:49:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:45,714 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341834, now seen corresponding path program 1 times [2024-11-07 16:49:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:45,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071002144] [2024-11-07 16:49:45,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-07 16:49:45,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:45,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071002144] [2024-11-07 16:49:45,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071002144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:45,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344806037] [2024-11-07 16:49:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:45,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:45,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:45,789 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:49:45,790 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:49:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:45,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 16:49:45,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 16:49:46,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:46,127 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:49:46,127 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 12 treesize of output 11 [2024-11-07 16:49:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 16:49:46,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344806037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:46,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:46,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-07 16:49:46,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49299245] [2024-11-07 16:49:46,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:46,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:49:46,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:46,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:49:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:49:46,134 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 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:49:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:46,170 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2024-11-07 16:49:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:49:46,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 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 59 [2024-11-07 16:49:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:46,171 INFO L225 Difference]: With dead ends: 72 [2024-11-07 16:49:46,171 INFO L226 Difference]: Without dead ends: 72 [2024-11-07 16:49:46,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:49:46,174 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:46,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:49:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-07 16:49:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-07 16:49:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 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:49:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-07 16:49:46,176 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 59 [2024-11-07 16:49:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:46,176 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-07 16:49:46,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 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:49:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-07 16:49:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 16:49:46,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:46,176 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-07 16:49:46,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-07 16:49:46,377 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,SelfDestructingSolverStorable25 [2024-11-07 16:49:46,377 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:46,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341833, now seen corresponding path program 1 times [2024-11-07 16:49:46,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:46,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254320703] [2024-11-07 16:49:46,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:46,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:49:46,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:46,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254320703] [2024-11-07 16:49:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254320703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:46,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:46,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:49:46,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311604951] [2024-11-07 16:49:46,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:46,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:49:46,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:49:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:49:46,518 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 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:49:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:46,648 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2024-11-07 16:49:46,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:49:46,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 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:49:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:46,649 INFO L225 Difference]: With dead ends: 74 [2024-11-07 16:49:46,649 INFO L226 Difference]: Without dead ends: 74 [2024-11-07 16:49:46,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:49:46,649 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:46,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 184 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:49:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-07 16:49:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-07 16:49:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 73 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:49:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2024-11-07 16:49:46,651 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 59 [2024-11-07 16:49:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:46,651 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-07 16:49:46,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 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:49:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2024-11-07 16:49:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 16:49:46,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:46,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-07 16:49:46,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 16:49:46,652 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:46,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1658827182, now seen corresponding path program 1 times [2024-11-07 16:49:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580006031] [2024-11-07 16:49:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:46,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:49:46,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:46,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580006031] [2024-11-07 16:49:46,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580006031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:46,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:46,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:49:46,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978488846] [2024-11-07 16:49:46,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:46,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:49:46,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:46,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:49:46,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:49:46,822 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 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:49:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:46,915 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2024-11-07 16:49:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:49:46,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 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 60 [2024-11-07 16:49:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:46,915 INFO L225 Difference]: With dead ends: 76 [2024-11-07 16:49:46,915 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 16:49:46,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:49:46,916 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:46,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 230 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:49:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 16:49:46,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-07 16:49:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 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:49:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-11-07 16:49:46,918 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 60 [2024-11-07 16:49:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:46,918 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-07 16:49:46,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 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:49:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2024-11-07 16:49:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 16:49:46,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:46,918 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-07 16:49:46,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 16:49:46,919 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:46,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash -698613301, now seen corresponding path program 1 times [2024-11-07 16:49:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:46,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674549902] [2024-11-07 16:49:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:49:47,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:47,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674549902] [2024-11-07 16:49:47,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674549902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:49:47,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:49:47,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:49:47,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310741158] [2024-11-07 16:49:47,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:49:47,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:49:47,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:47,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:49:47,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:49:47,100 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 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:49:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:47,224 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2024-11-07 16:49:47,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:49:47,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 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 62 [2024-11-07 16:49:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:47,225 INFO L225 Difference]: With dead ends: 75 [2024-11-07 16:49:47,225 INFO L226 Difference]: Without dead ends: 75 [2024-11-07 16:49:47,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:49:47,226 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:47,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:49:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-07 16:49:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-07 16:49:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 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:49:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-11-07 16:49:47,229 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 62 [2024-11-07 16:49:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:47,229 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-07 16:49:47,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 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:49:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2024-11-07 16:49:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 16:49:47,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:47,233 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2024-11-07 16:49:47,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 16:49:47,233 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:47,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:47,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827867, now seen corresponding path program 1 times [2024-11-07 16:49:47,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:47,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499469689] [2024-11-07 16:49:47,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:47,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 16:49:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499469689] [2024-11-07 16:49:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499469689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924452719] [2024-11-07 16:49:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:47,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:47,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:47,947 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:49:47,948 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:49:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:48,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-07 16:49:48,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:48,124 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:49:48,154 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:49:48,155 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:49:48,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:49:48,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:48,340 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 12 [2024-11-07 16:49:48,433 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:49:48,433 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 34 treesize of output 33 [2024-11-07 16:49:48,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:48,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-07 16:49:48,661 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:49:48,661 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:49:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:49:48,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:48,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:48,837 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 35 [2024-11-07 16:49:49,409 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 15 treesize of output 13 [2024-11-07 16:49:49,412 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 40 treesize of output 38 [2024-11-07 16:49:49,425 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 14 treesize of output 12 [2024-11-07 16:49:49,426 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:49:49,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924452719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:49,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:49,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 52 [2024-11-07 16:49:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538061933] [2024-11-07 16:49:49,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:49,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-07 16:49:49,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:49,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-07 16:49:49,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2024-11-07 16:49:49,580 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 53 states have internal predecessors, (132), 0 states have call successors, (0), 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:49:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:50,499 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-07 16:49:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 16:49:50,500 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 53 states have internal predecessors, (132), 0 states have call successors, (0), 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 65 [2024-11-07 16:49:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:50,500 INFO L225 Difference]: With dead ends: 84 [2024-11-07 16:49:50,500 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 16:49:50,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=320, Invalid=4102, Unknown=0, NotChecked=0, Total=4422 [2024-11-07 16:49:50,501 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:50,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 687 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 16:49:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 16:49:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-07 16:49:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1095890410958904) 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:49:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-07 16:49:50,503 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2024-11-07 16:49:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:50,504 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-07 16:49:50,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 53 states have internal predecessors, (132), 0 states have call successors, (0), 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:49:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-07 16:49:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 16:49:50,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:50,504 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2024-11-07 16:49:50,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-07 16:49:50,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:50,709 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:49:50,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:49:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827868, now seen corresponding path program 1 times [2024-11-07 16:49:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:49:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174541497] [2024-11-07 16:49:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:49:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:49:52,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:49:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174541497] [2024-11-07 16:49:52,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174541497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:49:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728612438] [2024-11-07 16:49:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:49:52,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:49:52,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:49:52,609 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:49:52,609 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:49:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:49:52,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-07 16:49:52,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:49:52,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:49:52,946 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:49:52,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-07 16:49:52,954 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:49:52,954 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:49:53,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:49:53,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:49:53,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:53,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 16:49:53,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:53,268 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:49:53,425 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:49:53,425 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 50 treesize of output 45 [2024-11-07 16:49:53,429 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:49:53,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:53,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-07 16:49:53,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:53,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-07 16:49:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:49:53,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:49:54,528 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2107 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2107))) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2106 Int)) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2106)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2108) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (not (= (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2107 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2107)) (< (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))) (forall ((v_ArrVal_2107 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2107))) (or (not (= (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2107 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2107)) (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2106 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2106)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_2108) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2109) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (< (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))))) is different from false [2024-11-07 16:49:55,750 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 38 [2024-11-07 16:49:55,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:55,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:55,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-07 16:49:55,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:55,760 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 28 treesize of output 26 [2024-11-07 16:49:55,768 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:55,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:55,773 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 37 treesize of output 43 [2024-11-07 16:49:55,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2024-11-07 16:49:55,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:55,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:49:55,782 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2024-11-07 16:49:55,785 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 7 [2024-11-07 16:49:55,788 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:49:55,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:49:55,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-07 16:49:55,799 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:49:55,800 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 30 treesize of output 24 [2024-11-07 16:49:56,211 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:49:56,212 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 13 treesize of output 12 [2024-11-07 16:49:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 16 refuted. 1 times theorem prover too weak. 11 trivial. 3 not checked. [2024-11-07 16:49:56,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728612438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:49:56,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:49:56,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 23, 24] total 79 [2024-11-07 16:49:56,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057080340] [2024-11-07 16:49:56,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:49:56,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-07 16:49:56,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:49:56,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-07 16:49:56,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=5759, Unknown=133, NotChecked=154, Total=6320 [2024-11-07 16:49:56,405 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 80 states, 79 states have (on average 2.2278481012658227) internal successors, (176), 80 states have internal predecessors, (176), 0 states have call successors, (0), 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:49:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:49:59,899 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2024-11-07 16:49:59,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-07 16:49:59,900 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 2.2278481012658227) internal successors, (176), 80 states have internal predecessors, (176), 0 states have call successors, (0), 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 65 [2024-11-07 16:49:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:49:59,905 INFO L225 Difference]: With dead ends: 86 [2024-11-07 16:49:59,905 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 16:49:59,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2260 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=640, Invalid=9943, Unknown=133, NotChecked=204, Total=10920 [2024-11-07 16:49:59,907 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 128 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 2643 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:49:59,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1061 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2643 Invalid, 0 Unknown, 77 Unchecked, 1.7s Time] [2024-11-07 16:49:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 16:49:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-07 16:49:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 79 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:49:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2024-11-07 16:49:59,914 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 65 [2024-11-07 16:49:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:49:59,914 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2024-11-07 16:49:59,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 2.2278481012658227) internal successors, (176), 80 states have internal predecessors, (176), 0 states have call successors, (0), 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:49:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2024-11-07 16:49:59,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 16:49:59,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:49:59,915 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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:49:59,928 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:50:00,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:50:00,116 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:50:00,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:50:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1642891405, now seen corresponding path program 1 times [2024-11-07 16:50:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:50:00,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821850309] [2024-11-07 16:50:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:50:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:50:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:50:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 16:50:00,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:50:00,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821850309] [2024-11-07 16:50:00,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821850309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:50:00,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706412883] [2024-11-07 16:50:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:50:00,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:50:00,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:50:00,659 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:50:00,660 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:50:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:50:00,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-07 16:50:00,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:50:00,924 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:50:00,924 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:50:00,998 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:50:01,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:50:01,164 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 16 [2024-11-07 16:50:01,276 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:50:01,277 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 33 treesize of output 32 [2024-11-07 16:50:01,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:01,380 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 26 treesize of output 20 [2024-11-07 16:50:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:50:01,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:50:01,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2219) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-07 16:50:01,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2219) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-07 16:50:01,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2218)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2219)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-07 16:50:01,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_93| Int) (v_ArrVal_2218 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_93|) (not (= (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_93| v_ArrVal_2218)) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2219)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)))) is different from false [2024-11-07 16:50:01,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_93| Int) (v_ArrVal_2218 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_93|) (not (= (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_93| v_ArrVal_2218)) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2219)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from false [2024-11-07 16:50:01,811 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:50:01,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:01,815 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 24 treesize of output 30 [2024-11-07 16:50:01,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:01,821 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 35 treesize of output 33 [2024-11-07 16:50:01,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-07 16:50:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 11 not checked. [2024-11-07 16:50:01,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706412883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:50:01,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:50:01,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 25] total 53 [2024-11-07 16:50:01,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473461966] [2024-11-07 16:50:01,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:50:01,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-07 16:50:01,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:50:01,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-07 16:50:01,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2103, Unknown=32, NotChecked=480, Total=2756 [2024-11-07 16:50:01,954 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 0 states have call successors, (0), 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:50:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:50:03,443 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2024-11-07 16:50:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 16:50:03,444 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 0 states have call successors, (0), 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 66 [2024-11-07 16:50:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:50:03,444 INFO L225 Difference]: With dead ends: 86 [2024-11-07 16:50:03,444 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 16:50:03,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=410, Invalid=5128, Unknown=32, NotChecked=750, Total=6320 [2024-11-07 16:50:03,445 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 93 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 371 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:50:03,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 704 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1540 Invalid, 0 Unknown, 371 Unchecked, 0.6s Time] [2024-11-07 16:50:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 16:50:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-07 16:50:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.08) internal successors, (81), 79 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:50:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2024-11-07 16:50:03,448 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 66 [2024-11-07 16:50:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:50:03,448 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2024-11-07 16:50:03,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 0 states have call successors, (0), 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:50:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2024-11-07 16:50:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 16:50:03,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:50:03,449 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2024-11-07 16:50:03,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-07 16:50:03,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:50:03,649 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:50:03,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:50:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1727882938, now seen corresponding path program 1 times [2024-11-07 16:50:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:50:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641120345] [2024-11-07 16:50:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:50:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:50:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:50:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:50:04,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:50:04,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641120345] [2024-11-07 16:50:04,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641120345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:50:04,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694376925] [2024-11-07 16:50:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:50:04,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:50:04,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:50:04,383 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:50:04,383 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:50:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:50:04,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-07 16:50:04,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:50:04,671 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:50:04,671 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:50:04,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:50:04,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:50:04,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 16:50:04,887 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:50:04,888 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 34 treesize of output 33 [2024-11-07 16:50:04,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:04,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-07 16:50:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:50:05,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:50:05,188 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2329) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-07 16:50:05,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2329) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-07 16:50:05,249 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2329) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-07 16:50:05,258 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int)) (v_ArrVal_2328 Int)) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2328)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2329)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-07 16:50:05,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_100| Int) (v_ArrVal_2328 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_100|) (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_100| v_ArrVal_2328)) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2329)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-07 16:50:05,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2329 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_100| Int) (v_ArrVal_2328 Int)) (or (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_100| v_ArrVal_2328)) (select .cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2329)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_100|))) is different from false [2024-11-07 16:50:05,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:50:05,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:05,480 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 23 treesize of output 29 [2024-11-07 16:50:05,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:05,485 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 30 [2024-11-07 16:50:05,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-07 16:50:05,606 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:50:05,606 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 13 treesize of output 12 [2024-11-07 16:50:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 11 not checked. [2024-11-07 16:50:05,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694376925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:50:05,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:50:05,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 48 [2024-11-07 16:50:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451595974] [2024-11-07 16:50:05,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:50:05,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-07 16:50:05,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:50:05,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-07 16:50:05,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1636, Unknown=52, NotChecked=522, Total=2352 [2024-11-07 16:50:05,652 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 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:50:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:50:06,716 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2024-11-07 16:50:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 16:50:06,717 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 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 68 [2024-11-07 16:50:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:50:06,717 INFO L225 Difference]: With dead ends: 87 [2024-11-07 16:50:06,717 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 16:50:06,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=283, Invalid=3229, Unknown=52, NotChecked=726, Total=4290 [2024-11-07 16:50:06,719 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 69 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:50:06,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 722 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1202 Invalid, 0 Unknown, 413 Unchecked, 0.5s Time] [2024-11-07 16:50:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 16:50:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2024-11-07 16:50:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 80 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:50:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2024-11-07 16:50:06,723 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 68 [2024-11-07 16:50:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:50:06,724 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2024-11-07 16:50:06,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 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:50:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2024-11-07 16:50:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 16:50:06,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:50:06,726 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 16:50:06,739 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:50:06,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:50:06,927 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-07 16:50:06,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:50:06,927 INFO L85 PathProgramCache]: Analyzing trace with hash -177401856, now seen corresponding path program 2 times [2024-11-07 16:50:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:50:06,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112495680] [2024-11-07 16:50:06,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:50:06,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:50:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:50:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:50:08,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:50:08,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112495680] [2024-11-07 16:50:08,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112495680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:50:08,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608596605] [2024-11-07 16:50:08,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:50:08,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:50:08,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:50:08,382 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:50:08,383 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:50:08,601 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:50:08,601 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:50:08,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-07 16:50:08,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:50:08,690 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:50:08,695 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:50:08,749 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:50:08,749 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:50:08,802 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:50:08,806 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:50:08,818 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:50:08,823 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:50:08,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 16:50:08,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 16:50:09,177 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-11-07 16:50:09,178 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-11-07 16:50:09,191 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-07 16:50:09,191 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-07 16:50:09,652 INFO L349 Elim1Store]: treesize reduction 116, result has 43.4 percent of original size [2024-11-07 16:50:09,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 162 [2024-11-07 16:50:09,746 INFO L349 Elim1Store]: treesize reduction 108, result has 47.3 percent of original size [2024-11-07 16:50:09,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 129 [2024-11-07 16:50:25,931 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-07 16:50:25,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2024-11-07 16:50:25,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:25,935 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 1 case distinctions, treesize of input 24 treesize of output 18 [2024-11-07 16:50:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:50:25,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:50:31,328 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (< (select .cse0 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|) (= (select (let ((.cse1 (let ((.cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (forall ((v_ArrVal_2447 (Array Int Int))) (or (not (= v_ArrVal_2447 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2447)) (.cse7 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (not (= v_ArrVal_2451 (store (select .cse6 (select .cse7 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (= (select (let ((.cse8 (select .cse5 4))) (select (store .cse6 .cse8 v_ArrVal_2451) (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))))) is different from false [2024-11-07 16:50:31,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (forall ((v_ArrVal_2447 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2447)) (.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (= (select (let ((.cse1 (select .cse4 4))) (select (store .cse0 .cse1 v_ArrVal_2451) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0) (not (= (store (select .cse0 (select .cse3 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (not (= v_ArrVal_2447 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (= (select (let ((.cse6 (let ((.cse9 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse9)) (.cse8 (select .cse9 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))))) is different from false [2024-11-07 16:50:31,385 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (< (select .cse0 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (= (select (let ((.cse1 (let ((.cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (forall ((v_ArrVal_2447 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2447)) (.cse9 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (= (select (let ((.cse7 (select .cse5 4))) (select (store .cse6 .cse7 v_ArrVal_2451) (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (not (= (store (select .cse6 (select .cse9 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451))))) (not (= v_ArrVal_2447 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))))) is different from false [2024-11-07 16:50:31,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (forall ((v_ArrVal_2447 (Array Int Int))) (or (not (= v_ArrVal_2447 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2447)) (.cse9 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (= (select (let ((.cse7 (select .cse4 4))) (select (store .cse6 .cse7 v_ArrVal_2451) (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= v_ArrVal_2451 (store (select .cse6 (select .cse9 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))))) is different from false [2024-11-07 16:50:31,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse5 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|) (< (select .cse0 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (= (select (let ((.cse1 (let ((.cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|) (forall ((v_ArrVal_2447 (Array Int Int))) (or (not (= v_ArrVal_2447 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2447)) (.cse9 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (= (select (let ((.cse7 (select .cse5 4))) (select (store .cse6 .cse7 v_ArrVal_2451) (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= (store (select .cse6 (select .cse9 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))))))))))) is different from false [2024-11-07 16:50:31,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse5 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse4 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|) (forall ((v_ArrVal_2447 (Array Int Int))) (or (not (= (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)) v_ArrVal_2447)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2447)) (.cse7 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (not (= v_ArrVal_2451 (store (select .cse6 (select .cse7 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (= (select (let ((.cse8 (select .cse4 4))) (select (store .cse6 .cse8 v_ArrVal_2451) (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))))))))))) is different from false [2024-11-07 16:50:31,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse4 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int) (v_ArrVal_2448 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_108| Int)) (or (forall ((v_ArrVal_2447 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2448 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse7 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| v_ArrVal_2448))) (or (not (= (store (select .cse6 (select .cse7 4)) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (= (select (let ((.cse8 (select .cse4 4))) (select (store .cse6 .cse8 v_ArrVal_2451) (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (not (= (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108| (select v_ArrVal_2447 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)) v_ArrVal_2447)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_108|)))))) is different from false [2024-11-07 16:50:31,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:50:31,571 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:50:31,616 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-11-07 16:50:31,616 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 3 case distinctions, treesize of input 150 treesize of output 142 [2024-11-07 16:50:31,640 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-07 16:50:31,641 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 1 case distinctions, treesize of input 14 treesize of output 15 [2024-11-07 16:50:32,030 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:50:32,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:50:32,059 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-11-07 16:50:32,060 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 3 case distinctions, treesize of input 160 treesize of output 120 [2024-11-07 16:50:32,065 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:50:32,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse0 (not .cse8)) (.cse27 (< 0 .cse4))) (and (or .cse0 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse3 (select v_ArrVal_2447 4))) (or (= (select (select (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_7 4))) (not (= (store (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse7 (select v_arrayElimArr_8 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse8) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_2450 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse9 (let ((.cse11 (select v_arrayElimArr_8 4))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse12 (store .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_2450 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse13 (let ((.cse15 (select v_arrayElimArr_8 4))) (store .cse14 .cse15 (store (select .cse14 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse16 (store .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (or (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse19 (select v_arrayElimArr_8 4))) (store .cse18 .cse19 (store (select .cse18 .cse19) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse20 (let ((.cse22 (select v_arrayElimArr_8 4))) (store .cse21 .cse22 (store (select .cse21 .cse22) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse23 (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (= (select (let ((.cse24 (let ((.cse25 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse26 (select v_arrayElimArr_8 4))) (store .cse25 .cse26 (store (select .cse25 .cse26) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse27)) .cse8) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (= (select (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse30 (select v_arrayElimArr_8 4))) (store .cse29 .cse30 (store (select .cse29 .cse30) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse31 (let ((.cse33 (select v_arrayElimArr_8 4))) (store .cse32 .cse33 (store (select .cse32 .cse33) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse31 (select (select .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse34 (store .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse34 (select (select .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) .cse27) (or (and (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse36 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse35 .cse36 v_ArrVal_2451) (select (select (let ((.cse37 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse37 .cse36 (store (select .cse37 .cse36) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse35 .cse36) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) .cse27) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse39 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse38 .cse39 v_ArrVal_2451) (select (select (let ((.cse40 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse40 .cse39 (store (select .cse40 .cse39) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2447 .cse4))) (not (= (store (select .cse38 .cse39) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))))))) .cse8) (or .cse0 (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_144 Int)) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_7 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse42 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse43 (select v_ArrVal_2447 4))) (or (= (select (select (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (store .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (= (select (select (store .cse41 v_arrayElimCell_144 v_ArrVal_2451) (select (select (store .cse42 v_arrayElimCell_144 (store (select .cse42 v_arrayElimCell_144) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (< .cse43 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))))) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_7 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse46 (select v_ArrVal_2447 4))) (or (= (select (select (store .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (let ((.cse45 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= .cse46 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< .cse46 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))))))) (or .cse8 (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse47 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse48 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse47 .cse48 v_ArrVal_2451) (select (select (store .cse49 .cse48 (store (select .cse49 .cse48) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (store .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2447 .cse4))) (not (= (store (select .cse47 .cse48) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (not (= (select v_arrayElimArr_7 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse50 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse51 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse50 .cse51 v_ArrVal_2451) (select (select (store .cse52 .cse51 (store (select .cse52 .cse51) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store .cse50 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse50 .cse51) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) .cse27)))))) is different from false [2024-11-07 16:50:38,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:38,125 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 373 treesize of output 304 [2024-11-07 16:50:38,345 INFO L349 Elim1Store]: treesize reduction 108, result has 69.9 percent of original size [2024-11-07 16:50:38,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 1057 treesize of output 1198 [2024-11-07 16:50:38,445 INFO L349 Elim1Store]: treesize reduction 36, result has 67.0 percent of original size [2024-11-07 16:50:38,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1471 treesize of output 1442 [2024-11-07 16:50:38,504 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 915 treesize of output 869 [2024-11-07 16:50:38,674 INFO L349 Elim1Store]: treesize reduction 72, result has 73.4 percent of original size [2024-11-07 16:50:38,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1027 treesize of output 1176 [2024-11-07 16:50:38,766 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-07 16:50:38,766 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 620 treesize of output 623 [2024-11-07 16:50:38,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:38,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 610 treesize of output 650 [2024-11-07 16:50:38,961 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 723 treesize of output 691 [2024-11-07 16:50:39,040 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 1094 treesize of output 1040 [2024-11-07 16:50:39,151 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-07 16:50:39,152 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 567 treesize of output 576 [2024-11-07 16:50:41,756 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:50:41,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:41,903 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 133 treesize of output 135 [2024-11-07 16:50:42,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:42,037 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 66 treesize of output 68 [2024-11-07 16:50:42,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:42,081 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 48 [2024-11-07 16:50:42,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:50:42,105 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 23 [2024-11-07 16:50:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2024-11-07 16:50:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608596605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:50:42,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:50:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 31] total 72 [2024-11-07 16:50:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572481481] [2024-11-07 16:50:42,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:50:42,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-11-07 16:50:42,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:50:42,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-11-07 16:50:42,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3800, Unknown=24, NotChecked=1048, Total=5112 [2024-11-07 16:50:42,132 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 72 states, 72 states have (on average 2.3333333333333335) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 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:50:46,448 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse0 (not .cse8)) (.cse27 (< 0 .cse4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse0 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse3 (select v_ArrVal_2447 4))) (or (= (select (select (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_7 4))) (not (= (store (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse7 (select v_arrayElimArr_8 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse8) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_2450 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse9 (let ((.cse11 (select v_arrayElimArr_8 4))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse12 (store .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_2450 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse13 (let ((.cse15 (select v_arrayElimArr_8 4))) (store .cse14 .cse15 (store (select .cse14 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse16 (store .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (or (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse19 (select v_arrayElimArr_8 4))) (store .cse18 .cse19 (store (select .cse18 .cse19) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse20 (let ((.cse22 (select v_arrayElimArr_8 4))) (store .cse21 .cse22 (store (select .cse21 .cse22) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse23 (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (= (select (let ((.cse24 (let ((.cse25 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse26 (select v_arrayElimArr_8 4))) (store .cse25 .cse26 (store (select .cse25 .cse26) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse27)) .cse8) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (= (select (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8)) (.cse30 (select v_arrayElimArr_8 4))) (store .cse29 .cse30 (store (select .cse29 .cse30) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2450 Int)) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_8))) (or (= (select (let ((.cse31 (let ((.cse33 (select v_arrayElimArr_8 4))) (store .cse32 .cse33 (store (select .cse32 .cse33) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))))) (select .cse31 (select (select .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse34 (store .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)))) (select .cse34 (select (select .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) .cse27) .cse8 (or (and (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse36 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse35 .cse36 v_ArrVal_2451) (select (select (let ((.cse37 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse37 .cse36 (store (select .cse37 .cse36) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse35 .cse36) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) .cse27) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse39 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse38 .cse39 v_ArrVal_2451) (select (select (let ((.cse40 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse40 .cse39 (store (select .cse40 .cse39) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2447 .cse4))) (not (= (store (select .cse38 .cse39) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|))))))) .cse8) (or .cse0 (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_144 Int)) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_7 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse42 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse43 (select v_ArrVal_2447 4))) (or (= (select (select (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (store .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (= (select (select (store .cse41 v_arrayElimCell_144 v_ArrVal_2451) (select (select (store .cse42 v_arrayElimCell_144 (store (select .cse42 v_arrayElimCell_144) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (< .cse43 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))))) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_7 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse46 (select v_ArrVal_2447 4))) (or (= (select (select (store .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (let ((.cse45 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7))) (store .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= .cse46 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< .cse46 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))))))) (or .cse8 (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse47 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse48 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse47 .cse48 v_ArrVal_2451) (select (select (store .cse49 .cse48 (store (select .cse49 .cse48) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (store .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2447 .cse4))) (not (= (store (select .cse47 .cse48) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) (not (= (select v_arrayElimArr_7 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_105| Int) (v_ArrVal_2450 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2451 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse50 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2447)) (.cse51 (select v_arrayElimArr_7 4))) (or (= (select (select (store .cse50 .cse51 v_ArrVal_2451) (select (select (store .cse52 .cse51 (store (select .cse52 .cse51) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store .cse50 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2451) (select (select (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| v_ArrVal_2450)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse50 .cse51) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105| (select v_ArrVal_2451 |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)) v_ArrVal_2451)) (< (select v_ArrVal_2447 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_105|)))) .cse27))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true