./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.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/uthash-2.0.2/uthash_JEN_test1-1.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', '8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7'] 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/uthash-2.0.2/uthash_JEN_test1-1.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 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 18:49:56,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 18:49:56,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 18:49:56,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 18:49:56,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 18:49:56,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 18:49:56,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 18:49:56,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 18:49:56,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 18:49:56,392 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 18:49:56,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 18:49:56,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 18:49:56,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 18:49:56,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 18:49:56,393 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 18:49:56,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 18:49:56,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 18:49:56,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 18:49:56,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 18:49:56,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 18:49:56,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 18:49:56,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 18:49:56,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:49:56,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 18:49:56,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 18:49:56,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 18:49:56,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 18:49:56,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 18:49:56,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 18:49:56,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 18:49:56,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 18:49:56,397 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 -> 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 [2024-11-07 18:49:56,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 18:49:56,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 18:49:56,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 18:49:56,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 18:49:56,625 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 18:49:56,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2024-11-07 18:49:57,815 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 18:49:58,084 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 18:49:58,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2024-11-07 18:49:58,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e48b6e597/f33ca91edf864d59836466c9609c2647/FLAG6cfe58c46 [2024-11-07 18:49:58,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e48b6e597/f33ca91edf864d59836466c9609c2647 [2024-11-07 18:49:58,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 18:49:58,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 18:49:58,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 18:49:58,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 18:49:58,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 18:49:58,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa39f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58, skipping insertion in model container [2024-11-07 18:49:58,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:49:58,410 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:49:58,431 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:49:58,434 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:49:58,440 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:49:58,444 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:49:58,459 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:49:58,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:49:58,479 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 18:49:58,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:49:58,575 INFO L204 MainTranslator]: Completed translation [2024-11-07 18:49:58,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58 WrapperNode [2024-11-07 18:49:58,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 18:49:58,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 18:49:58,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 18:49:58,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 18:49:58,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,626 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 849 [2024-11-07 18:49:58,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 18:49:58,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 18:49:58,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 18:49:58,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 18:49:58,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,690 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-07 18:49:58,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 18:49:58,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 18:49:58,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 18:49:58,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 18:49:58,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (1/1) ... [2024-11-07 18:49:58,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:49:58,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:49:58,757 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 18:49:58,774 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 18:49:58,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 18:49:58,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 18:49:58,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 18:49:58,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 18:49:58,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 18:49:58,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 18:49:58,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 18:49:58,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 18:49:58,796 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 18:49:58,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 18:49:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 18:49:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 18:49:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 18:49:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 18:49:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 18:49:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 18:49:58,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 18:49:58,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 18:49:58,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 18:49:58,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 18:49:58,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 18:49:58,951 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 18:49:58,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 18:49:58,954 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:49:58,983 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:50:00,219 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2024-11-07 18:50:00,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 18:50:00,233 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 18:50:00,234 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-07 18:50:00,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:00 BoogieIcfgContainer [2024-11-07 18:50:00,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 18:50:00,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 18:50:00,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 18:50:00,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 18:50:00,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:49:58" (1/3) ... [2024-11-07 18:50:00,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3845cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:00, skipping insertion in model container [2024-11-07 18:50:00,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:58" (2/3) ... [2024-11-07 18:50:00,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3845cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:00, skipping insertion in model container [2024-11-07 18:50:00,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:00" (3/3) ... [2024-11-07 18:50:00,244 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test1-1.i [2024-11-07 18:50:00,262 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 18:50:00,262 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-07 18:50:00,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 18:50:00,329 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;@505a94a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 18:50:00,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-07 18:50:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 758 states, 425 states have (on average 2.061176470588235) internal successors, (876), 752 states have internal predecessors, (876), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 18:50:00,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:00,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 18:50:00,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:00,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-07 18:50:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:00,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632314371] [2024-11-07 18:50:00,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:00,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:00,464 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 18:50:00,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:00,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632314371] [2024-11-07 18:50:00,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632314371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:00,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:00,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:50:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498892768] [2024-11-07 18:50:00,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:00,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:00,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:00,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:00,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:00,498 INFO L87 Difference]: Start difference. First operand has 758 states, 425 states have (on average 2.061176470588235) internal successors, (876), 752 states have internal predecessors, (876), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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 18:50:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:00,987 INFO L93 Difference]: Finished difference Result 701 states and 809 transitions. [2024-11-07 18:50:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:00,988 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 18:50:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:01,003 INFO L225 Difference]: With dead ends: 701 [2024-11-07 18:50:01,003 INFO L226 Difference]: Without dead ends: 699 [2024-11-07 18:50:01,004 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 18:50:01,005 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 697 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:01,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 510 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 18:50:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-07 18:50:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2024-11-07 18:50:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 419 states have (on average 1.8568019093078758) internal successors, (778), 691 states have internal predecessors, (778), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 804 transitions. [2024-11-07 18:50:01,053 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 804 transitions. Word has length 5 [2024-11-07 18:50:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:01,053 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 804 transitions. [2024-11-07 18:50:01,053 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 18:50:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 804 transitions. [2024-11-07 18:50:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 18:50:01,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:01,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 18:50:01,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 18:50:01,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:01,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:01,055 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-07 18:50:01,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:01,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195802604] [2024-11-07 18:50:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:01,117 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 18:50:01,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:01,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195802604] [2024-11-07 18:50:01,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195802604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:01,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:01,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:50:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349487035] [2024-11-07 18:50:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:01,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:01,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:01,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:01,119 INFO L87 Difference]: Start difference. First operand 697 states and 804 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 18:50:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:01,475 INFO L93 Difference]: Finished difference Result 775 states and 888 transitions. [2024-11-07 18:50:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:01,475 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 18:50:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:01,478 INFO L225 Difference]: With dead ends: 775 [2024-11-07 18:50:01,478 INFO L226 Difference]: Without dead ends: 775 [2024-11-07 18:50:01,478 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 18:50:01,478 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 412 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:01,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 913 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 18:50:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-07 18:50:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 727. [2024-11-07 18:50:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 459 states have (on average 1.8453159041394336) internal successors, (847), 721 states have internal predecessors, (847), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 873 transitions. [2024-11-07 18:50:01,500 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 873 transitions. Word has length 5 [2024-11-07 18:50:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:01,500 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 873 transitions. [2024-11-07 18:50:01,500 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 18:50:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 873 transitions. [2024-11-07 18:50:01,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 18:50:01,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:01,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 18:50:01,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 18:50:01,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:01,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1423336739, now seen corresponding path program 1 times [2024-11-07 18:50:01,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:01,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269411861] [2024-11-07 18:50:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:01,522 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 18:50:01,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:01,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269411861] [2024-11-07 18:50:01,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269411861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:01,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:01,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:01,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200649430] [2024-11-07 18:50:01,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:01,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:01,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:01,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:01,524 INFO L87 Difference]: Start difference. First operand 727 states and 873 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 18:50:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:01,577 INFO L93 Difference]: Finished difference Result 1404 states and 1676 transitions. [2024-11-07 18:50:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-07 18:50:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:01,586 INFO L225 Difference]: With dead ends: 1404 [2024-11-07 18:50:01,586 INFO L226 Difference]: Without dead ends: 1404 [2024-11-07 18:50:01,586 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 18:50:01,587 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 717 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:01,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1578 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:50:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2024-11-07 18:50:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 728. [2024-11-07 18:50:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 460 states have (on average 1.8434782608695652) internal successors, (848), 722 states have internal predecessors, (848), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 874 transitions. [2024-11-07 18:50:01,645 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 874 transitions. Word has length 6 [2024-11-07 18:50:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:01,645 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 874 transitions. [2024-11-07 18:50:01,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 18:50:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 874 transitions. [2024-11-07 18:50:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 18:50:01,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:01,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:01,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 18:50:01,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:01,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:01,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-07 18:50:01,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:01,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894586138] [2024-11-07 18:50:01,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:01,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:01,777 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 18:50:01,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:01,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894586138] [2024-11-07 18:50:01,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894586138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:01,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:01,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080409835] [2024-11-07 18:50:01,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:01,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:50:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:01,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:50:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:50:01,778 INFO L87 Difference]: Start difference. First operand 728 states and 874 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 18:50:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:02,545 INFO L93 Difference]: Finished difference Result 754 states and 927 transitions. [2024-11-07 18:50:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:50:02,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-07 18:50:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:02,549 INFO L225 Difference]: With dead ends: 754 [2024-11-07 18:50:02,549 INFO L226 Difference]: Without dead ends: 754 [2024-11-07 18:50:02,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 18:50:02,550 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 965 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:02,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 791 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 18:50:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-07 18:50:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 705. [2024-11-07 18:50:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 460 states have (on average 1.7934782608695652) internal successors, (825), 699 states have internal predecessors, (825), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 851 transitions. [2024-11-07 18:50:02,571 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 851 transitions. Word has length 11 [2024-11-07 18:50:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:02,572 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 851 transitions. [2024-11-07 18:50:02,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 18:50:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 851 transitions. [2024-11-07 18:50:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 18:50:02,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:02,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:02,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 18:50:02,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:02,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610649, now seen corresponding path program 1 times [2024-11-07 18:50:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:02,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097485317] [2024-11-07 18:50:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:02,671 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 18:50:02,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:02,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097485317] [2024-11-07 18:50:02,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097485317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:02,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:02,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:02,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894172792] [2024-11-07 18:50:02,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:02,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:02,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:02,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:02,672 INFO L87 Difference]: Start difference. First operand 705 states and 851 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 18:50:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:02,709 INFO L93 Difference]: Finished difference Result 630 states and 748 transitions. [2024-11-07 18:50:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:02,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-07 18:50:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:02,711 INFO L225 Difference]: With dead ends: 630 [2024-11-07 18:50:02,711 INFO L226 Difference]: Without dead ends: 630 [2024-11-07 18:50:02,711 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 18:50:02,712 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 61 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:02,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1259 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:50:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-07 18:50:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2024-11-07 18:50:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 397 states have (on average 1.818639798488665) internal successors, (722), 624 states have internal predecessors, (722), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 748 transitions. [2024-11-07 18:50:02,729 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 748 transitions. Word has length 11 [2024-11-07 18:50:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:02,729 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 748 transitions. [2024-11-07 18:50:02,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 18:50:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 748 transitions. [2024-11-07 18:50:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 18:50:02,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:02,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:02,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 18:50:02,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:02,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:02,730 INFO L85 PathProgramCache]: Analyzing trace with hash 614478435, now seen corresponding path program 1 times [2024-11-07 18:50:02,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:02,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449855904] [2024-11-07 18:50:02,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:02,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:02,808 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 18:50:02,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:02,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449855904] [2024-11-07 18:50:02,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449855904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:02,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:02,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:50:02,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970966109] [2024-11-07 18:50:02,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:02,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:50:02,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:02,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:50:02,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:50:02,809 INFO L87 Difference]: Start difference. First operand 630 states and 748 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 18:50:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:02,848 INFO L93 Difference]: Finished difference Result 612 states and 723 transitions. [2024-11-07 18:50:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:50:02,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-07 18:50:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:02,850 INFO L225 Difference]: With dead ends: 612 [2024-11-07 18:50:02,850 INFO L226 Difference]: Without dead ends: 612 [2024-11-07 18:50:02,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:50:02,851 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 41 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:02,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1835 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:50:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-07 18:50:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2024-11-07 18:50:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 383 states have (on average 1.8120104438642297) internal successors, (694), 603 states have internal predecessors, (694), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 720 transitions. [2024-11-07 18:50:02,887 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 720 transitions. Word has length 13 [2024-11-07 18:50:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:02,888 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 720 transitions. [2024-11-07 18:50:02,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 18:50:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 720 transitions. [2024-11-07 18:50:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 18:50:02,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:02,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:02,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 18:50:02,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:02,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash 530126353, now seen corresponding path program 1 times [2024-11-07 18:50:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747088475] [2024-11-07 18:50:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:02,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:03,031 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 18:50:03,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:03,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747088475] [2024-11-07 18:50:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747088475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:03,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019457398] [2024-11-07 18:50:03,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:03,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:50:03,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:03,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:50:03,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:50:03,033 INFO L87 Difference]: Start difference. First operand 609 states and 720 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:50:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:03,620 INFO L93 Difference]: Finished difference Result 702 states and 807 transitions. [2024-11-07 18:50:03,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:50:03,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-07 18:50:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:03,622 INFO L225 Difference]: With dead ends: 702 [2024-11-07 18:50:03,622 INFO L226 Difference]: Without dead ends: 702 [2024-11-07 18:50:03,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 18:50:03,623 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 417 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:03,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1136 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 18:50:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-11-07 18:50:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 605. [2024-11-07 18:50:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.8015665796344646) internal successors, (690), 599 states have internal predecessors, (690), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 716 transitions. [2024-11-07 18:50:03,638 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 716 transitions. Word has length 27 [2024-11-07 18:50:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:03,639 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 716 transitions. [2024-11-07 18:50:03,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:50:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 716 transitions. [2024-11-07 18:50:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 18:50:03,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:03,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:03,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 18:50:03,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:03,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1653190907, now seen corresponding path program 1 times [2024-11-07 18:50:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997072040] [2024-11-07 18:50:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:03,748 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 18:50:03,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:03,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997072040] [2024-11-07 18:50:03,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997072040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:03,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:03,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:50:03,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290458371] [2024-11-07 18:50:03,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:03,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:50:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:03,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:50:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:50:03,750 INFO L87 Difference]: Start difference. First operand 605 states and 716 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 18:50:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:03,822 INFO L93 Difference]: Finished difference Result 605 states and 712 transitions. [2024-11-07 18:50:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:50:03,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-07 18:50:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:03,825 INFO L225 Difference]: With dead ends: 605 [2024-11-07 18:50:03,825 INFO L226 Difference]: Without dead ends: 605 [2024-11-07 18:50:03,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:50:03,825 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 21 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:03,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1817 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:50:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-07 18:50:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-07 18:50:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.7911227154046998) internal successors, (686), 599 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 712 transitions. [2024-11-07 18:50:03,834 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 712 transitions. Word has length 61 [2024-11-07 18:50:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:03,834 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 712 transitions. [2024-11-07 18:50:03,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 18:50:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 712 transitions. [2024-11-07 18:50:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 18:50:03,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:03,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:03,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 18:50:03,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:03,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1854806959, now seen corresponding path program 1 times [2024-11-07 18:50:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:03,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533387167] [2024-11-07 18:50:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:03,932 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 18:50:03,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:03,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533387167] [2024-11-07 18:50:03,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533387167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:03,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:03,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571358751] [2024-11-07 18:50:03,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:03,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:03,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:03,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:03,935 INFO L87 Difference]: Start difference. First operand 605 states and 712 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:50:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:03,971 INFO L93 Difference]: Finished difference Result 697 states and 831 transitions. [2024-11-07 18:50:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:03,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 18:50:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:03,974 INFO L225 Difference]: With dead ends: 697 [2024-11-07 18:50:03,974 INFO L226 Difference]: Without dead ends: 697 [2024-11-07 18:50:03,974 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 18:50:03,975 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 54 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:03,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1234 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:50:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-07 18:50:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-11-07 18:50:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 475 states have (on average 1.694736842105263) internal successors, (805), 691 states have internal predecessors, (805), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 831 transitions. [2024-11-07 18:50:03,987 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 831 transitions. Word has length 69 [2024-11-07 18:50:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:03,988 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 831 transitions. [2024-11-07 18:50:03,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:50:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 831 transitions. [2024-11-07 18:50:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 18:50:03,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:03,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:03,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 18:50:03,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:03,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1907003630, now seen corresponding path program 1 times [2024-11-07 18:50:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330953281] [2024-11-07 18:50:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:04,454 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 18:50:04,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:04,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330953281] [2024-11-07 18:50:04,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330953281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:04,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:04,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 18:50:04,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023133272] [2024-11-07 18:50:04,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:04,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 18:50:04,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:04,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 18:50:04,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:50:04,455 INFO L87 Difference]: Start difference. First operand 697 states and 831 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 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 18:50:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:04,993 INFO L93 Difference]: Finished difference Result 659 states and 793 transitions. [2024-11-07 18:50:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:50:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 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) Word has length 72 [2024-11-07 18:50:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:04,995 INFO L225 Difference]: With dead ends: 659 [2024-11-07 18:50:04,995 INFO L226 Difference]: Without dead ends: 659 [2024-11-07 18:50:04,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:50:04,996 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 914 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:04,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 782 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 18:50:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-07 18:50:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 619. [2024-11-07 18:50:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 435 states have (on average 1.5816091954022988) internal successors, (688), 613 states have internal predecessors, (688), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 714 transitions. [2024-11-07 18:50:05,008 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 714 transitions. Word has length 72 [2024-11-07 18:50:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:05,008 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 714 transitions. [2024-11-07 18:50:05,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 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 18:50:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 714 transitions. [2024-11-07 18:50:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 18:50:05,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:05,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:05,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 18:50:05,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:05,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash -954300764, now seen corresponding path program 1 times [2024-11-07 18:50:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:05,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818902947] [2024-11-07 18:50:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:05,216 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 18:50:05,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:05,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818902947] [2024-11-07 18:50:05,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818902947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:05,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:05,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:50:05,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988108155] [2024-11-07 18:50:05,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:05,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:50:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:05,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:50:05,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:50:05,217 INFO L87 Difference]: Start difference. First operand 619 states and 714 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:50:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:05,573 INFO L93 Difference]: Finished difference Result 618 states and 713 transitions. [2024-11-07 18:50:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:50:05,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-07 18:50:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:05,575 INFO L225 Difference]: With dead ends: 618 [2024-11-07 18:50:05,576 INFO L226 Difference]: Without dead ends: 618 [2024-11-07 18:50:05,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 18:50:05,576 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 2 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:05,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1669 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 18:50:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-07 18:50:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2024-11-07 18:50:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 435 states have (on average 1.5793103448275863) internal successors, (687), 612 states have internal predecessors, (687), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-07 18:50:05,585 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 77 [2024-11-07 18:50:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:05,586 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-07 18:50:05,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:50:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-07 18:50:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 18:50:05,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:05,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:05,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 18:50:05,588 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:05,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash -954300763, now seen corresponding path program 1 times [2024-11-07 18:50:05,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:05,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643213554] [2024-11-07 18:50:05,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:05,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:05,914 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 18:50:05,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:05,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643213554] [2024-11-07 18:50:05,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643213554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:05,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:05,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:50:05,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616788382] [2024-11-07 18:50:05,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:05,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:50:05,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:05,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:50:05,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:50:05,916 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:50:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:06,362 INFO L93 Difference]: Finished difference Result 617 states and 712 transitions. [2024-11-07 18:50:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:50:06,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-07 18:50:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:06,364 INFO L225 Difference]: With dead ends: 617 [2024-11-07 18:50:06,364 INFO L226 Difference]: Without dead ends: 617 [2024-11-07 18:50:06,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 18:50:06,365 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:06,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1676 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 18:50:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-07 18:50:06,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-11-07 18:50:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 434 states have (on average 1.5806451612903225) internal successors, (686), 611 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 712 transitions. [2024-11-07 18:50:06,378 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 712 transitions. Word has length 77 [2024-11-07 18:50:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:06,379 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 712 transitions. [2024-11-07 18:50:06,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:50:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 712 transitions. [2024-11-07 18:50:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 18:50:06,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:06,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:06,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 18:50:06,380 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:06,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1675418123, now seen corresponding path program 1 times [2024-11-07 18:50:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:06,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79760322] [2024-11-07 18:50:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:06,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:06,568 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 18:50:06,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:06,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79760322] [2024-11-07 18:50:06,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79760322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:06,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:06,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 18:50:06,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449591915] [2024-11-07 18:50:06,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:06,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 18:50:06,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:06,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 18:50:06,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 18:50:06,570 INFO L87 Difference]: Start difference. First operand 617 states and 712 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:07,184 INFO L93 Difference]: Finished difference Result 629 states and 727 transitions. [2024-11-07 18:50:07,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 18:50:07,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-07 18:50:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:07,187 INFO L225 Difference]: With dead ends: 629 [2024-11-07 18:50:07,188 INFO L226 Difference]: Without dead ends: 629 [2024-11-07 18:50:07,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 18:50:07,189 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 16 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:07,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2460 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 18:50:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-07 18:50:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 623. [2024-11-07 18:50:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 439 states have (on average 1.5785876993166288) internal successors, (693), 616 states have internal predecessors, (693), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-07 18:50:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 722 transitions. [2024-11-07 18:50:07,200 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 722 transitions. Word has length 85 [2024-11-07 18:50:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:07,200 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 722 transitions. [2024-11-07 18:50:07,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 722 transitions. [2024-11-07 18:50:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 18:50:07,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:07,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:07,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 18:50:07,202 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:07,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1675418124, now seen corresponding path program 1 times [2024-11-07 18:50:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:07,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47479989] [2024-11-07 18:50:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:07,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:07,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:07,583 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 18:50:07,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:07,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47479989] [2024-11-07 18:50:07,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47479989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:07,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:07,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 18:50:07,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577010140] [2024-11-07 18:50:07,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:07,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 18:50:07,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:07,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 18:50:07,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 18:50:07,584 INFO L87 Difference]: Start difference. First operand 623 states and 722 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:08,143 INFO L93 Difference]: Finished difference Result 623 states and 721 transitions. [2024-11-07 18:50:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:50:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-07 18:50:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:08,146 INFO L225 Difference]: With dead ends: 623 [2024-11-07 18:50:08,146 INFO L226 Difference]: Without dead ends: 623 [2024-11-07 18:50:08,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 18:50:08,147 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 11 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:08,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2496 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 18:50:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-07 18:50:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2024-11-07 18:50:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 439 states have (on average 1.5763097949886105) internal successors, (692), 616 states have internal predecessors, (692), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-07 18:50:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 721 transitions. [2024-11-07 18:50:08,155 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 721 transitions. Word has length 85 [2024-11-07 18:50:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:08,156 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 721 transitions. [2024-11-07 18:50:08,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 721 transitions. [2024-11-07 18:50:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 18:50:08,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:08,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:08,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 18:50:08,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:08,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1642216262, now seen corresponding path program 1 times [2024-11-07 18:50:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497848964] [2024-11-07 18:50:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:08,450 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 18:50:08,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:08,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497848964] [2024-11-07 18:50:08,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497848964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:08,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783371919] [2024-11-07 18:50:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:08,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:08,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:08,453 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 18:50:08,454 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 18:50:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:08,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 18:50:08,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:08,627 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 18:50:08,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:08,811 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 18:50:08,832 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 18:50:08,934 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:08,934 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 18:50:08,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 18:50:08,979 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 18:50:08,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:50:09,017 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-07 18:50:09,017 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 18:50:09,025 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-07 18:50:09,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783371919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:09,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:50:09,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-07 18:50:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107457123] [2024-11-07 18:50:09,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:50:09,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 18:50:09,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:09,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 18:50:09,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-07 18:50:09,028 INFO L87 Difference]: Start difference. First operand 623 states and 721 transitions. Second operand has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:50:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:10,253 INFO L93 Difference]: Finished difference Result 622 states and 720 transitions. [2024-11-07 18:50:10,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 18:50:10,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-07 18:50:10,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:10,255 INFO L225 Difference]: With dead ends: 622 [2024-11-07 18:50:10,255 INFO L226 Difference]: Without dead ends: 622 [2024-11-07 18:50:10,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-07 18:50:10,256 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 511 mSDsluCounter, 2950 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:10,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 3309 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 18:50:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-07 18:50:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2024-11-07 18:50:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 439 states have (on average 1.5740318906605923) internal successors, (691), 615 states have internal predecessors, (691), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-07 18:50:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 720 transitions. [2024-11-07 18:50:10,265 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 720 transitions. Word has length 86 [2024-11-07 18:50:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:10,266 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 720 transitions. [2024-11-07 18:50:10,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:50:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 720 transitions. [2024-11-07 18:50:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 18:50:10,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:10,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:10,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 18:50:10,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 18:50:10,472 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:10,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1642216263, now seen corresponding path program 1 times [2024-11-07 18:50:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:10,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831781083] [2024-11-07 18:50:10,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:10,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:10,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:10,974 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 18:50:10,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:10,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831781083] [2024-11-07 18:50:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831781083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:10,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95308368] [2024-11-07 18:50:10,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:10,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:10,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:10,977 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 18:50:10,978 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 18:50:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:11,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 18:50:11,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:11,134 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 18:50:11,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:11,222 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 18:50:11,226 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 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 18:50:11,245 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 18:50:11,249 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 18:50:11,310 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 22 treesize of output 10 [2024-11-07 18:50:11,313 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 18:50:11,406 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:11,406 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 18:50:11,410 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 18:50:11,442 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 18:50:11,447 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 18:50:11,463 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 18:50:11,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:50:11,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_643 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-07 18:50:11,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95308368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:11,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:50:11,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-07 18:50:11,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398531406] [2024-11-07 18:50:11,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:50:11,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 18:50:11,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:11,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 18:50:11,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-07 18:50:11,545 INFO L87 Difference]: Start difference. First operand 622 states and 720 transitions. Second operand has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:50:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:12,962 INFO L93 Difference]: Finished difference Result 629 states and 727 transitions. [2024-11-07 18:50:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 18:50:12,963 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-07 18:50:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:12,965 INFO L225 Difference]: With dead ends: 629 [2024-11-07 18:50:12,965 INFO L226 Difference]: Without dead ends: 629 [2024-11-07 18:50:12,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-07 18:50:12,965 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 513 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 2933 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:12,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 2927 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2933 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 18:50:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-07 18:50:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 620. [2024-11-07 18:50:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 438 states have (on average 1.5730593607305936) internal successors, (689), 613 states have internal predecessors, (689), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2024-11-07 18:50:12,973 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 86 [2024-11-07 18:50:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:12,973 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2024-11-07 18:50:12,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:50:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2024-11-07 18:50:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 18:50:12,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:12,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:12,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 18:50:13,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 18:50:13,178 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:13,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:13,179 INFO L85 PathProgramCache]: Analyzing trace with hash 566960249, now seen corresponding path program 1 times [2024-11-07 18:50:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:13,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975558632] [2024-11-07 18:50:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:13,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:13,518 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 18:50:13,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:13,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975558632] [2024-11-07 18:50:13,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975558632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:13,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:13,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 18:50:13,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920257262] [2024-11-07 18:50:13,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:13,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 18:50:13,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:13,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 18:50:13,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-07 18:50:13,521 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:14,898 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-07 18:50:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 18:50:14,898 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-07 18:50:14,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:14,900 INFO L225 Difference]: With dead ends: 633 [2024-11-07 18:50:14,900 INFO L226 Difference]: Without dead ends: 633 [2024-11-07 18:50:14,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-07 18:50:14,901 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 526 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 3914 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:14,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 3914 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3088 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 18:50:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-07 18:50:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 629. [2024-11-07 18:50:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 446 states have (on average 1.5672645739910314) internal successors, (699), 621 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 726 transitions. [2024-11-07 18:50:14,908 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 726 transitions. Word has length 88 [2024-11-07 18:50:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:14,908 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 726 transitions. [2024-11-07 18:50:14,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 726 transitions. [2024-11-07 18:50:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 18:50:14,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:14,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:14,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 18:50:14,909 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:14,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:14,909 INFO L85 PathProgramCache]: Analyzing trace with hash 566960250, now seen corresponding path program 1 times [2024-11-07 18:50:14,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:14,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861595282] [2024-11-07 18:50:14,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:14,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:15,304 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 18:50:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861595282] [2024-11-07 18:50:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861595282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:15,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:15,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 18:50:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498493999] [2024-11-07 18:50:15,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:15,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 18:50:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:15,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 18:50:15,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-07 18:50:15,306 INFO L87 Difference]: Start difference. First operand 629 states and 726 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:16,103 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-07 18:50:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 18:50:16,104 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-07 18:50:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:16,105 INFO L225 Difference]: With dead ends: 632 [2024-11-07 18:50:16,105 INFO L226 Difference]: Without dead ends: 632 [2024-11-07 18:50:16,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-07 18:50:16,106 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 513 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:16,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1790 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 18:50:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-07 18:50:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-07 18:50:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 446 states have (on average 1.5650224215246638) internal successors, (698), 621 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 725 transitions. [2024-11-07 18:50:16,112 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 725 transitions. Word has length 88 [2024-11-07 18:50:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:16,113 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 725 transitions. [2024-11-07 18:50:16,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 725 transitions. [2024-11-07 18:50:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 18:50:16,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:16,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:16,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 18:50:16,113 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:16,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash -707202722, now seen corresponding path program 1 times [2024-11-07 18:50:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:16,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889327123] [2024-11-07 18:50:16,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:16,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:16,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:16,425 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 18:50:16,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:16,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889327123] [2024-11-07 18:50:16,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889327123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:16,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26185007] [2024-11-07 18:50:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:16,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:16,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:16,427 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 18:50:16,428 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 18:50:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:16,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 18:50:16,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:16,582 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 18:50:16,665 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:16,665 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 18:50:16,671 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 18:50:16,724 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:16,724 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 18:50:16,758 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:16,758 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 18:50:16,767 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 18:50:16,769 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 18:50:16,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:50:16,776 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))))) is different from false [2024-11-07 18:50:16,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-07 18:50:16,812 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-07 18:50:16,813 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 33 treesize of output 32 [2024-11-07 18:50:16,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26185007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:16,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:50:16,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-07 18:50:16,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440666223] [2024-11-07 18:50:16,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:50:16,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 18:50:16,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 18:50:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=257, Unknown=6, NotChecked=66, Total=380 [2024-11-07 18:50:16,839 INFO L87 Difference]: Start difference. First operand 629 states and 725 transitions. Second operand has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:18,186 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-07 18:50:18,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 18:50:18,186 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-07 18:50:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:18,188 INFO L225 Difference]: With dead ends: 631 [2024-11-07 18:50:18,188 INFO L226 Difference]: Without dead ends: 631 [2024-11-07 18:50:18,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=543, Unknown=6, NotChecked=98, Total=756 [2024-11-07 18:50:18,188 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 495 mSDsluCounter, 3907 mSDsCounter, 0 mSdLazyCounter, 3338 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 4265 SdHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:18,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 4265 Invalid, 3361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3338 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 18:50:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-07 18:50:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 628. [2024-11-07 18:50:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 446 states have (on average 1.562780269058296) internal successors, (697), 620 states have internal predecessors, (697), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 724 transitions. [2024-11-07 18:50:18,196 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 724 transitions. Word has length 89 [2024-11-07 18:50:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:18,196 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 724 transitions. [2024-11-07 18:50:18,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 724 transitions. [2024-11-07 18:50:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 18:50:18,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:18,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:18,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 18:50:18,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:18,397 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:18,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -707202721, now seen corresponding path program 1 times [2024-11-07 18:50:18,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:18,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765486161] [2024-11-07 18:50:18,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:18,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:18,896 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 18:50:18,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:18,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765486161] [2024-11-07 18:50:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765486161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024965594] [2024-11-07 18:50:18,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:18,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:18,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:18,899 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 18:50:18,900 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 18:50:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:19,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 18:50:19,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:19,055 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 18:50:19,155 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 18:50:19,164 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:19,164 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 18:50:19,171 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 18:50:19,175 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 18:50:19,224 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 22 treesize of output 10 [2024-11-07 18:50:19,226 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 18:50:19,329 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:19,329 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 18:50:19,333 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 18:50:19,391 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:19,391 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 18:50:19,396 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 18:50:19,408 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 18:50:19,410 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 18:50:19,414 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 18:50:19,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:50:19,472 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1045 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-07 18:50:19,487 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1045 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-07 18:50:19,551 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1051) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1051) .cse1 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-07 18:50:19,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024965594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:19,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:50:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-07 18:50:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638616587] [2024-11-07 18:50:19,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:50:19,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 18:50:19,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:19,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 18:50:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=293, Unknown=3, NotChecked=108, Total=462 [2024-11-07 18:50:19,557 INFO L87 Difference]: Start difference. First operand 628 states and 724 transitions. Second operand has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:50:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:21,390 INFO L93 Difference]: Finished difference Result 630 states and 728 transitions. [2024-11-07 18:50:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 18:50:21,391 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-07 18:50:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:21,396 INFO L225 Difference]: With dead ends: 630 [2024-11-07 18:50:21,396 INFO L226 Difference]: Without dead ends: 630 [2024-11-07 18:50:21,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2024-11-07 18:50:21,398 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 502 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 3437 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 3463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:21,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 3016 Invalid, 3463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3437 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 18:50:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-07 18:50:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 618. [2024-11-07 18:50:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 438 states have (on average 1.5684931506849316) internal successors, (687), 611 states have internal predecessors, (687), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-07 18:50:21,411 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 89 [2024-11-07 18:50:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:21,412 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-07 18:50:21,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:50:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-07 18:50:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 18:50:21,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:21,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:21,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 18:50:21,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:21,613 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:21,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1792985486, now seen corresponding path program 1 times [2024-11-07 18:50:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226228314] [2024-11-07 18:50:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:21,953 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 18:50:21,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:21,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226228314] [2024-11-07 18:50:21,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226228314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:21,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:21,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 18:50:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582984925] [2024-11-07 18:50:21,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:21,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 18:50:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 18:50:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-07 18:50:21,954 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:22,901 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-07 18:50:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 18:50:22,901 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-07 18:50:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:22,904 INFO L225 Difference]: With dead ends: 634 [2024-11-07 18:50:22,904 INFO L226 Difference]: Without dead ends: 634 [2024-11-07 18:50:22,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-07 18:50:22,905 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 511 mSDsluCounter, 2582 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:22,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2939 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 18:50:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-07 18:50:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 630. [2024-11-07 18:50:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.55902004454343) internal successors, (700), 622 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 727 transitions. [2024-11-07 18:50:22,918 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 727 transitions. Word has length 91 [2024-11-07 18:50:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:22,918 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 727 transitions. [2024-11-07 18:50:22,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 727 transitions. [2024-11-07 18:50:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 18:50:22,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:22,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:22,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 18:50:22,919 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:22,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:22,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1792985485, now seen corresponding path program 1 times [2024-11-07 18:50:22,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:22,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499114304] [2024-11-07 18:50:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:22,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:23,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:23,431 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 18:50:23,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:23,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499114304] [2024-11-07 18:50:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499114304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:23,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:23,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 18:50:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414117742] [2024-11-07 18:50:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:23,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 18:50:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 18:50:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-07 18:50:23,432 INFO L87 Difference]: Start difference. First operand 630 states and 727 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:24,517 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-07 18:50:24,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 18:50:24,520 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-07 18:50:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:24,521 INFO L225 Difference]: With dead ends: 633 [2024-11-07 18:50:24,522 INFO L226 Difference]: Without dead ends: 633 [2024-11-07 18:50:24,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-07 18:50:24,526 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 526 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:24,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2667 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 18:50:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-07 18:50:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-07 18:50:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.556792873051225) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-07 18:50:24,532 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 91 [2024-11-07 18:50:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:24,532 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-07 18:50:24,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-07 18:50:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 18:50:24,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:24,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:24,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 18:50:24,535 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:24,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:24,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1461092499, now seen corresponding path program 1 times [2024-11-07 18:50:24,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:24,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150223196] [2024-11-07 18:50:24,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:24,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:24,875 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 18:50:24,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150223196] [2024-11-07 18:50:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150223196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160331925] [2024-11-07 18:50:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:24,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:24,877 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 18:50:24,878 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 18:50:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:25,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 18:50:25,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:25,042 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 18:50:25,116 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:25,116 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 18:50:25,135 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 18:50:25,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:25,189 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 18:50:25,228 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:25,229 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 18:50:25,273 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:25,273 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 18:50:25,283 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 18:50:25,285 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 18:50:25,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:50:25,336 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1331 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-07 18:50:25,441 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-07 18:50:25,441 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 57 treesize of output 56 [2024-11-07 18:50:25,448 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1334))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1330)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-07 18:50:25,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160331925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:25,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:50:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 18 [2024-11-07 18:50:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224020754] [2024-11-07 18:50:25,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:50:25,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 18:50:25,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:25,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 18:50:25,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=368, Unknown=29, NotChecked=82, Total=552 [2024-11-07 18:50:25,450 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:26,650 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-07 18:50:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 18:50:26,652 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-07 18:50:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:26,655 INFO L225 Difference]: With dead ends: 632 [2024-11-07 18:50:26,655 INFO L226 Difference]: Without dead ends: 632 [2024-11-07 18:50:26,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=756, Unknown=36, NotChecked=118, Total=1056 [2024-11-07 18:50:26,656 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 497 mSDsluCounter, 3898 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 4255 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:26,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 4255 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 18:50:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-07 18:50:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-07 18:50:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 449 states have (on average 1.55456570155902) internal successors, (698), 621 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 725 transitions. [2024-11-07 18:50:26,669 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 725 transitions. Word has length 92 [2024-11-07 18:50:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:26,670 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 725 transitions. [2024-11-07 18:50:26,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 725 transitions. [2024-11-07 18:50:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 18:50:26,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:26,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:26,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 18:50:26,871 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,SelfDestructingSolverStorable22 [2024-11-07 18:50:26,871 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:26,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1461092498, now seen corresponding path program 1 times [2024-11-07 18:50:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:26,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471929446] [2024-11-07 18:50:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:26,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:27,463 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 18:50:27,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471929446] [2024-11-07 18:50:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471929446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020258752] [2024-11-07 18:50:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:27,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:27,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:27,469 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 18:50:27,471 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 18:50:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:27,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 18:50:27,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:27,662 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 18:50:27,733 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:27,733 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 18:50:27,739 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 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 18:50:27,760 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 18:50:27,762 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 18:50:27,830 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 22 treesize of output 10 [2024-11-07 18:50:27,832 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 18:50:27,904 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:27,904 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 18:50:27,907 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 18:50:27,957 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:27,957 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 18:50:27,962 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 18:50:28,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:28,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 18:50:28,013 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 41 treesize of output 22 [2024-11-07 18:50:28,048 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 18:50:28,054 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 30 treesize of output 12 [2024-11-07 18:50:28,072 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 18:50:28,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:50:28,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1490))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))) (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1489))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0) (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))))) is different from false [2024-11-07 18:50:28,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1489))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1490))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0))))))) is different from false [2024-11-07 18:50:28,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1497))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1498) .cse5 v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1490))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1497))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1498) .cse8 v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))))) is different from false [2024-11-07 18:50:28,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020258752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:28,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:50:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-07 18:50:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050827234] [2024-11-07 18:50:28,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:50:28,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 18:50:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 18:50:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=660, Unknown=3, NotChecked=162, Total=930 [2024-11-07 18:50:28,348 INFO L87 Difference]: Start difference. First operand 629 states and 725 transitions. Second operand has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:50:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:30,056 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-07 18:50:30,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 18:50:30,057 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 92 [2024-11-07 18:50:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:30,059 INFO L225 Difference]: With dead ends: 631 [2024-11-07 18:50:30,059 INFO L226 Difference]: Without dead ends: 631 [2024-11-07 18:50:30,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1023, Unknown=3, NotChecked=204, Total=1406 [2024-11-07 18:50:30,060 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 515 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 3442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:30,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 3058 Invalid, 3442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3391 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 18:50:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-07 18:50:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 616. [2024-11-07 18:50:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 438 states have (on average 1.5639269406392695) internal successors, (685), 609 states have internal predecessors, (685), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 711 transitions. [2024-11-07 18:50:30,067 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 711 transitions. Word has length 92 [2024-11-07 18:50:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:30,067 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 711 transitions. [2024-11-07 18:50:30,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:50:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 711 transitions. [2024-11-07 18:50:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 18:50:30,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:30,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:30,084 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 18:50:30,273 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,SelfDestructingSolverStorable23 [2024-11-07 18:50:30,273 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:30,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1678265600, now seen corresponding path program 1 times [2024-11-07 18:50:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708632636] [2024-11-07 18:50:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:30,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:30,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:30,604 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 18:50:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708632636] [2024-11-07 18:50:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708632636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:30,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:30,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 18:50:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490003350] [2024-11-07 18:50:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:30,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 18:50:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:30,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 18:50:30,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-07 18:50:30,607 INFO L87 Difference]: Start difference. First operand 616 states and 711 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:31,558 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-07 18:50:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 18:50:31,558 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-07 18:50:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:31,560 INFO L225 Difference]: With dead ends: 635 [2024-11-07 18:50:31,562 INFO L226 Difference]: Without dead ends: 635 [2024-11-07 18:50:31,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-07 18:50:31,563 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 516 mSDsluCounter, 2931 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 3287 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:31,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 3287 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 18:50:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-07 18:50:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2024-11-07 18:50:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 452 states have (on average 1.5508849557522124) internal successors, (701), 623 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 728 transitions. [2024-11-07 18:50:31,572 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 728 transitions. Word has length 94 [2024-11-07 18:50:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:31,573 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 728 transitions. [2024-11-07 18:50:31,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 728 transitions. [2024-11-07 18:50:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 18:50:31,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:31,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:31,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 18:50:31,575 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:31,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1678265601, now seen corresponding path program 1 times [2024-11-07 18:50:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:31,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006785905] [2024-11-07 18:50:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:32,065 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 18:50:32,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:32,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006785905] [2024-11-07 18:50:32,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006785905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:32,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:32,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 18:50:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377869990] [2024-11-07 18:50:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:32,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 18:50:32,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:32,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 18:50:32,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-07 18:50:32,068 INFO L87 Difference]: Start difference. First operand 631 states and 728 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:33,451 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-07 18:50:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 18:50:33,451 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-07 18:50:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:33,453 INFO L225 Difference]: With dead ends: 634 [2024-11-07 18:50:33,453 INFO L226 Difference]: Without dead ends: 634 [2024-11-07 18:50:33,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-07 18:50:33,454 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 527 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:33,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2880 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 18:50:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-07 18:50:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-07 18:50:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 452 states have (on average 1.5486725663716814) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2024-11-07 18:50:33,459 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 94 [2024-11-07 18:50:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:33,459 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2024-11-07 18:50:33,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2024-11-07 18:50:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 18:50:33,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:33,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:33,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 18:50:33,460 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:33,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2087525925, now seen corresponding path program 1 times [2024-11-07 18:50:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155526341] [2024-11-07 18:50:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:33,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:33,849 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 18:50:33,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:33,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155526341] [2024-11-07 18:50:33,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155526341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:33,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527941956] [2024-11-07 18:50:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:33,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:33,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:33,851 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 18:50:33,852 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 18:50:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:34,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 18:50:34,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:34,024 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 18:50:34,086 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:34,086 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 18:50:34,089 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 18:50:34,163 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:34,164 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 18:50:34,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:34,194 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 18:50:34,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:34,227 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 18:50:34,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:34,262 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 18:50:34,270 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 18:50:34,272 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 18:50:34,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:50:34,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-07 18:50:34,378 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1801))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-07 18:50:34,385 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1801))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-07 18:50:34,420 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-07 18:50:34,420 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 105 treesize of output 104 [2024-11-07 18:50:34,428 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1806))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1801)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-07 18:50:34,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527941956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:34,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:50:34,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2024-11-07 18:50:34,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747255421] [2024-11-07 18:50:34,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:50:34,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 18:50:34,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:34,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 18:50:34,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=534, Unknown=35, NotChecked=204, Total=870 [2024-11-07 18:50:34,431 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 23 states, 20 states have (on average 7.25) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:50:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:35,893 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-07 18:50:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 18:50:35,893 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.25) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2024-11-07 18:50:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:35,895 INFO L225 Difference]: With dead ends: 633 [2024-11-07 18:50:35,895 INFO L226 Difference]: Without dead ends: 633 [2024-11-07 18:50:35,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=1051, Unknown=41, NotChecked=284, Total=1560 [2024-11-07 18:50:35,896 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 497 mSDsluCounter, 4508 mSDsCounter, 0 mSdLazyCounter, 3831 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 4864 SdHoareTripleChecker+Invalid, 3868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:35,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 4864 Invalid, 3868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3831 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 18:50:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-07 18:50:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-07 18:50:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 452 states have (on average 1.5464601769911503) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-07 18:50:35,901 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 95 [2024-11-07 18:50:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:35,902 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-07 18:50:35,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.25) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:50:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-07 18:50:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 18:50:35,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:35,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:35,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 18:50:36,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:36,104 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:36,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:36,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2087525926, now seen corresponding path program 1 times [2024-11-07 18:50:36,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:36,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427270130] [2024-11-07 18:50:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:36,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:36,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:36,701 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 18:50:36,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427270130] [2024-11-07 18:50:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427270130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246849596] [2024-11-07 18:50:36,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:36,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:36,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:36,704 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 18:50:36,705 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 18:50:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:36,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-07 18:50:36,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:36,886 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 18:50:36,950 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:36,950 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 18:50:36,955 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 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 18:50:36,959 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 18:50:36,962 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 18:50:36,993 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 22 treesize of output 10 [2024-11-07 18:50:36,995 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 18:50:37,062 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:37,062 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 18:50:37,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 18:50:37,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:37,113 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 18:50:37,117 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 18:50:37,175 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:37,175 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 18:50:37,178 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 18:50:37,225 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:37,225 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 18:50:37,231 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 18:50:37,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 18:50:37,246 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 18:50:37,247 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 18:50:37,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:50:37,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1978 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-07 18:50:37,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1978 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-07 18:50:37,319 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1976) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1976) .cse1 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-07 18:50:37,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1975))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1976) .cse1 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1976) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-07 18:50:37,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1974) .cse0 v_ArrVal_1976) (select (select (store .cse1 .cse0 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1978))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1975))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1974) .cse3 v_ArrVal_1976) .cse4 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-07 18:50:37,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1973))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1974) .cse1 v_ArrVal_1976) (select (select (store .cse2 .cse1 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1978))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1973))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1975))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1974) .cse4 v_ArrVal_1976) .cse5 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-07 18:50:37,409 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1973))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1984) .cse0 v_ArrVal_1974) .cse1 v_ArrVal_1976) (select (select (store .cse2 .cse1 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1978))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1973))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1975))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1984) .cse5 v_ArrVal_1974) .cse6 v_ArrVal_1976) .cse7 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-07 18:50:37,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246849596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:37,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:50:37,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 20 [2024-11-07 18:50:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161870612] [2024-11-07 18:50:37,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:50:37,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 18:50:37,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:37,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 18:50:37,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=439, Unknown=7, NotChecked=336, Total=870 [2024-11-07 18:50:37,412 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 21 states, 19 states have (on average 7.526315789473684) internal successors, (143), 20 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:50:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:38,724 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-07 18:50:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 18:50:38,724 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.526315789473684) internal successors, (143), 20 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-11-07 18:50:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:38,726 INFO L225 Difference]: With dead ends: 632 [2024-11-07 18:50:38,726 INFO L226 Difference]: Without dead ends: 632 [2024-11-07 18:50:38,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=917, Unknown=7, NotChecked=476, Total=1560 [2024-11-07 18:50:38,728 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 498 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:38,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2282 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 18:50:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-07 18:50:38,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 614. [2024-11-07 18:50:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 438 states have (on average 1.5593607305936072) internal successors, (683), 607 states have internal predecessors, (683), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 709 transitions. [2024-11-07 18:50:38,735 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 709 transitions. Word has length 95 [2024-11-07 18:50:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:38,735 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 709 transitions. [2024-11-07 18:50:38,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.526315789473684) internal successors, (143), 20 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:50:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 709 transitions. [2024-11-07 18:50:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 18:50:38,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:38,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:38,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-07 18:50:38,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-07 18:50:38,939 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:38,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:38,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1581366978, now seen corresponding path program 1 times [2024-11-07 18:50:38,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:38,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57754109] [2024-11-07 18:50:38,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:39,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:39,372 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 18:50:39,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:39,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57754109] [2024-11-07 18:50:39,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57754109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:39,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:39,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 18:50:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035047571] [2024-11-07 18:50:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:39,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 18:50:39,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:39,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 18:50:39,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-07 18:50:39,373 INFO L87 Difference]: Start difference. First operand 614 states and 709 transitions. Second operand has 15 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:40,542 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-07 18:50:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 18:50:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-07 18:50:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:40,543 INFO L225 Difference]: With dead ends: 637 [2024-11-07 18:50:40,543 INFO L226 Difference]: Without dead ends: 637 [2024-11-07 18:50:40,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-07 18:50:40,544 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 511 mSDsluCounter, 3208 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:40,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 3566 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2846 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 18:50:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-07 18:50:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2024-11-07 18:50:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 456 states have (on average 1.5416666666666667) internal successors, (703), 625 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 730 transitions. [2024-11-07 18:50:40,551 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 730 transitions. Word has length 98 [2024-11-07 18:50:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:40,552 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 730 transitions. [2024-11-07 18:50:40,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 730 transitions. [2024-11-07 18:50:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 18:50:40,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:40,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:40,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 18:50:40,552 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:40,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:40,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1581366979, now seen corresponding path program 1 times [2024-11-07 18:50:40,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:40,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770230152] [2024-11-07 18:50:40,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:41,241 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 18:50:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770230152] [2024-11-07 18:50:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770230152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:41,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:41,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 18:50:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313408188] [2024-11-07 18:50:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:41,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 18:50:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:41,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 18:50:41,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-07 18:50:41,242 INFO L87 Difference]: Start difference. First operand 633 states and 730 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:42,768 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-07 18:50:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 18:50:42,769 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-07 18:50:42,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:42,770 INFO L225 Difference]: With dead ends: 636 [2024-11-07 18:50:42,770 INFO L226 Difference]: Without dead ends: 636 [2024-11-07 18:50:42,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-07 18:50:42,771 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 510 mSDsluCounter, 2454 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:42,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 2809 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 18:50:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-07 18:50:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-11-07 18:50:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 456 states have (on average 1.5394736842105263) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2024-11-07 18:50:42,779 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 98 [2024-11-07 18:50:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:42,780 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2024-11-07 18:50:42,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2024-11-07 18:50:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 18:50:42,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:42,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:42,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 18:50:42,781 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:42,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 668956007, now seen corresponding path program 1 times [2024-11-07 18:50:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:42,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601521530] [2024-11-07 18:50:42,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:42,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:43,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:43,292 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 18:50:43,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601521530] [2024-11-07 18:50:43,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601521530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000448470] [2024-11-07 18:50:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:43,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:43,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:43,294 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 18:50:43,295 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 18:50:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:43,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 18:50:43,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:43,486 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 18:50:43,547 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:43,547 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 18:50:43,560 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 18:50:43,630 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:43,630 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 18:50:43,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:43,661 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 18:50:43,693 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:43,693 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 18:50:43,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:43,725 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 18:50:43,757 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:43,758 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 18:50:43,764 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 18:50:43,775 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-07 18:50:43,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-07 18:50:43,777 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 18:50:43,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:50:44,233 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-07 18:50:44,234 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 597 treesize of output 794 [2024-11-07 18:50:44,247 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2326 (Array Int Int)) (v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2326))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2319)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2320)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2321)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-07 18:50:44,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000448470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:44,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:50:44,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2024-11-07 18:50:44,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390504050] [2024-11-07 18:50:44,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:50:44,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 18:50:44,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:44,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 18:50:44,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1050, Unknown=44, NotChecked=68, Total=1332 [2024-11-07 18:50:44,250 INFO L87 Difference]: Start difference. First operand 633 states and 729 transitions. Second operand has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:50:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:45,480 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-07 18:50:45,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 18:50:45,481 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-07 18:50:45,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:45,482 INFO L225 Difference]: With dead ends: 635 [2024-11-07 18:50:45,482 INFO L226 Difference]: Without dead ends: 635 [2024-11-07 18:50:45,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1659, Unknown=44, NotChecked=86, Total=2070 [2024-11-07 18:50:45,483 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 506 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 3257 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:45,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 3257 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 18:50:45,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-07 18:50:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2024-11-07 18:50:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 456 states have (on average 1.537280701754386) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2024-11-07 18:50:45,489 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 99 [2024-11-07 18:50:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:45,490 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2024-11-07 18:50:45,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:50:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2024-11-07 18:50:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 18:50:45,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:45,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:45,505 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 18:50:45,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:45,696 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:45,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash 668956008, now seen corresponding path program 1 times [2024-11-07 18:50:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67707680] [2024-11-07 18:50:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:46,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:46,400 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 18:50:46,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:46,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67707680] [2024-11-07 18:50:46,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67707680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:46,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431261825] [2024-11-07 18:50:46,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:46,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:46,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:46,402 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 18:50:46,403 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 18:50:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:46,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-07 18:50:46,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:46,607 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 18:50:46,675 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:46,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 18:50:46,680 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 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 18:50:46,701 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 18:50:46,704 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 18:50:46,763 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 22 treesize of output 10 [2024-11-07 18:50:46,766 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 18:50:46,873 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:46,873 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 73 treesize of output 66 [2024-11-07 18:50:46,879 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 18:50:46,967 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:46,968 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 73 treesize of output 66 [2024-11-07 18:50:46,971 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 18:50:47,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:47,038 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 73 treesize of output 66 [2024-11-07 18:50:47,041 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 18:50:47,110 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:47,110 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 73 treesize of output 66 [2024-11-07 18:50:47,113 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 18:50:47,180 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:50:47,180 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 73 treesize of output 66 [2024-11-07 18:50:47,183 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 18:50:47,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-07 18:50:47,205 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 18:50:47,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:50:47,246 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-07 18:50:47,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-07 18:50:47,253 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:50:47,253 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 18:50:47,275 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 18:50:47,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:50:51,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 18:50:51,076 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 604 treesize of output 622 [2024-11-07 18:50:51,965 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|) (forall ((v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2523 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2511 (Array Int Int)) (v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2509 (Array Int Int)) (v_ArrVal_2517 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2522))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2510))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2511))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2513))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2523) .cse0 v_ArrVal_2509) .cse1 v_ArrVal_2512) .cse2 v_ArrVal_2514) .cse3 v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2517) (select (select (store .cse5 .cse3 v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_26))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_28))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_27))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_24) .cse9 v_prenex_30) .cse10 v_prenex_25) .cse11 v_prenex_22) (select (select (store .cse12 .cse11 v_prenex_23) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_21))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-07 18:50:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431261825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:50:51,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:50:51,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-07 18:50:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192689336] [2024-11-07 18:50:51,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:50:51,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-07 18:50:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:51,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-07 18:50:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1544, Unknown=72, NotChecked=82, Total=1892 [2024-11-07 18:50:51,974 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 32 states, 29 states have (on average 5.551724137931035) internal successors, (161), 30 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:50:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:55,745 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-07 18:50:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 18:50:55,745 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.551724137931035) internal successors, (161), 30 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-07 18:50:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:55,747 INFO L225 Difference]: With dead ends: 634 [2024-11-07 18:50:55,747 INFO L226 Difference]: Without dead ends: 634 [2024-11-07 18:50:55,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=356, Invalid=2655, Unknown=73, NotChecked=108, Total=3192 [2024-11-07 18:50:55,748 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 504 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 4293 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 4328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 4293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:55,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 3900 Invalid, 4328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 4293 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-07 18:50:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-07 18:50:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 612. [2024-11-07 18:50:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 438 states have (on average 1.5547945205479452) internal successors, (681), 605 states have internal predecessors, (681), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:50:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 707 transitions. [2024-11-07 18:50:55,755 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 707 transitions. Word has length 99 [2024-11-07 18:50:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:55,755 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 707 transitions. [2024-11-07 18:50:55,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.551724137931035) internal successors, (161), 30 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:50:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 707 transitions. [2024-11-07 18:50:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 18:50:55,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:55,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:55,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-07 18:50:55,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:50:55,960 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:55,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash -991994657, now seen corresponding path program 1 times [2024-11-07 18:50:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493778783] [2024-11-07 18:50:55,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:55,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:56,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:56,436 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 18:50:56,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493778783] [2024-11-07 18:50:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493778783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:56,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 18:50:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975478504] [2024-11-07 18:50:56,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:56,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 18:50:56,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:56,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 18:50:56,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-07 18:50:56,442 INFO L87 Difference]: Start difference. First operand 612 states and 707 transitions. Second operand has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:58,131 INFO L93 Difference]: Finished difference Result 638 states and 736 transitions. [2024-11-07 18:50:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 18:50:58,131 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-07 18:50:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:58,133 INFO L225 Difference]: With dead ends: 638 [2024-11-07 18:50:58,133 INFO L226 Difference]: Without dead ends: 638 [2024-11-07 18:50:58,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-07 18:50:58,134 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 513 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:58,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 2991 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 18:50:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-07 18:50:58,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 634. [2024-11-07 18:50:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 459 states have (on average 1.5337690631808278) internal successors, (704), 626 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:50:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 731 transitions. [2024-11-07 18:50:58,139 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 731 transitions. Word has length 101 [2024-11-07 18:50:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:58,139 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 731 transitions. [2024-11-07 18:50:58,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:50:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 731 transitions. [2024-11-07 18:50:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 18:50:58,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:58,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:58,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 18:50:58,140 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:50:58,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash -991994656, now seen corresponding path program 1 times [2024-11-07 18:50:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:50:58,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028074841] [2024-11-07 18:50:58,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:50:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:59,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:50:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:59,060 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 18:50:59,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:50:59,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028074841] [2024-11-07 18:50:59,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028074841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:59,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:59,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 18:50:59,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315066276] [2024-11-07 18:50:59,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:59,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 18:50:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:50:59,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 18:50:59,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-07 18:50:59,062 INFO L87 Difference]: Start difference. First operand 634 states and 731 transitions. Second operand has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:51:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:01,502 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-07 18:51:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 18:51:01,502 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-07 18:51:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:01,504 INFO L225 Difference]: With dead ends: 637 [2024-11-07 18:51:01,504 INFO L226 Difference]: Without dead ends: 637 [2024-11-07 18:51:01,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-07 18:51:01,505 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 510 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 3076 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:01,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 2806 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3076 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 18:51:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-07 18:51:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 634. [2024-11-07 18:51:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 459 states have (on average 1.5315904139433552) internal successors, (703), 626 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:51:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 730 transitions. [2024-11-07 18:51:01,511 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 730 transitions. Word has length 101 [2024-11-07 18:51:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:01,512 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 730 transitions. [2024-11-07 18:51:01,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:51:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 730 transitions. [2024-11-07 18:51:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 18:51:01,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:01,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:01,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 18:51:01,513 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:51:01,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash 220784666, now seen corresponding path program 1 times [2024-11-07 18:51:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:01,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775464336] [2024-11-07 18:51:01,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:02,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:51:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:02,177 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 18:51:02,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775464336] [2024-11-07 18:51:02,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775464336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:51:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502472838] [2024-11-07 18:51:02,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:02,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:51:02,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:51:02,180 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 18:51:02,181 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 18:51:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:02,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 18:51:02,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:02,411 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 18:51:02,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:51:02,503 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 18:51:02,508 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 18:51:02,552 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:02,552 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 31 treesize of output 32 [2024-11-07 18:51:02,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:02,596 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 31 treesize of output 32 [2024-11-07 18:51:02,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:02,644 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 31 treesize of output 32 [2024-11-07 18:51:02,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:02,687 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 31 treesize of output 32 [2024-11-07 18:51:02,730 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:02,731 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 31 treesize of output 32 [2024-11-07 18:51:02,771 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:02,771 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 18:51:02,806 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 18:51:02,809 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 18:51:02,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:51:02,823 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-07 18:51:02,823 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 18:51:02,871 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2886 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-07 18:51:02,921 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2886 (Array Int Int)) (v_ArrVal_2885 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2885))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-07 18:51:02,930 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2886 (Array Int Int)) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2884))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2885)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-07 18:51:02,936 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2886 (Array Int Int)) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2885)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-07 18:51:02,946 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2886 (Array Int Int)) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2883))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2885)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-07 18:51:02,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2886 (Array Int Int)) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2883))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2885)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-07 18:51:02,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2886 (Array Int Int)) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2882))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2883)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2885)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-07 18:51:02,976 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2886 (Array Int Int)) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2882))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2883)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2885)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-07 18:51:03,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2889 (Array Int Int)) (v_ArrVal_2886 (Array Int Int)) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2889))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2882)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2883)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2885)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-07 18:51:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502472838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:51:03,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:51:03,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 22 [2024-11-07 18:51:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315859466] [2024-11-07 18:51:03,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:51:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 18:51:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 18:51:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 18:51:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=523, Unknown=24, NotChecked=486, Total=1122 [2024-11-07 18:51:03,011 INFO L87 Difference]: Start difference. First operand 634 states and 730 transitions. Second operand has 23 states, 21 states have (on average 7.095238095238095) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:51:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:05,009 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-07 18:51:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 18:51:05,010 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 7.095238095238095) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-07 18:51:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:05,011 INFO L225 Difference]: With dead ends: 636 [2024-11-07 18:51:05,011 INFO L226 Difference]: Without dead ends: 636 [2024-11-07 18:51:05,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=1034, Unknown=25, NotChecked=666, Total=1892 [2024-11-07 18:51:05,012 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 511 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 2839 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:05,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 3619 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2839 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 18:51:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-07 18:51:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-11-07 18:51:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 459 states have (on average 1.5294117647058822) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-07 18:51:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2024-11-07 18:51:05,018 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 102 [2024-11-07 18:51:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:05,018 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2024-11-07 18:51:05,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 7.095238095238095) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:51:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2024-11-07 18:51:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 18:51:05,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:05,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:05,034 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 18:51:05,220 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,SelfDestructingSolverStorable34 [2024-11-07 18:51:05,220 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-07 18:51:05,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash 220784667, now seen corresponding path program 1 times [2024-11-07 18:51:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 18:51:05,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143071894] [2024-11-07 18:51:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 18:51:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:06,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 18:51:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:06,247 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 18:51:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 18:51:06,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143071894] [2024-11-07 18:51:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143071894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:51:06,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778058501] [2024-11-07 18:51:06,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:06,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 18:51:06,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:51:06,250 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 18:51:06,252 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 18:51:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:06,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-07 18:51:06,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:06,520 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 18:51:06,618 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 18:51:06,619 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 18:51:06,626 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 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 18:51:06,652 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 18:51:06,655 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 18:51:06,737 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 22 treesize of output 10 [2024-11-07 18:51:06,742 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 18:51:06,894 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:06,895 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 73 treesize of output 66 [2024-11-07 18:51:06,899 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 18:51:07,017 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:07,018 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 73 treesize of output 66 [2024-11-07 18:51:07,022 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 18:51:07,101 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:07,101 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 73 treesize of output 66 [2024-11-07 18:51:07,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 18:51:07,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:07,211 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 73 treesize of output 66 [2024-11-07 18:51:07,215 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 18:51:07,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:07,301 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 73 treesize of output 66 [2024-11-07 18:51:07,304 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 18:51:07,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:51:07,398 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-07 18:51:07,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-07 18:51:07,420 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-07 18:51:07,420 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 17 treesize of output 17 [2024-11-07 18:51:07,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:51:07,481 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 18:51:07,484 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 18:51:07,497 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 18:51:07,500 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 18:51:07,505 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 18:51:07,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:51:09,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (forall ((v_ArrVal_3092 Int) (v_ArrVal_3093 (Array Int Int)) (v_ArrVal_3094 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3086))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3089))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_3091))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3087) .cse0 v_ArrVal_3088) .cse1 v_ArrVal_3090) .cse2 v_ArrVal_3094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3092) (select (select (store .cse4 .cse2 v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (or (forall ((v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3094 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3086))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3089))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3087) .cse7 v_ArrVal_3088) .cse8 v_ArrVal_3090) (select (select (store .cse9 .cse8 v_ArrVal_3091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3094))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)))))) is different from false