./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:31:03,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:31:03,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:31:03,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:31:03,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:31:03,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:31:03,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:31:03,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:31:03,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:31:03,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:31:03,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:31:03,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:31:03,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:31:03,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:31:03,436 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:31:03,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:31:03,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:31:03,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:31:03,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:31:03,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:31:03,437 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:31:03,438 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:31:03,438 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:31:03,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:31:03,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:31:03,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:31:03,439 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:31:03,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:31:03,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:31:03,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:31:03,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:31:03,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:31:03,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:31:03,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:31:03,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:31:03,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:31:03,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:31:03,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:31:03,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:31:03,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:31:03,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:31:03,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:31:03,443 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2024-11-10 17:31:03,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:31:03,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:31:03,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:31:03,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:31:03,675 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:31:03,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-11-10 17:31:04,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:31:05,216 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:31:05,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-11-10 17:31:05,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661fb2197/50f27a0b61d4410a9ecc9fcddff9f4c1/FLAG82af372c3 [2024-11-10 17:31:05,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661fb2197/50f27a0b61d4410a9ecc9fcddff9f4c1 [2024-11-10 17:31:05,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:31:05,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:31:05,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:31:05,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:31:05,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:31:05,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:05,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36083420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05, skipping insertion in model container [2024-11-10 17:31:05,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:05,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:31:05,706 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:31:05,740 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:31:05,746 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:31:05,750 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:31:05,757 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:31:05,794 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:31:05,794 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:31:05,796 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:31:05,796 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:31:05,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:31:05,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:31:05,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:31:05,936 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:31:05,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05 WrapperNode [2024-11-10 17:31:05,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:31:05,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:31:05,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:31:05,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:31:05,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:05,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,025 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1282 [2024-11-10 17:31:06,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:31:06,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:31:06,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:31:06,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:31:06,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,100 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-10 17:31:06,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:31:06,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:31:06,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:31:06,151 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:31:06,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (1/1) ... [2024-11-10 17:31:06,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:31:06,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:31:06,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:31:06,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:31:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 17:31:06,219 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 17:31:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:31:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:31:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:31:06,220 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:31:06,220 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:31:06,220 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:31:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:31:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:31:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:31:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:31:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:31:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 17:31:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 17:31:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 17:31:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:31:06,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:31:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 17:31:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 17:31:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 17:31:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:31:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:31:06,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:31:06,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:31:06,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:31:06,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:31:06,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 17:31:06,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 17:31:06,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:31:06,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:31:06,386 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:31:06,388 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:31:07,906 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-10 17:31:08,014 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2024-11-10 17:31:08,015 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:31:08,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:31:08,077 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 17:31:08,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:31:08 BoogieIcfgContainer [2024-11-10 17:31:08,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:31:08,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:31:08,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:31:08,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:31:08,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:31:05" (1/3) ... [2024-11-10 17:31:08,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb6740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:31:08, skipping insertion in model container [2024-11-10 17:31:08,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:05" (2/3) ... [2024-11-10 17:31:08,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb6740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:31:08, skipping insertion in model container [2024-11-10 17:31:08,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:31:08" (3/3) ... [2024-11-10 17:31:08,084 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-1.i [2024-11-10 17:31:08,101 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:31:08,102 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-11-10 17:31:08,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:31:08,170 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;@35f2bff9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:31:08,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-10 17:31:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 1096 states, 661 states have (on average 1.9818456883509834) internal successors, (1310), 1089 states have internal predecessors, (1310), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 17:31:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:31:08,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:08,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:31:08,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:08,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:08,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1401090, now seen corresponding path program 1 times [2024-11-10 17:31:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:08,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517404528] [2024-11-10 17:31:08,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:08,371 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-10 17:31:08,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517404528] [2024-11-10 17:31:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517404528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:08,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:08,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:31:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037946081] [2024-11-10 17:31:08,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:08,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:31:08,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:08,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:31:08,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:08,407 INFO L87 Difference]: Start difference. First operand has 1096 states, 661 states have (on average 1.9818456883509834) internal successors, (1310), 1089 states have internal predecessors, (1310), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-10 17:31:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:09,020 INFO L93 Difference]: Finished difference Result 1081 states and 1255 transitions. [2024-11-10 17:31:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-10 17:31:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:09,041 INFO L225 Difference]: With dead ends: 1081 [2024-11-10 17:31:09,042 INFO L226 Difference]: Without dead ends: 1078 [2024-11-10 17:31:09,043 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-10 17:31:09,048 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 1118 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:09,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 877 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 17:31:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-11-10 17:31:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2024-11-10 17:31:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 661 states have (on average 1.8668683812405447) internal successors, (1234), 1071 states have internal predecessors, (1234), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:31:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1252 transitions. [2024-11-10 17:31:09,141 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1252 transitions. Word has length 3 [2024-11-10 17:31:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:09,141 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1252 transitions. [2024-11-10 17:31:09,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-10 17:31:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1252 transitions. [2024-11-10 17:31:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:31:09,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:09,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:31:09,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:31:09,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:09,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:09,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1401091, now seen corresponding path program 1 times [2024-11-10 17:31:09,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:09,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631818296] [2024-11-10 17:31:09,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:09,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:09,231 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-10 17:31:09,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:09,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631818296] [2024-11-10 17:31:09,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631818296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:09,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:09,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:31:09,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059013904] [2024-11-10 17:31:09,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:09,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:31:09,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:09,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:31:09,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:09,234 INFO L87 Difference]: Start difference. First operand 1078 states and 1252 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-10 17:31:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:10,030 INFO L93 Difference]: Finished difference Result 1865 states and 2201 transitions. [2024-11-10 17:31:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:10,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-10 17:31:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:10,036 INFO L225 Difference]: With dead ends: 1865 [2024-11-10 17:31:10,036 INFO L226 Difference]: Without dead ends: 1865 [2024-11-10 17:31:10,036 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-10 17:31:10,037 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 931 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:10,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1698 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 17:31:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2024-11-10 17:31:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1601. [2024-11-10 17:31:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1180 states have (on average 1.8296610169491525) internal successors, (2159), 1592 states have internal predecessors, (2159), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:31:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2191 transitions. [2024-11-10 17:31:10,065 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2191 transitions. Word has length 3 [2024-11-10 17:31:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:10,065 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2191 transitions. [2024-11-10 17:31:10,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-10 17:31:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2191 transitions. [2024-11-10 17:31:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:31:10,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:10,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:10,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:31:10,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:10,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -972013480, now seen corresponding path program 1 times [2024-11-10 17:31:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:10,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914572464] [2024-11-10 17:31:10,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:10,154 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-10 17:31:10,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:10,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914572464] [2024-11-10 17:31:10,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914572464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:10,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:10,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:31:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379600864] [2024-11-10 17:31:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:10,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:31:10,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:10,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:31:10,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:10,157 INFO L87 Difference]: Start difference. First operand 1601 states and 2191 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:10,740 INFO L93 Difference]: Finished difference Result 1882 states and 2536 transitions. [2024-11-10 17:31:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 17:31:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:10,748 INFO L225 Difference]: With dead ends: 1882 [2024-11-10 17:31:10,748 INFO L226 Difference]: Without dead ends: 1882 [2024-11-10 17:31:10,748 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-10 17:31:10,749 INFO L432 NwaCegarLoop]: 1142 mSDtfsCounter, 1103 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:10,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1457 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 17:31:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2024-11-10 17:31:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1554. [2024-11-10 17:31:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1180 states have (on average 1.769491525423729) internal successors, (2088), 1545 states have internal predecessors, (2088), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:31:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2120 transitions. [2024-11-10 17:31:10,777 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2120 transitions. Word has length 9 [2024-11-10 17:31:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:10,777 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2120 transitions. [2024-11-10 17:31:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2120 transitions. [2024-11-10 17:31:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:31:10,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:10,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:10,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:31:10,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:10,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash -972013479, now seen corresponding path program 1 times [2024-11-10 17:31:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:10,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026720923] [2024-11-10 17:31:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:10,878 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-10 17:31:10,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026720923] [2024-11-10 17:31:10,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026720923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:10,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:10,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:31:10,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967261942] [2024-11-10 17:31:10,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:10,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:31:10,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:10,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:31:10,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:10,881 INFO L87 Difference]: Start difference. First operand 1554 states and 2120 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:11,490 INFO L93 Difference]: Finished difference Result 2111 states and 2913 transitions. [2024-11-10 17:31:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:11,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 17:31:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:11,497 INFO L225 Difference]: With dead ends: 2111 [2024-11-10 17:31:11,497 INFO L226 Difference]: Without dead ends: 2111 [2024-11-10 17:31:11,497 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-10 17:31:11,498 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 892 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:11,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1706 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:31:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2024-11-10 17:31:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1529. [2024-11-10 17:31:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1180 states have (on average 1.7279661016949153) internal successors, (2039), 1520 states have internal predecessors, (2039), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:31:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2071 transitions. [2024-11-10 17:31:11,543 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2071 transitions. Word has length 9 [2024-11-10 17:31:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:11,543 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2071 transitions. [2024-11-10 17:31:11,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2071 transitions. [2024-11-10 17:31:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:31:11,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:11,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:11,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:31:11,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:11,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:11,545 INFO L85 PathProgramCache]: Analyzing trace with hash 63560258, now seen corresponding path program 1 times [2024-11-10 17:31:11,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:11,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952022570] [2024-11-10 17:31:11,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:11,626 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-10 17:31:11,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952022570] [2024-11-10 17:31:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952022570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:11,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:31:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028141824] [2024-11-10 17:31:11,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:11,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:11,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:11,631 INFO L87 Difference]: Start difference. First operand 1529 states and 2071 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-10 17:31:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:11,899 INFO L93 Difference]: Finished difference Result 2737 states and 3633 transitions. [2024-11-10 17:31:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:31:11,900 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-10 17:31:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:11,908 INFO L225 Difference]: With dead ends: 2737 [2024-11-10 17:31:11,908 INFO L226 Difference]: Without dead ends: 2737 [2024-11-10 17:31:11,909 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-10 17:31:11,910 INFO L432 NwaCegarLoop]: 1319 mSDtfsCounter, 1116 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:11,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 3705 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:31:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2024-11-10 17:31:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 1532. [2024-11-10 17:31:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1183 states have (on average 1.7261200338123415) internal successors, (2042), 1523 states have internal predecessors, (2042), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:31:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2074 transitions. [2024-11-10 17:31:11,945 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2074 transitions. Word has length 13 [2024-11-10 17:31:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:11,946 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 2074 transitions. [2024-11-10 17:31:11,946 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-10 17:31:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2074 transitions. [2024-11-10 17:31:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 17:31:11,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:11,948 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] [2024-11-10 17:31:11,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:31:11,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1457343219, now seen corresponding path program 1 times [2024-11-10 17:31:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:11,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169840950] [2024-11-10 17:31:11,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:12,023 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-10 17:31:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:12,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169840950] [2024-11-10 17:31:12,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169840950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:12,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:12,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:31:12,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172794271] [2024-11-10 17:31:12,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:12,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:12,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:12,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:12,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:12,026 INFO L87 Difference]: Start difference. First operand 1532 states and 2074 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:12,609 INFO L93 Difference]: Finished difference Result 1607 states and 2180 transitions. [2024-11-10 17:31:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:31:12,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-10 17:31:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:12,615 INFO L225 Difference]: With dead ends: 1607 [2024-11-10 17:31:12,615 INFO L226 Difference]: Without dead ends: 1607 [2024-11-10 17:31:12,616 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-10 17:31:12,617 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 1368 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:12,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1322 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 17:31:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-10 17:31:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1509. [2024-11-10 17:31:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1183 states have (on average 1.687235841081995) internal successors, (1996), 1500 states have internal predecessors, (1996), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:31:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2028 transitions. [2024-11-10 17:31:12,641 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2028 transitions. Word has length 20 [2024-11-10 17:31:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:12,641 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2028 transitions. [2024-11-10 17:31:12,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2028 transitions. [2024-11-10 17:31:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 17:31:12,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:12,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] [2024-11-10 17:31:12,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:31:12,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:12,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1457343218, now seen corresponding path program 1 times [2024-11-10 17:31:12,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:12,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859867948] [2024-11-10 17:31:12,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:12,694 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-10 17:31:12,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:12,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859867948] [2024-11-10 17:31:12,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859867948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:12,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:12,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:31:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405558937] [2024-11-10 17:31:12,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:12,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:31:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:12,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:31:12,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:12,695 INFO L87 Difference]: Start difference. First operand 1509 states and 2028 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:12,756 INFO L93 Difference]: Finished difference Result 1371 states and 1822 transitions. [2024-11-10 17:31:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:12,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-10 17:31:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:12,761 INFO L225 Difference]: With dead ends: 1371 [2024-11-10 17:31:12,761 INFO L226 Difference]: Without dead ends: 1371 [2024-11-10 17:31:12,761 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-10 17:31:12,762 INFO L432 NwaCegarLoop]: 1000 mSDtfsCounter, 61 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:12,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1946 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:31:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2024-11-10 17:31:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2024-11-10 17:31:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1057 states have (on average 1.6934720908230843) internal successors, (1790), 1362 states have internal predecessors, (1790), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:31:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1822 transitions. [2024-11-10 17:31:12,793 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1822 transitions. Word has length 20 [2024-11-10 17:31:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:12,793 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1822 transitions. [2024-11-10 17:31:12,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1822 transitions. [2024-11-10 17:31:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 17:31:12,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:12,795 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] [2024-11-10 17:31:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:31:12,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash -347605167, now seen corresponding path program 1 times [2024-11-10 17:31:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169039482] [2024-11-10 17:31:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:12,848 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-10 17:31:12,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169039482] [2024-11-10 17:31:12,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169039482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:12,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:12,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:31:12,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131811695] [2024-11-10 17:31:12,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:12,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:12,851 INFO L87 Difference]: Start difference. First operand 1371 states and 1822 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:12,959 INFO L93 Difference]: Finished difference Result 1342 states and 1772 transitions. [2024-11-10 17:31:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:31:12,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 17:31:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:12,964 INFO L225 Difference]: With dead ends: 1342 [2024-11-10 17:31:12,964 INFO L226 Difference]: Without dead ends: 1342 [2024-11-10 17:31:12,965 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-10 17:31:12,966 INFO L432 NwaCegarLoop]: 965 mSDtfsCounter, 41 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:12,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2866 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:31:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-11-10 17:31:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1336. [2024-11-10 17:31:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1029 states have (on average 1.685131195335277) internal successors, (1734), 1327 states have internal predecessors, (1734), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:31:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1766 transitions. [2024-11-10 17:31:12,990 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1766 transitions. Word has length 22 [2024-11-10 17:31:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:12,990 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1766 transitions. [2024-11-10 17:31:12,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1766 transitions. [2024-11-10 17:31:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 17:31:12,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:12,993 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] [2024-11-10 17:31:12,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:31:12,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:12,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 341081511, now seen corresponding path program 1 times [2024-11-10 17:31:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:12,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662237852] [2024-11-10 17:31:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:13,112 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-10 17:31:13,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662237852] [2024-11-10 17:31:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662237852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:13,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:13,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:31:13,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671618327] [2024-11-10 17:31:13,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:13,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:13,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:13,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:13,115 INFO L87 Difference]: Start difference. First operand 1336 states and 1766 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:13,819 INFO L93 Difference]: Finished difference Result 2151 states and 2936 transitions. [2024-11-10 17:31:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:31:13,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-10 17:31:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:13,825 INFO L225 Difference]: With dead ends: 2151 [2024-11-10 17:31:13,825 INFO L226 Difference]: Without dead ends: 2151 [2024-11-10 17:31:13,825 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-10 17:31:13,826 INFO L432 NwaCegarLoop]: 804 mSDtfsCounter, 841 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:13,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1886 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 17:31:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2024-11-10 17:31:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1332. [2024-11-10 17:31:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1029 states have (on average 1.6773566569484937) internal successors, (1726), 1323 states have internal predecessors, (1726), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:31:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1758 transitions. [2024-11-10 17:31:13,851 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1758 transitions. Word has length 36 [2024-11-10 17:31:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:13,851 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1758 transitions. [2024-11-10 17:31:13,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1758 transitions. [2024-11-10 17:31:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 17:31:13,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:13,853 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] [2024-11-10 17:31:13,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:31:13,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:13,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1838242583, now seen corresponding path program 1 times [2024-11-10 17:31:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:13,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467453181] [2024-11-10 17:31:13,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:13,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:13,951 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-10 17:31:13,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:13,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467453181] [2024-11-10 17:31:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467453181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:13,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:13,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:31:13,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755241717] [2024-11-10 17:31:13,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:13,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:13,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:13,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:13,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:13,954 INFO L87 Difference]: Start difference. First operand 1332 states and 1758 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:14,055 INFO L93 Difference]: Finished difference Result 1332 states and 1750 transitions. [2024-11-10 17:31:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:31:14,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 17:31:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:14,059 INFO L225 Difference]: With dead ends: 1332 [2024-11-10 17:31:14,059 INFO L226 Difference]: Without dead ends: 1332 [2024-11-10 17:31:14,060 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-10 17:31:14,060 INFO L432 NwaCegarLoop]: 960 mSDtfsCounter, 21 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:14,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2848 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:31:14,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2024-11-10 17:31:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2024-11-10 17:31:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1029 states have (on average 1.6695821185617103) internal successors, (1718), 1323 states have internal predecessors, (1718), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:31:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1750 transitions. [2024-11-10 17:31:14,076 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1750 transitions. Word has length 71 [2024-11-10 17:31:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:14,077 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1750 transitions. [2024-11-10 17:31:14,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1750 transitions. [2024-11-10 17:31:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 17:31:14,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:14,078 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] [2024-11-10 17:31:14,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:31:14,078 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:14,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:14,078 INFO L85 PathProgramCache]: Analyzing trace with hash 857820833, now seen corresponding path program 1 times [2024-11-10 17:31:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:14,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500757644] [2024-11-10 17:31:14,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:14,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:14,197 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-10 17:31:14,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:14,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500757644] [2024-11-10 17:31:14,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500757644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:14,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:14,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:31:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789889817] [2024-11-10 17:31:14,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:14,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:31:14,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:14,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:31:14,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:14,199 INFO L87 Difference]: Start difference. First operand 1332 states and 1750 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:14,311 INFO L93 Difference]: Finished difference Result 1869 states and 2519 transitions. [2024-11-10 17:31:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-10 17:31:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:14,318 INFO L225 Difference]: With dead ends: 1869 [2024-11-10 17:31:14,318 INFO L226 Difference]: Without dead ends: 1869 [2024-11-10 17:31:14,319 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-10 17:31:14,319 INFO L432 NwaCegarLoop]: 1242 mSDtfsCounter, 367 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:14,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 2172 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:31:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2024-11-10 17:31:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1811. [2024-11-10 17:31:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1498 states have (on average 1.644192256341789) internal successors, (2463), 1802 states have internal predecessors, (2463), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:31:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2515 transitions. [2024-11-10 17:31:14,345 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2515 transitions. Word has length 79 [2024-11-10 17:31:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:14,345 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2515 transitions. [2024-11-10 17:31:14,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2515 transitions. [2024-11-10 17:31:14,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 17:31:14,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:14,348 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] [2024-11-10 17:31:14,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:31:14,348 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:14,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1385662764, now seen corresponding path program 1 times [2024-11-10 17:31:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:14,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399269368] [2024-11-10 17:31:14,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:14,559 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-10 17:31:14,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:14,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399269368] [2024-11-10 17:31:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399269368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:14,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:14,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:31:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169285197] [2024-11-10 17:31:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:14,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:31:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:14,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:31:14,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:31:14,560 INFO L87 Difference]: Start difference. First operand 1811 states and 2515 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:15,200 INFO L93 Difference]: Finished difference Result 1810 states and 2513 transitions. [2024-11-10 17:31:15,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:31:15,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-10 17:31:15,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:15,211 INFO L225 Difference]: With dead ends: 1810 [2024-11-10 17:31:15,211 INFO L226 Difference]: Without dead ends: 1810 [2024-11-10 17:31:15,211 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-10 17:31:15,211 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 2 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:15,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2890 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:31:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-10 17:31:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2024-11-10 17:31:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1498 states have (on average 1.6428571428571428) internal successors, (2461), 1801 states have internal predecessors, (2461), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:31:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2513 transitions. [2024-11-10 17:31:15,242 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2513 transitions. Word has length 87 [2024-11-10 17:31:15,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:15,243 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2513 transitions. [2024-11-10 17:31:15,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2513 transitions. [2024-11-10 17:31:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 17:31:15,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:15,244 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] [2024-11-10 17:31:15,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 17:31:15,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:15,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1385662765, now seen corresponding path program 1 times [2024-11-10 17:31:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919311526] [2024-11-10 17:31:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:15,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:15,588 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-10 17:31:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:15,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919311526] [2024-11-10 17:31:15,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919311526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:15,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:15,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:31:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621366225] [2024-11-10 17:31:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:15,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:31:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:31:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:31:15,590 INFO L87 Difference]: Start difference. First operand 1810 states and 2513 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:16,236 INFO L93 Difference]: Finished difference Result 1809 states and 2511 transitions. [2024-11-10 17:31:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:31:16,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-10 17:31:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:16,241 INFO L225 Difference]: With dead ends: 1809 [2024-11-10 17:31:16,241 INFO L226 Difference]: Without dead ends: 1809 [2024-11-10 17:31:16,241 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-10 17:31:16,242 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 1 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:16,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2831 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:31:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-10 17:31:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2024-11-10 17:31:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1496 states have (on average 1.643716577540107) internal successors, (2459), 1800 states have internal predecessors, (2459), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:31:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2511 transitions. [2024-11-10 17:31:16,267 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2511 transitions. Word has length 87 [2024-11-10 17:31:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:16,267 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2511 transitions. [2024-11-10 17:31:16,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2511 transitions. [2024-11-10 17:31:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:31:16,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:16,271 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-10 17:31:16,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 17:31:16,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:16,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:16,272 INFO L85 PathProgramCache]: Analyzing trace with hash 404855753, now seen corresponding path program 1 times [2024-11-10 17:31:16,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:16,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517552080] [2024-11-10 17:31:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:16,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:16,504 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-10 17:31:16,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:16,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517552080] [2024-11-10 17:31:16,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517552080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:16,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:16,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:31:16,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713129700] [2024-11-10 17:31:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:16,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:31:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:16,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:31:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:31:16,506 INFO L87 Difference]: Start difference. First operand 1809 states and 2511 transitions. Second operand has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 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-10 17:31:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:17,363 INFO L93 Difference]: Finished difference Result 1827 states and 2537 transitions. [2024-11-10 17:31:17,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:31:17,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 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 95 [2024-11-10 17:31:17,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:17,375 INFO L225 Difference]: With dead ends: 1827 [2024-11-10 17:31:17,375 INFO L226 Difference]: Without dead ends: 1827 [2024-11-10 17:31:17,375 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-10 17:31:17,376 INFO L432 NwaCegarLoop]: 956 mSDtfsCounter, 17 mSDsluCounter, 3476 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4432 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:17,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4432 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 17:31:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2024-11-10 17:31:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1818. [2024-11-10 17:31:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1504 states have (on average 1.6422872340425532) internal successors, (2470), 1807 states have internal predecessors, (2470), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-10 17:31:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2527 transitions. [2024-11-10 17:31:17,404 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2527 transitions. Word has length 95 [2024-11-10 17:31:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:17,404 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2527 transitions. [2024-11-10 17:31:17,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 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-10 17:31:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2527 transitions. [2024-11-10 17:31:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:31:17,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:17,405 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-10 17:31:17,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 17:31:17,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:17,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:17,406 INFO L85 PathProgramCache]: Analyzing trace with hash 404855754, now seen corresponding path program 1 times [2024-11-10 17:31:17,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:17,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116231090] [2024-11-10 17:31:17,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:17,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:17,851 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-10 17:31:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:17,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116231090] [2024-11-10 17:31:17,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116231090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:17,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:17,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:31:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986478633] [2024-11-10 17:31:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:17,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:31:17,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:17,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:31:17,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:31:17,853 INFO L87 Difference]: Start difference. First operand 1818 states and 2527 transitions. Second operand has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-10 17:31:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:18,721 INFO L93 Difference]: Finished difference Result 1818 states and 2525 transitions. [2024-11-10 17:31:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:31:18,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 95 [2024-11-10 17:31:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:18,727 INFO L225 Difference]: With dead ends: 1818 [2024-11-10 17:31:18,727 INFO L226 Difference]: Without dead ends: 1818 [2024-11-10 17:31:18,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:31:18,727 INFO L432 NwaCegarLoop]: 960 mSDtfsCounter, 12 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:18,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4415 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 17:31:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2024-11-10 17:31:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1818. [2024-11-10 17:31:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1504 states have (on average 1.6409574468085106) internal successors, (2468), 1807 states have internal predecessors, (2468), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-10 17:31:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2525 transitions. [2024-11-10 17:31:18,752 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2525 transitions. Word has length 95 [2024-11-10 17:31:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:18,752 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2525 transitions. [2024-11-10 17:31:18,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-10 17:31:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2525 transitions. [2024-11-10 17:31:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 17:31:18,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:18,753 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] [2024-11-10 17:31:18,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 17:31:18,753 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:18,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1720374036, now seen corresponding path program 1 times [2024-11-10 17:31:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:18,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594809808] [2024-11-10 17:31:18,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:18,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:19,160 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-10 17:31:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594809808] [2024-11-10 17:31:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594809808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735067353] [2024-11-10 17:31:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:19,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:31:19,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:31:19,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:31:19,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 17:31:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:19,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 17:31:19,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:19,358 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-10 17:31:19,479 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 17:31:19,480 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 17 treesize of output 21 [2024-11-10 17:31:19,513 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-10 17:31:19,598 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-10 17:31:19,751 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:19,751 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-10 17:31:19,793 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-10 17:31:19,819 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-10 17:31:19,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:19,852 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_592) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:31:19,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735067353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:19,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:19,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-10 17:31:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460380004] [2024-11-10 17:31:19,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:19,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 17:31:19,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:19,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 17:31:19,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-10 17:31:19,855 INFO L87 Difference]: Start difference. First operand 1818 states and 2525 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-10 17:31:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:22,212 INFO L93 Difference]: Finished difference Result 1825 states and 2531 transitions. [2024-11-10 17:31:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:31:22,213 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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 96 [2024-11-10 17:31:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:22,217 INFO L225 Difference]: With dead ends: 1825 [2024-11-10 17:31:22,217 INFO L226 Difference]: Without dead ends: 1825 [2024-11-10 17:31:22,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2024-11-10 17:31:22,217 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 907 mSDsluCounter, 7221 mSDsCounter, 0 mSdLazyCounter, 5179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 7844 SdHoareTripleChecker+Invalid, 5201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:22,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 7844 Invalid, 5201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5179 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:31:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-10 17:31:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1822. [2024-11-10 17:31:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1508 states have (on average 1.6385941644562334) internal successors, (2471), 1810 states have internal predecessors, (2471), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:31:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2525 transitions. [2024-11-10 17:31:22,243 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2525 transitions. Word has length 96 [2024-11-10 17:31:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:22,244 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2525 transitions. [2024-11-10 17:31:22,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-10 17:31:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2525 transitions. [2024-11-10 17:31:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 17:31:22,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:22,245 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] [2024-11-10 17:31:22,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 17:31:22,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 17:31:22,449 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:22,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:22,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1720374037, now seen corresponding path program 1 times [2024-11-10 17:31:22,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:22,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737267126] [2024-11-10 17:31:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:22,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:23,143 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-10 17:31:23,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:23,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737267126] [2024-11-10 17:31:23,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737267126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:23,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354652563] [2024-11-10 17:31:23,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:23,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:31:23,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:31:23,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:31:23,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 17:31:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:23,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 17:31:23,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:23,327 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-10 17:31:23,426 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:31:23,427 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-10 17:31:23,432 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-10 17:31:23,462 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-10 17:31:23,467 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-10 17:31:23,542 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-10 17:31:23,546 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-10 17:31:23,645 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:23,645 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-10 17:31:23,654 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-10 17:31:23,686 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-10 17:31:23,692 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-10 17:31:23,709 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-10 17:31:23,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:23,794 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_741 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-10 17:31:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354652563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:23,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:23,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-10 17:31:23,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145085206] [2024-11-10 17:31:23,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:23,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 17:31:23,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 17:31:23,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-10 17:31:23,799 INFO L87 Difference]: Start difference. First operand 1822 states and 2525 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-10 17:31:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:26,365 INFO L93 Difference]: Finished difference Result 1824 states and 2529 transitions. [2024-11-10 17:31:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 17:31:26,365 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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 96 [2024-11-10 17:31:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:26,369 INFO L225 Difference]: With dead ends: 1824 [2024-11-10 17:31:26,369 INFO L226 Difference]: Without dead ends: 1824 [2024-11-10 17:31:26,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 90 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-10 17:31:26,370 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 905 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 5680 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 6347 SdHoareTripleChecker+Invalid, 5703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:26,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 6347 Invalid, 5703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5680 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 17:31:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2024-11-10 17:31:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1812. [2024-11-10 17:31:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1500 states have (on average 1.64) internal successors, (2460), 1802 states have internal predecessors, (2460), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:31:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2512 transitions. [2024-11-10 17:31:26,395 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2512 transitions. Word has length 96 [2024-11-10 17:31:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:26,395 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2512 transitions. [2024-11-10 17:31:26,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-10 17:31:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2512 transitions. [2024-11-10 17:31:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:31:26,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:26,396 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-10 17:31:26,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 17:31:26,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 17:31:26,597 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 790489874, now seen corresponding path program 1 times [2024-11-10 17:31:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864142363] [2024-11-10 17:31:26,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:26,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:26,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:27,019 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-10 17:31:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864142363] [2024-11-10 17:31:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864142363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:27,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:31:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226665905] [2024-11-10 17:31:27,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:27,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:31:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:31:27,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:31:27,021 INFO L87 Difference]: Start difference. First operand 1812 states and 2512 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 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-10 17:31:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:28,357 INFO L93 Difference]: Finished difference Result 1831 states and 2537 transitions. [2024-11-10 17:31:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:31:28,358 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 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-10 17:31:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:28,361 INFO L225 Difference]: With dead ends: 1831 [2024-11-10 17:31:28,362 INFO L226 Difference]: Without dead ends: 1831 [2024-11-10 17:31:28,362 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-10 17:31:28,362 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 940 mSDsluCounter, 4818 mSDsCounter, 0 mSdLazyCounter, 3629 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 5441 SdHoareTripleChecker+Invalid, 3648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:28,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 5441 Invalid, 3648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3629 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:31:28,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2024-11-10 17:31:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1827. [2024-11-10 17:31:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1514 states have (on average 1.6360634081902246) internal successors, (2477), 1815 states have internal predecessors, (2477), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:31:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2531 transitions. [2024-11-10 17:31:28,384 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2531 transitions. Word has length 98 [2024-11-10 17:31:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:28,384 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2531 transitions. [2024-11-10 17:31:28,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 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-10 17:31:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2531 transitions. [2024-11-10 17:31:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:31:28,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:28,385 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-10 17:31:28,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 17:31:28,386 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:28,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash 790489875, now seen corresponding path program 1 times [2024-11-10 17:31:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:28,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049188672] [2024-11-10 17:31:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:28,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:28,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:28,913 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-10 17:31:28,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:28,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049188672] [2024-11-10 17:31:28,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049188672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:28,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:28,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 17:31:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310031490] [2024-11-10 17:31:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:28,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 17:31:28,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:28,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 17:31:28,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 17:31:28,917 INFO L87 Difference]: Start difference. First operand 1827 states and 2531 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 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-10 17:31:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:30,255 INFO L93 Difference]: Finished difference Result 1830 states and 2535 transitions. [2024-11-10 17:31:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:31:30,255 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 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-10 17:31:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:30,258 INFO L225 Difference]: With dead ends: 1830 [2024-11-10 17:31:30,258 INFO L226 Difference]: Without dead ends: 1830 [2024-11-10 17:31:30,259 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-10 17:31:30,260 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 914 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:30,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 3862 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:31:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2024-11-10 17:31:30,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1827. [2024-11-10 17:31:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1514 states have (on average 1.6347424042272127) internal successors, (2475), 1815 states have internal predecessors, (2475), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:31:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2529 transitions. [2024-11-10 17:31:30,298 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2529 transitions. Word has length 98 [2024-11-10 17:31:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:30,299 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2529 transitions. [2024-11-10 17:31:30,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 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-10 17:31:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2529 transitions. [2024-11-10 17:31:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:31:30,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:30,300 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-10 17:31:30,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 17:31:30,300 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:30,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:30,301 INFO L85 PathProgramCache]: Analyzing trace with hash -180917273, now seen corresponding path program 1 times [2024-11-10 17:31:30,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:30,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245818562] [2024-11-10 17:31:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:30,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:30,730 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-10 17:31:30,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:30,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245818562] [2024-11-10 17:31:30,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245818562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:30,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107992914] [2024-11-10 17:31:30,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:30,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:31:30,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:31:30,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:31:30,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 17:31:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:30,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 17:31:30,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:30,928 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-10 17:31:31,040 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 17:31:31,040 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 17 treesize of output 21 [2024-11-10 17:31:31,069 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-10 17:31:31,139 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-10 17:31:31,250 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:31,251 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-10 17:31:31,327 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:31,327 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-10 17:31:31,341 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-10 17:31:31,368 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-10 17:31:31,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:31,377 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:31:31,384 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:31:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107992914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:31,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-10 17:31:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047389393] [2024-11-10 17:31:31,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:31,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 17:31:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:31,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 17:31:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=419, Unknown=20, NotChecked=86, Total=600 [2024-11-10 17:31:31,520 INFO L87 Difference]: Start difference. First operand 1827 states and 2529 transitions. Second operand has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 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-10 17:31:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:33,399 INFO L93 Difference]: Finished difference Result 1829 states and 2533 transitions. [2024-11-10 17:31:33,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:31:33,405 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 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-10 17:31:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:33,409 INFO L225 Difference]: With dead ends: 1829 [2024-11-10 17:31:33,409 INFO L226 Difference]: Without dead ends: 1829 [2024-11-10 17:31:33,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=586, Unknown=22, NotChecked=102, Total=812 [2024-11-10 17:31:33,409 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 902 mSDsluCounter, 6571 mSDsCounter, 0 mSdLazyCounter, 4736 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 7193 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:33,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 7193 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4736 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:31:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2024-11-10 17:31:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1826. [2024-11-10 17:31:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1514 states have (on average 1.6334214002642007) internal successors, (2473), 1814 states have internal predecessors, (2473), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:31:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2527 transitions. [2024-11-10 17:31:33,428 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2527 transitions. Word has length 99 [2024-11-10 17:31:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:33,429 INFO L471 AbstractCegarLoop]: Abstraction has 1826 states and 2527 transitions. [2024-11-10 17:31:33,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 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-10 17:31:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2527 transitions. [2024-11-10 17:31:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:31:33,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:33,430 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-10 17:31:33,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 17:31:33,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:31:33,631 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:33,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash -180917272, now seen corresponding path program 1 times [2024-11-10 17:31:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:33,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950116634] [2024-11-10 17:31:33,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:33,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:34,252 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-10 17:31:34,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:34,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950116634] [2024-11-10 17:31:34,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950116634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:34,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291082849] [2024-11-10 17:31:34,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:34,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:31:34,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:31:34,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:31:34,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 17:31:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:34,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 17:31:34,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:34,439 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-10 17:31:34,521 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-10 17:31:34,528 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:31:34,528 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-10 17:31:34,552 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-10 17:31:34,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-10 17:31:34,620 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-10 17:31:34,624 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-10 17:31:34,714 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:34,715 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-10 17:31:34,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:31:34,783 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:34,783 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-10 17:31:34,793 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-10 17:31:34,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-10 17:31:34,809 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-10 17:31:34,840 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-10 17:31:34,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:34,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1189 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:31:34,915 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1189 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:31:34,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1195) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1196))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1195) .cse1 v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-10 17:31:34,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291082849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:34,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:34,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-10 17:31:34,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707917273] [2024-11-10 17:31:34,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:34,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 17:31:34,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:34,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 17:31:34,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=438, Unknown=3, NotChecked=132, Total=650 [2024-11-10 17:31:34,958 INFO L87 Difference]: Start difference. First operand 1826 states and 2527 transitions. Second operand has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 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-10 17:31:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:37,470 INFO L93 Difference]: Finished difference Result 1828 states and 2531 transitions. [2024-11-10 17:31:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:31:37,470 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 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-10 17:31:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:37,473 INFO L225 Difference]: With dead ends: 1828 [2024-11-10 17:31:37,473 INFO L226 Difference]: Without dead ends: 1828 [2024-11-10 17:31:37,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=694, Unknown=3, NotChecked=168, Total=992 [2024-11-10 17:31:37,474 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 902 mSDsluCounter, 6649 mSDsCounter, 0 mSdLazyCounter, 6773 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 6796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:37,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 7274 Invalid, 6796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6773 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:31:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2024-11-10 17:31:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1810. [2024-11-10 17:31:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1500 states have (on average 1.6373333333333333) internal successors, (2456), 1800 states have internal predecessors, (2456), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:31:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2508 transitions. [2024-11-10 17:31:37,494 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2508 transitions. Word has length 99 [2024-11-10 17:31:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:37,494 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2508 transitions. [2024-11-10 17:31:37,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 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-10 17:31:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2508 transitions. [2024-11-10 17:31:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 17:31:37,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:37,495 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-10 17:31:37,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 17:31:37,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:31:37,696 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:37,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash 179064834, now seen corresponding path program 1 times [2024-11-10 17:31:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:37,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119757557] [2024-11-10 17:31:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:37,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:38,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:38,129 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-10 17:31:38,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:38,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119757557] [2024-11-10 17:31:38,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119757557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:38,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:38,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 17:31:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832708030] [2024-11-10 17:31:38,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:38,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:31:38,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:38,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:31:38,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 17:31:38,132 INFO L87 Difference]: Start difference. First operand 1810 states and 2508 transitions. Second operand has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 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-10 17:31:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:39,638 INFO L93 Difference]: Finished difference Result 1835 states and 2539 transitions. [2024-11-10 17:31:39,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:31:39,640 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 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-10 17:31:39,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:39,643 INFO L225 Difference]: With dead ends: 1835 [2024-11-10 17:31:39,643 INFO L226 Difference]: Without dead ends: 1835 [2024-11-10 17:31:39,643 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-10 17:31:39,644 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 935 mSDsluCounter, 6018 mSDsCounter, 0 mSdLazyCounter, 4420 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 6640 SdHoareTripleChecker+Invalid, 4438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:39,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 6640 Invalid, 4438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4420 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:31:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-11-10 17:31:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1831. [2024-11-10 17:31:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1520 states have (on average 1.630921052631579) internal successors, (2479), 1819 states have internal predecessors, (2479), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:31:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2533 transitions. [2024-11-10 17:31:39,666 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2533 transitions. Word has length 101 [2024-11-10 17:31:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:39,667 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2533 transitions. [2024-11-10 17:31:39,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 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-10 17:31:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2533 transitions. [2024-11-10 17:31:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 17:31:39,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:39,668 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-10 17:31:39,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 17:31:39,668 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:39,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash 179064835, now seen corresponding path program 1 times [2024-11-10 17:31:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:39,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693057902] [2024-11-10 17:31:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:39,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:40,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:40,227 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-10 17:31:40,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:40,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693057902] [2024-11-10 17:31:40,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693057902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:40,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:40,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 17:31:40,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608863218] [2024-11-10 17:31:40,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:40,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 17:31:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:40,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 17:31:40,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 17:31:40,230 INFO L87 Difference]: Start difference. First operand 1831 states and 2533 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 12 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-10 17:31:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:41,529 INFO L93 Difference]: Finished difference Result 1834 states and 2537 transitions. [2024-11-10 17:31:41,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:31:41,529 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 12 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-10 17:31:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:41,532 INFO L225 Difference]: With dead ends: 1834 [2024-11-10 17:31:41,532 INFO L226 Difference]: Without dead ends: 1834 [2024-11-10 17:31:41,532 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-10 17:31:41,533 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 940 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 3321 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:41,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 3726 Invalid, 3347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3321 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:31:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2024-11-10 17:31:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1831. [2024-11-10 17:31:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1520 states have (on average 1.6296052631578948) internal successors, (2477), 1819 states have internal predecessors, (2477), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:31:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2531 transitions. [2024-11-10 17:31:41,555 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2531 transitions. Word has length 101 [2024-11-10 17:31:41,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:41,555 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2531 transitions. [2024-11-10 17:31:41,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 12 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-10 17:31:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2531 transitions. [2024-11-10 17:31:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 17:31:41,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:41,556 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-10 17:31:41,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 17:31:41,557 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:41,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:41,557 INFO L85 PathProgramCache]: Analyzing trace with hash 478389005, now seen corresponding path program 1 times [2024-11-10 17:31:41,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:41,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133240233] [2024-11-10 17:31:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:42,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:42,078 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-10 17:31:42,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133240233] [2024-11-10 17:31:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133240233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641434620] [2024-11-10 17:31:42,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:42,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:31:42,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:31:42,080 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:31:42,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 17:31:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:42,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:31:42,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:42,274 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-10 17:31:42,348 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:31:42,348 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-10 17:31:42,355 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-10 17:31:42,408 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:42,409 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-10 17:31:42,440 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:42,440 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-10 17:31:42,466 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:42,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:31:42,473 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-10 17:31:42,475 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-10 17:31:42,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:42,486 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 17:31:42,486 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-10 17:31:42,573 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1510 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1510) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-10 17:31:42,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641434620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:42,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:42,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2024-11-10 17:31:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687982620] [2024-11-10 17:31:42,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:42,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 17:31:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 17:31:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=387, Unknown=15, NotChecked=40, Total=506 [2024-11-10 17:31:42,576 INFO L87 Difference]: Start difference. First operand 1831 states and 2531 transitions. Second operand has 20 states, 18 states have (on average 8.666666666666666) internal successors, (156), 19 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:31:44,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:44,097 INFO L93 Difference]: Finished difference Result 1833 states and 2535 transitions. [2024-11-10 17:31:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:31:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.666666666666666) internal successors, (156), 19 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-11-10 17:31:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:44,106 INFO L225 Difference]: With dead ends: 1833 [2024-11-10 17:31:44,106 INFO L226 Difference]: Without dead ends: 1833 [2024-11-10 17:31:44,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=784, Unknown=17, NotChecked=58, Total=992 [2024-11-10 17:31:44,107 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 904 mSDsluCounter, 6009 mSDsCounter, 0 mSdLazyCounter, 4412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 6631 SdHoareTripleChecker+Invalid, 4440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:44,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 6631 Invalid, 4440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4412 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:31:44,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2024-11-10 17:31:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1830. [2024-11-10 17:31:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1520 states have (on average 1.6282894736842106) internal successors, (2475), 1818 states have internal predecessors, (2475), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:31:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2529 transitions. [2024-11-10 17:31:44,132 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2529 transitions. Word has length 102 [2024-11-10 17:31:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:44,132 INFO L471 AbstractCegarLoop]: Abstraction has 1830 states and 2529 transitions. [2024-11-10 17:31:44,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.666666666666666) internal successors, (156), 19 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:31:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2529 transitions. [2024-11-10 17:31:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 17:31:44,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:44,133 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-10 17:31:44,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 17:31:44,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 17:31:44,336 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:44,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash 478389006, now seen corresponding path program 1 times [2024-11-10 17:31:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:44,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478149251] [2024-11-10 17:31:44,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:45,035 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-10 17:31:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478149251] [2024-11-10 17:31:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478149251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332559142] [2024-11-10 17:31:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:45,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:31:45,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:31:45,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:31:45,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 17:31:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:45,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 17:31:45,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:45,236 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-10 17:31:45,299 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:31:45,299 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-10 17:31:45,303 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-10 17:31:45,324 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-10 17:31:45,326 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-10 17:31:45,380 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-10 17:31:45,383 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-10 17:31:45,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:45,453 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-10 17:31:45,458 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-10 17:31:45,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:45,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:31:45,511 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-10 17:31:45,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:45,548 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-10 17:31:45,552 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-10 17:31:45,563 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-10 17:31:45,565 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-10 17:31:45,578 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-10 17:31:45,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:45,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1681 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:31:45,629 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1681 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:31:45,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1680))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1679) .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-10 17:31:45,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1688))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1687) .cse0 v_ArrVal_1679) (select (select (store .cse1 .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1681))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1688))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1680))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1687) .cse3 v_ArrVal_1679) .cse4 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-10 17:31:45,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332559142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:45,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:45,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2024-11-10 17:31:45,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865916564] [2024-11-10 17:31:45,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:45,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 17:31:45,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:45,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 17:31:45,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=559, Unknown=9, NotChecked=204, Total=870 [2024-11-10 17:31:45,764 INFO L87 Difference]: Start difference. First operand 1830 states and 2529 transitions. Second operand has 23 states, 20 states have (on average 8.15) internal successors, (163), 22 states have internal predecessors, (163), 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-10 17:31:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:48,884 INFO L93 Difference]: Finished difference Result 1832 states and 2533 transitions. [2024-11-10 17:31:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:31:48,884 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.15) internal successors, (163), 22 states have internal predecessors, (163), 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 102 [2024-11-10 17:31:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:48,887 INFO L225 Difference]: With dead ends: 1832 [2024-11-10 17:31:48,887 INFO L226 Difference]: Without dead ends: 1832 [2024-11-10 17:31:48,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=900, Unknown=9, NotChecked=260, Total=1332 [2024-11-10 17:31:48,888 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 899 mSDsluCounter, 7624 mSDsCounter, 0 mSdLazyCounter, 7779 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 8248 SdHoareTripleChecker+Invalid, 7802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:48,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 8248 Invalid, 7802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 7779 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 17:31:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-10 17:31:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1808. [2024-11-10 17:31:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1500 states have (on average 1.6346666666666667) internal successors, (2452), 1798 states have internal predecessors, (2452), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:31:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2504 transitions. [2024-11-10 17:31:48,907 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2504 transitions. Word has length 102 [2024-11-10 17:31:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:48,907 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2504 transitions. [2024-11-10 17:31:48,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.15) internal successors, (163), 22 states have internal predecessors, (163), 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-10 17:31:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2504 transitions. [2024-11-10 17:31:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 17:31:48,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:48,908 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, 1, 1] [2024-11-10 17:31:48,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 17:31:49,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:31:49,109 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:49,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash 171993579, now seen corresponding path program 1 times [2024-11-10 17:31:49,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:49,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319393793] [2024-11-10 17:31:49,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:49,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:49,574 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-10 17:31:49,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:49,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319393793] [2024-11-10 17:31:49,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319393793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:49,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:49,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 17:31:49,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058327293] [2024-11-10 17:31:49,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:49,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:31:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:31:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:31:49,577 INFO L87 Difference]: Start difference. First operand 1808 states and 2504 transitions. Second operand has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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-10 17:31:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:51,377 INFO L93 Difference]: Finished difference Result 1839 states and 2541 transitions. [2024-11-10 17:31:51,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:31:51,377 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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 104 [2024-11-10 17:31:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:51,380 INFO L225 Difference]: With dead ends: 1839 [2024-11-10 17:31:51,380 INFO L226 Difference]: Without dead ends: 1839 [2024-11-10 17:31:51,380 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-10 17:31:51,381 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 917 mSDsluCounter, 7174 mSDsCounter, 0 mSdLazyCounter, 5221 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 7795 SdHoareTripleChecker+Invalid, 5239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:51,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 7795 Invalid, 5239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5221 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:31:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2024-11-10 17:31:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1835. [2024-11-10 17:31:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1526 states have (on average 1.625819134993447) internal successors, (2481), 1823 states have internal predecessors, (2481), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:31:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2535 transitions. [2024-11-10 17:31:51,403 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2535 transitions. Word has length 104 [2024-11-10 17:31:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:51,403 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2535 transitions. [2024-11-10 17:31:51,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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-10 17:31:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2535 transitions. [2024-11-10 17:31:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 17:31:51,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:51,404 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, 1, 1] [2024-11-10 17:31:51,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 17:31:51,404 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:51,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:51,405 INFO L85 PathProgramCache]: Analyzing trace with hash 171993580, now seen corresponding path program 1 times [2024-11-10 17:31:51,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:51,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892732100] [2024-11-10 17:31:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:51,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:52,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:52,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892732100] [2024-11-10 17:31:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892732100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:52,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:52,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:31:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776730271] [2024-11-10 17:31:52,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:52,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:31:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:52,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:31:52,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:31:52,177 INFO L87 Difference]: Start difference. First operand 1835 states and 2535 transitions. Second operand has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 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-10 17:31:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:53,543 INFO L93 Difference]: Finished difference Result 1838 states and 2539 transitions. [2024-11-10 17:31:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 17:31:53,543 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 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 104 [2024-11-10 17:31:53,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:53,546 INFO L225 Difference]: With dead ends: 1838 [2024-11-10 17:31:53,546 INFO L226 Difference]: Without dead ends: 1838 [2024-11-10 17:31:53,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-10 17:31:53,546 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 939 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 3330 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 3733 SdHoareTripleChecker+Invalid, 3356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:53,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 3733 Invalid, 3356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3330 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:31:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-10 17:31:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1835. [2024-11-10 17:31:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1526 states have (on average 1.624508519003932) internal successors, (2479), 1823 states have internal predecessors, (2479), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:31:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2533 transitions. [2024-11-10 17:31:53,565 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2533 transitions. Word has length 104 [2024-11-10 17:31:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:53,565 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2533 transitions. [2024-11-10 17:31:53,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 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-10 17:31:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2533 transitions. [2024-11-10 17:31:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 17:31:53,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:53,566 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, 1, 1, 1] [2024-11-10 17:31:53,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 17:31:53,566 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:31:53,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash 986265344, now seen corresponding path program 1 times [2024-11-10 17:31:53,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:31:53,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125599976] [2024-11-10 17:31:53,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:53,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:31:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:31:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:54,099 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-10 17:31:54,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:31:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125599976] [2024-11-10 17:31:54,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125599976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810187347] [2024-11-10 17:31:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:54,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:31:54,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:31:54,102 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:31:54,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 17:31:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:54,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 17:31:54,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:54,323 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-10 17:31:54,403 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 17:31:54,403 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 17 treesize of output 21 [2024-11-10 17:31:54,423 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-10 17:31:54,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:31:54,576 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:54,577 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-10 17:31:54,636 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:54,636 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-10 17:31:54,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:54,674 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-10 17:31:54,716 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:54,716 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-10 17:31:54,728 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-10 17:31:54,752 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-10 17:31:54,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:54,857 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2024))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2025)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-10 17:31:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810187347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:59,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:59,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-10 17:31:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155511821] [2024-11-10 17:31:59,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:59,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:31:59,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:31:59,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:31:59,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=776, Unknown=89, NotChecked=60, Total=1056 [2024-11-10 17:31:59,037 INFO L87 Difference]: Start difference. First operand 1835 states and 2533 transitions. Second operand has 26 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 25 states have internal predecessors, (169), 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-10 17:32:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:02,511 INFO L93 Difference]: Finished difference Result 1837 states and 2537 transitions. [2024-11-10 17:32:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 17:32:02,511 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 25 states have internal predecessors, (169), 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 105 [2024-11-10 17:32:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:02,513 INFO L225 Difference]: With dead ends: 1837 [2024-11-10 17:32:02,513 INFO L226 Difference]: Without dead ends: 1837 [2024-11-10 17:32:02,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=160, Invalid=1012, Unknown=92, NotChecked=68, Total=1332 [2024-11-10 17:32:02,514 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 886 mSDsluCounter, 9550 mSDsCounter, 0 mSdLazyCounter, 6819 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 10170 SdHoareTripleChecker+Invalid, 6837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:02,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 10170 Invalid, 6837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6819 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-10 17:32:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2024-11-10 17:32:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1834. [2024-11-10 17:32:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1526 states have (on average 1.6231979030144168) internal successors, (2477), 1822 states have internal predecessors, (2477), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:32:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2531 transitions. [2024-11-10 17:32:02,530 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2531 transitions. Word has length 105 [2024-11-10 17:32:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:02,530 INFO L471 AbstractCegarLoop]: Abstraction has 1834 states and 2531 transitions. [2024-11-10 17:32:02,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 25 states have internal predecessors, (169), 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-10 17:32:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2531 transitions. [2024-11-10 17:32:02,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 17:32:02,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:02,531 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, 1, 1, 1] [2024-11-10 17:32:02,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 17:32:02,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:32:02,732 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:32:02,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:02,733 INFO L85 PathProgramCache]: Analyzing trace with hash 986265345, now seen corresponding path program 1 times [2024-11-10 17:32:02,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:32:02,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422941700] [2024-11-10 17:32:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:02,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:32:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:03,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:32:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:03,464 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-10 17:32:03,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:32:03,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422941700] [2024-11-10 17:32:03,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422941700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:32:03,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908064430] [2024-11-10 17:32:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:03,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:32:03,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:32:03,466 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:32:03,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 17:32:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:03,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 17:32:03,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:03,687 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-10 17:32:03,778 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-10 17:32:03,786 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:32:03,786 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-10 17:32:03,810 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-10 17:32:03,814 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-10 17:32:03,878 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-10 17:32:03,882 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-10 17:32:03,960 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:03,961 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-10 17:32:03,964 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-10 17:32:04,027 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:04,027 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-10 17:32:04,034 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-10 17:32:04,081 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:04,081 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-10 17:32:04,089 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-10 17:32:04,144 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:04,144 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-10 17:32:04,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:32:04,165 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-10 17:32:04,168 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-10 17:32:04,191 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-10 17:32:04,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:32:04,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2212))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2211) .cse0 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2211) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-10 17:32:04,405 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2211) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2212))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2211) .cse2 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-10 17:32:04,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2209 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2210))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2212))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2209) .cse0 v_ArrVal_2211) .cse1 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2209 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2210))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2209) .cse5 v_ArrVal_2211) (select (select (store .cse6 .cse5 v_ArrVal_2212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2214))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-10 17:32:04,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2209 (Array Int Int)) (v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2220))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2210))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2212))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2219) .cse0 v_ArrVal_2209) .cse1 v_ArrVal_2211) .cse2 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2209 (Array Int Int)) (v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2220))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2210))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2219) .cse7 v_ArrVal_2209) .cse8 v_ArrVal_2211) (select (select (store .cse9 .cse8 v_ArrVal_2212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2214))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-10 17:32:04,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908064430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:32:04,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:32:04,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-10 17:32:04,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415899625] [2024-11-10 17:32:04,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:32:04,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 17:32:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:32:04,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 17:32:04,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=715, Unknown=46, NotChecked=236, Total=1122 [2024-11-10 17:32:04,872 INFO L87 Difference]: Start difference. First operand 1834 states and 2531 transitions. Second operand has 25 states, 22 states have (on average 7.681818181818182) internal successors, (169), 24 states have internal predecessors, (169), 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-10 17:32:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:08,247 INFO L93 Difference]: Finished difference Result 1836 states and 2535 transitions. [2024-11-10 17:32:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:32:08,250 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.681818181818182) internal successors, (169), 24 states have internal predecessors, (169), 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 105 [2024-11-10 17:32:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:08,253 INFO L225 Difference]: With dead ends: 1836 [2024-11-10 17:32:08,253 INFO L226 Difference]: Without dead ends: 1836 [2024-11-10 17:32:08,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=1166, Unknown=48, NotChecked=300, Total=1722 [2024-11-10 17:32:08,253 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 904 mSDsluCounter, 5004 mSDsCounter, 0 mSdLazyCounter, 5464 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 5627 SdHoareTripleChecker+Invalid, 5495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:08,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 5627 Invalid, 5495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5464 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-10 17:32:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-10 17:32:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1806. [2024-11-10 17:32:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1500 states have (on average 1.632) internal successors, (2448), 1796 states have internal predecessors, (2448), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:32:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2500 transitions. [2024-11-10 17:32:08,270 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2500 transitions. Word has length 105 [2024-11-10 17:32:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:08,270 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2500 transitions. [2024-11-10 17:32:08,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.681818181818182) internal successors, (169), 24 states have internal predecessors, (169), 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-10 17:32:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2500 transitions. [2024-11-10 17:32:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 17:32:08,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:08,271 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, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:08,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 17:32:08,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 17:32:08,472 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:32:08,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1065579803, now seen corresponding path program 1 times [2024-11-10 17:32:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:32:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492423012] [2024-11-10 17:32:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:32:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:09,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:32:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:09,047 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-10 17:32:09,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:32:09,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492423012] [2024-11-10 17:32:09,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492423012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:09,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:09,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 17:32:09,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115518354] [2024-11-10 17:32:09,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:09,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 17:32:09,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:32:09,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 17:32:09,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-10 17:32:09,049 INFO L87 Difference]: Start difference. First operand 1806 states and 2500 transitions. Second operand has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 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-10 17:32:11,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:11,722 INFO L93 Difference]: Finished difference Result 1845 states and 2545 transitions. [2024-11-10 17:32:11,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 17:32:11,722 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 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 108 [2024-11-10 17:32:11,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:11,725 INFO L225 Difference]: With dead ends: 1845 [2024-11-10 17:32:11,725 INFO L226 Difference]: Without dead ends: 1845 [2024-11-10 17:32:11,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2024-11-10 17:32:11,726 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 936 mSDsluCounter, 8345 mSDsCounter, 0 mSdLazyCounter, 5961 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 8965 SdHoareTripleChecker+Invalid, 5981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:11,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 8965 Invalid, 5981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5961 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 17:32:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2024-11-10 17:32:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1841. [2024-11-10 17:32:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1534 states have (on average 1.619947848761408) internal successors, (2485), 1829 states have internal predecessors, (2485), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:32:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2539 transitions. [2024-11-10 17:32:11,747 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2539 transitions. Word has length 108 [2024-11-10 17:32:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:11,747 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2539 transitions. [2024-11-10 17:32:11,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 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-10 17:32:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2539 transitions. [2024-11-10 17:32:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 17:32:11,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:11,748 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, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:11,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 17:32:11,748 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:32:11,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1065579802, now seen corresponding path program 1 times [2024-11-10 17:32:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:32:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498441204] [2024-11-10 17:32:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:32:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:12,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:32:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:12,677 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-10 17:32:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:32:12,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498441204] [2024-11-10 17:32:12,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498441204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:12,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:12,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 17:32:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722461444] [2024-11-10 17:32:12,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:12,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 17:32:12,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:32:12,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 17:32:12,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-10 17:32:12,679 INFO L87 Difference]: Start difference. First operand 1841 states and 2539 transitions. Second operand has 18 states, 16 states have (on average 6.625) internal successors, (106), 17 states have internal predecessors, (106), 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-10 17:32:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:15,304 INFO L93 Difference]: Finished difference Result 1844 states and 2543 transitions. [2024-11-10 17:32:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 17:32:15,305 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.625) internal successors, (106), 17 states have internal predecessors, (106), 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 108 [2024-11-10 17:32:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:15,307 INFO L225 Difference]: With dead ends: 1844 [2024-11-10 17:32:15,307 INFO L226 Difference]: Without dead ends: 1844 [2024-11-10 17:32:15,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-10 17:32:15,308 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 938 mSDsluCounter, 4623 mSDsCounter, 0 mSdLazyCounter, 4837 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 5244 SdHoareTripleChecker+Invalid, 4860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 4837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:15,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 5244 Invalid, 4860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 4837 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 17:32:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-11-10 17:32:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2024-11-10 17:32:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1534 states have (on average 1.61864406779661) internal successors, (2483), 1829 states have internal predecessors, (2483), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:32:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2537 transitions. [2024-11-10 17:32:15,326 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2537 transitions. Word has length 108 [2024-11-10 17:32:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:15,327 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2537 transitions. [2024-11-10 17:32:15,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.625) internal successors, (106), 17 states have internal predecessors, (106), 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-10 17:32:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2537 transitions. [2024-11-10 17:32:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 17:32:15,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:15,328 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:15,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 17:32:15,328 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:32:15,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1224817286, now seen corresponding path program 1 times [2024-11-10 17:32:15,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:32:15,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278518921] [2024-11-10 17:32:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:15,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:32:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:32:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:15,987 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-10 17:32:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:32:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278518921] [2024-11-10 17:32:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278518921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:32:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548050573] [2024-11-10 17:32:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:15,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:32:15,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:32:15,989 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:32:15,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 17:32:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:16,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 17:32:16,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:16,207 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-10 17:32:16,317 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 17:32:16,317 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 17 treesize of output 21 [2024-11-10 17:32:16,353 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-10 17:32:16,418 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-10 17:32:16,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:16,549 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-10 17:32:16,631 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:16,631 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-10 17:32:16,689 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:16,690 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-10 17:32:16,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:16,742 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-10 17:32:16,790 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:16,791 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-10 17:32:16,802 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-10 17:32:16,884 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-10 17:32:16,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-10 17:32:16,889 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-10 17:32:16,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:32:17,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548050573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:32:17,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:32:17,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2024-11-10 17:32:17,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193512284] [2024-11-10 17:32:17,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:32:17,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 17:32:17,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:32:17,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 17:32:17,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1166, Unknown=49, NotChecked=0, Total=1406 [2024-11-10 17:32:17,824 INFO L87 Difference]: Start difference. First operand 1841 states and 2537 transitions. Second operand has 27 states, 24 states have (on average 7.375) internal successors, (177), 26 states have internal predecessors, (177), 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-10 17:32:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:21,466 INFO L93 Difference]: Finished difference Result 1843 states and 2541 transitions. [2024-11-10 17:32:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 17:32:21,466 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 7.375) internal successors, (177), 26 states have internal predecessors, (177), 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 109 [2024-11-10 17:32:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:21,468 INFO L225 Difference]: With dead ends: 1843 [2024-11-10 17:32:21,468 INFO L226 Difference]: Without dead ends: 1843 [2024-11-10 17:32:21,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=223, Invalid=1450, Unknown=49, NotChecked=0, Total=1722 [2024-11-10 17:32:21,469 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 881 mSDsluCounter, 10083 mSDsCounter, 0 mSdLazyCounter, 7055 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 10702 SdHoareTripleChecker+Invalid, 7074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 7055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:21,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 10702 Invalid, 7074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 7055 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-10 17:32:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-11-10 17:32:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2024-11-10 17:32:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1534 states have (on average 1.6173402868318123) internal successors, (2481), 1828 states have internal predecessors, (2481), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:32:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2535 transitions. [2024-11-10 17:32:21,485 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2535 transitions. Word has length 109 [2024-11-10 17:32:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:21,485 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2535 transitions. [2024-11-10 17:32:21,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 7.375) internal successors, (177), 26 states have internal predecessors, (177), 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-10 17:32:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2535 transitions. [2024-11-10 17:32:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 17:32:21,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:21,486 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:21,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 17:32:21,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:32:21,687 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:32:21,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:21,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1224817285, now seen corresponding path program 1 times [2024-11-10 17:32:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:32:21,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521992931] [2024-11-10 17:32:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:21,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:32:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:32:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:22,599 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-10 17:32:22,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:32:22,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521992931] [2024-11-10 17:32:22,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521992931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:32:22,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487490696] [2024-11-10 17:32:22,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:22,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:32:22,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:32:22,602 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:32:22,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 17:32:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:22,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 17:32:22,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:22,829 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-10 17:32:22,913 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 17:32:22,913 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 17 treesize of output 21 [2024-11-10 17:32:22,920 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-10 17:32:22,950 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-10 17:32:22,955 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-10 17:32:23,043 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 33 treesize of output 15 [2024-11-10 17:32:23,046 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-10 17:32:23,192 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:23,193 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-10 17:32:23,200 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-10 17:32:23,295 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:23,295 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-10 17:32:23,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:32:23,385 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:23,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-10 17:32:23,394 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-10 17:32:23,478 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:32:23,478 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-10 17:32:23,482 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