./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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_SFH_test1-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 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:00:34,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:00:35,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:00:35,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:00:35,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:00:35,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:00:35,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:00:35,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:00:35,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:00:35,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:00:35,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:00:35,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:00:35,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:00:35,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:00:35,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:00:35,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:00:35,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:00:35,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:00:35,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:00:35,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:00:35,132 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:00:35,136 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:00:35,137 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:00:35,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:00:35,137 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:00:35,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:00:35,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:00:35,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:00:35,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:00:35,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:00:35,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:00:35,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:00:35,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:00:35,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:00:35,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:00:35,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:00:35,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:00:35,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:00:35,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:00:35,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:00:35,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:00:35,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:00:35,144 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 -> 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 [2024-11-17 03:00:35,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:00:35,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:00:35,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:00:35,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:00:35,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:00:35,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2024-11-17 03:00:36,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:00:37,238 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:00:37,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2024-11-17 03:00:37,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/593d78832/9b3cf1bfce5c4ac591f8982fcd7515e7/FLAG8589e7463 [2024-11-17 03:00:37,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/593d78832/9b3cf1bfce5c4ac591f8982fcd7515e7 [2024-11-17 03:00:37,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:00:37,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:00:37,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:00:37,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:00:37,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:00:37,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:37,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e88d357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37, skipping insertion in model container [2024-11-17 03:00:37,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:37,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:00:37,751 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-17 03:00:37,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-17 03:00:37,802 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-17 03:00:37,807 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-17 03:00:37,816 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-17 03:00:37,835 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-17 03:00:37,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:00:37,859 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:00:37,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:00:37,991 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:00:37,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37 WrapperNode [2024-11-17 03:00:37,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:00:37,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:00:37,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:00:37,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:00:38,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,088 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 831 [2024-11-17 03:00:38,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:00:38,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:00:38,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:00:38,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:00:38,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,179 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [156, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 42 writes are split as follows [42, 0]. [2024-11-17 03:00:38,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:00:38,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:00:38,247 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:00:38,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:00:38,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (1/1) ... [2024-11-17 03:00:38,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:00:38,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:00:38,287 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-17 03:00:38,290 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-17 03:00:38,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 03:00:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 03:00:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 03:00:38,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 03:00:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 03:00:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 03:00:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 03:00:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 03:00:38,345 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 03:00:38,345 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 03:00:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 03:00:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:00:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 03:00:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 03:00:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 03:00:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 03:00:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 03:00:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:00:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 03:00:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:00:38,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:00:38,552 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:00:38,555 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:00:40,162 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2024-11-17 03:00:40,162 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:00:40,233 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:00:40,234 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 03:00:40,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:00:40 BoogieIcfgContainer [2024-11-17 03:00:40,234 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:00:40,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:00:40,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:00:40,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:00:40,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:00:37" (1/3) ... [2024-11-17 03:00:40,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e737e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:00:40, skipping insertion in model container [2024-11-17 03:00:40,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:00:37" (2/3) ... [2024-11-17 03:00:40,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e737e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:00:40, skipping insertion in model container [2024-11-17 03:00:40,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:00:40" (3/3) ... [2024-11-17 03:00:40,245 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test1-1.i [2024-11-17 03:00:40,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:00:40,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-17 03:00:40,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:00:40,334 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;@7619f303, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:00:40,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-17 03:00:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 772 states, 439 states have (on average 2.0273348519362187) internal successors, (890), 766 states have internal predecessors, (890), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 03:00:40,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:40,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 03:00:40,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:40,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:40,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1074001219, now seen corresponding path program 1 times [2024-11-17 03:00:40,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:40,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350929520] [2024-11-17 03:00:40,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:00:40,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:40,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350929520] [2024-11-17 03:00:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350929520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:40,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:00:40,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757884517] [2024-11-17 03:00:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:40,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 03:00:40,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:40,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 03:00:40,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:00:40,561 INFO L87 Difference]: Start difference. First operand has 772 states, 439 states have (on average 2.0273348519362187) internal successors, (890), 766 states have internal predecessors, (890), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:40,671 INFO L93 Difference]: Finished difference Result 761 states and 868 transitions. [2024-11-17 03:00:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 03:00:40,677 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 03:00:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:40,695 INFO L225 Difference]: With dead ends: 761 [2024-11-17 03:00:40,695 INFO L226 Difference]: Without dead ends: 758 [2024-11-17 03:00:40,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:00:40,702 INFO L432 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:40,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 846 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:00:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-17 03:00:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2024-11-17 03:00:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 431 states have (on average 1.9466357308584687) internal successors, (839), 752 states have internal predecessors, (839), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 865 transitions. [2024-11-17 03:00:40,796 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 865 transitions. Word has length 6 [2024-11-17 03:00:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:40,797 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 865 transitions. [2024-11-17 03:00:40,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 865 transitions. [2024-11-17 03:00:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 03:00:40,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:40,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 03:00:40,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:00:40,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:40,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1074001188, now seen corresponding path program 1 times [2024-11-17 03:00:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:40,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182331427] [2024-11-17 03:00:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:40,899 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-17 03:00:40,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:40,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182331427] [2024-11-17 03:00:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182331427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:40,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:40,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:00:40,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526401480] [2024-11-17 03:00:40,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:40,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:00:40,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:40,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:00:40,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:00:40,905 INFO L87 Difference]: Start difference. First operand 758 states and 865 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:41,534 INFO L93 Difference]: Finished difference Result 712 states and 820 transitions. [2024-11-17 03:00:41,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:00:41,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 03:00:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:41,538 INFO L225 Difference]: With dead ends: 712 [2024-11-17 03:00:41,538 INFO L226 Difference]: Without dead ends: 712 [2024-11-17 03:00:41,538 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-17 03:00:41,539 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 707 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:41,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 500 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 03:00:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-17 03:00:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 709. [2024-11-17 03:00:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 431 states have (on average 1.8329466357308584) internal successors, (790), 703 states have internal predecessors, (790), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 816 transitions. [2024-11-17 03:00:41,564 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 816 transitions. Word has length 6 [2024-11-17 03:00:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:41,564 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 816 transitions. [2024-11-17 03:00:41,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 816 transitions. [2024-11-17 03:00:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 03:00:41,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:41,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 03:00:41,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:00:41,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:41,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1074001187, now seen corresponding path program 1 times [2024-11-17 03:00:41,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:41,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310029047] [2024-11-17 03:00:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:41,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:41,669 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-17 03:00:41,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:41,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310029047] [2024-11-17 03:00:41,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310029047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:41,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:41,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:00:41,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399610712] [2024-11-17 03:00:41,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:41,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:00:41,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:41,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:00:41,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:00:41,672 INFO L87 Difference]: Start difference. First operand 709 states and 816 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:42,212 INFO L93 Difference]: Finished difference Result 790 states and 903 transitions. [2024-11-17 03:00:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:00:42,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 03:00:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:42,216 INFO L225 Difference]: With dead ends: 790 [2024-11-17 03:00:42,216 INFO L226 Difference]: Without dead ends: 790 [2024-11-17 03:00:42,217 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-17 03:00:42,218 INFO L432 NwaCegarLoop]: 667 mSDtfsCounter, 418 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:42,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 909 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 03:00:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-17 03:00:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 741. [2024-11-17 03:00:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 473 states have (on average 1.8202959830866807) internal successors, (861), 735 states have internal predecessors, (861), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 887 transitions. [2024-11-17 03:00:42,240 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 887 transitions. Word has length 6 [2024-11-17 03:00:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:42,241 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 887 transitions. [2024-11-17 03:00:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 887 transitions. [2024-11-17 03:00:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 03:00:42,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:42,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:42,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:00:42,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:42,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:42,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1351003848, now seen corresponding path program 1 times [2024-11-17 03:00:42,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:42,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671727323] [2024-11-17 03:00:42,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:00:42,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:42,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671727323] [2024-11-17 03:00:42,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671727323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:42,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:42,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:00:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850070330] [2024-11-17 03:00:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:42,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:00:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:00:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:00:42,310 INFO L87 Difference]: Start difference. First operand 741 states and 887 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:42,432 INFO L93 Difference]: Finished difference Result 1430 states and 1702 transitions. [2024-11-17 03:00:42,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:00:42,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 03:00:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:42,439 INFO L225 Difference]: With dead ends: 1430 [2024-11-17 03:00:42,440 INFO L226 Difference]: Without dead ends: 1430 [2024-11-17 03:00:42,441 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-17 03:00:42,442 INFO L432 NwaCegarLoop]: 1009 mSDtfsCounter, 726 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:42,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1787 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:00:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-17 03:00:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 743. [2024-11-17 03:00:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 475 states have (on average 1.8168421052631578) internal successors, (863), 737 states have internal predecessors, (863), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 889 transitions. [2024-11-17 03:00:42,471 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 889 transitions. Word has length 8 [2024-11-17 03:00:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:42,472 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 889 transitions. [2024-11-17 03:00:42,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 889 transitions. [2024-11-17 03:00:42,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 03:00:42,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:42,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:42,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:00:42,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:42,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash -673853147, now seen corresponding path program 1 times [2024-11-17 03:00:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:42,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166713260] [2024-11-17 03:00:42,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:42,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:42,596 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-17 03:00:42,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166713260] [2024-11-17 03:00:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166713260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:42,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:42,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:00:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840053823] [2024-11-17 03:00:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:42,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:00:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:00:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:00:42,600 INFO L87 Difference]: Start difference. First operand 743 states and 889 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-17 03:00:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:43,222 INFO L93 Difference]: Finished difference Result 769 states and 942 transitions. [2024-11-17 03:00:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:00:43,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-17 03:00:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:43,226 INFO L225 Difference]: With dead ends: 769 [2024-11-17 03:00:43,226 INFO L226 Difference]: Without dead ends: 769 [2024-11-17 03:00:43,227 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-17 03:00:43,228 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 975 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:43,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 782 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 03:00:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-17 03:00:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 720. [2024-11-17 03:00:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 475 states have (on average 1.768421052631579) internal successors, (840), 714 states have internal predecessors, (840), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 866 transitions. [2024-11-17 03:00:43,247 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 866 transitions. Word has length 13 [2024-11-17 03:00:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:43,248 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 866 transitions. [2024-11-17 03:00:43,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-17 03:00:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 866 transitions. [2024-11-17 03:00:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 03:00:43,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:43,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:43,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:00:43,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:43,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -673853146, now seen corresponding path program 1 times [2024-11-17 03:00:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:43,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440973349] [2024-11-17 03:00:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:43,336 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-17 03:00:43,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:43,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440973349] [2024-11-17 03:00:43,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440973349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:43,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:43,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:00:43,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924125267] [2024-11-17 03:00:43,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:43,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:00:43,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:43,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:00:43,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:00:43,342 INFO L87 Difference]: Start difference. First operand 720 states and 866 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-17 03:00:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:43,394 INFO L93 Difference]: Finished difference Result 645 states and 763 transitions. [2024-11-17 03:00:43,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:00:43,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-17 03:00:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:43,398 INFO L225 Difference]: With dead ends: 645 [2024-11-17 03:00:43,399 INFO L226 Difference]: Without dead ends: 645 [2024-11-17 03:00:43,399 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-17 03:00:43,401 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 61 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:43,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1256 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:00:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-17 03:00:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2024-11-17 03:00:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 412 states have (on average 1.7888349514563107) internal successors, (737), 639 states have internal predecessors, (737), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 763 transitions. [2024-11-17 03:00:43,426 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 763 transitions. Word has length 13 [2024-11-17 03:00:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:43,426 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 763 transitions. [2024-11-17 03:00:43,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-17 03:00:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 763 transitions. [2024-11-17 03:00:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 03:00:43,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:43,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:43,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:00:43,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr290REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:43,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash 967063977, now seen corresponding path program 1 times [2024-11-17 03:00:43,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:43,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837938032] [2024-11-17 03:00:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:43,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:43,530 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-17 03:00:43,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:43,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837938032] [2024-11-17 03:00:43,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837938032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:43,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:43,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:00:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765234915] [2024-11-17 03:00:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:43,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:00:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:43,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:00:43,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:00:43,532 INFO L87 Difference]: Start difference. First operand 645 states and 763 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:43,628 INFO L93 Difference]: Finished difference Result 627 states and 738 transitions. [2024-11-17 03:00:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:00:43,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 03:00:43,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:43,631 INFO L225 Difference]: With dead ends: 627 [2024-11-17 03:00:43,631 INFO L226 Difference]: Without dead ends: 627 [2024-11-17 03:00:43,631 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-17 03:00:43,633 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 41 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:43,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1831 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:00:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-17 03:00:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 624. [2024-11-17 03:00:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 398 states have (on average 1.7814070351758795) internal successors, (709), 618 states have internal predecessors, (709), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 735 transitions. [2024-11-17 03:00:43,647 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 735 transitions. Word has length 15 [2024-11-17 03:00:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:43,647 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 735 transitions. [2024-11-17 03:00:43,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 735 transitions. [2024-11-17 03:00:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 03:00:43,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:43,649 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] [2024-11-17 03:00:43,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:00:43,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr276REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:43,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:43,650 INFO L85 PathProgramCache]: Analyzing trace with hash 350292927, now seen corresponding path program 1 times [2024-11-17 03:00:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:43,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231342735] [2024-11-17 03:00:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:43,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:43,853 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-17 03:00:43,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231342735] [2024-11-17 03:00:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231342735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:43,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:43,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:00:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156719658] [2024-11-17 03:00:43,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:43,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:00:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:43,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:00:43,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:00:43,856 INFO L87 Difference]: Start difference. First operand 624 states and 735 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-17 03:00:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:44,370 INFO L93 Difference]: Finished difference Result 718 states and 823 transitions. [2024-11-17 03:00:44,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:00:44,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-17 03:00:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:44,374 INFO L225 Difference]: With dead ends: 718 [2024-11-17 03:00:44,374 INFO L226 Difference]: Without dead ends: 718 [2024-11-17 03:00:44,374 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-17 03:00:44,375 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 423 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:44,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1140 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 03:00:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-17 03:00:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 620. [2024-11-17 03:00:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 398 states have (on average 1.771356783919598) internal successors, (705), 614 states have internal predecessors, (705), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 731 transitions. [2024-11-17 03:00:44,408 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 731 transitions. Word has length 29 [2024-11-17 03:00:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:44,409 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 731 transitions. [2024-11-17 03:00:44,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-17 03:00:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 731 transitions. [2024-11-17 03:00:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-17 03:00:44,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:44,413 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] [2024-11-17 03:00:44,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:00:44,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr261REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:44,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1284675059, now seen corresponding path program 1 times [2024-11-17 03:00:44,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:44,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162905009] [2024-11-17 03:00:44,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:44,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:44,533 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-17 03:00:44,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:44,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162905009] [2024-11-17 03:00:44,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162905009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:44,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:44,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:00:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308950076] [2024-11-17 03:00:44,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:44,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:00:44,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:44,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:00:44,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:00:44,536 INFO L87 Difference]: Start difference. First operand 620 states and 731 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:44,614 INFO L93 Difference]: Finished difference Result 620 states and 727 transitions. [2024-11-17 03:00:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:00:44,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-17 03:00:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:44,617 INFO L225 Difference]: With dead ends: 620 [2024-11-17 03:00:44,617 INFO L226 Difference]: Without dead ends: 620 [2024-11-17 03:00:44,617 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-17 03:00:44,619 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 21 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:44,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1813 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:00:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-17 03:00:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2024-11-17 03:00:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 398 states have (on average 1.7613065326633166) internal successors, (701), 614 states have internal predecessors, (701), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 727 transitions. [2024-11-17 03:00:44,633 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 727 transitions. Word has length 64 [2024-11-17 03:00:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:44,635 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 727 transitions. [2024-11-17 03:00:44,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 727 transitions. [2024-11-17 03:00:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 03:00:44,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:44,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:44,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:00:44,638 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr261REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:44,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash -319592789, now seen corresponding path program 1 times [2024-11-17 03:00:44,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:44,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964304311] [2024-11-17 03:00:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:44,770 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-17 03:00:44,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964304311] [2024-11-17 03:00:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964304311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:44,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:00:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727600088] [2024-11-17 03:00:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:44,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:00:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:44,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:00:44,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:00:44,772 INFO L87 Difference]: Start difference. First operand 620 states and 727 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:44,842 INFO L93 Difference]: Finished difference Result 714 states and 848 transitions. [2024-11-17 03:00:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:00:44,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-17 03:00:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:44,845 INFO L225 Difference]: With dead ends: 714 [2024-11-17 03:00:44,845 INFO L226 Difference]: Without dead ends: 714 [2024-11-17 03:00:44,846 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-17 03:00:44,847 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 54 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:44,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1232 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:00:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-17 03:00:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2024-11-17 03:00:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 492 states have (on average 1.670731707317073) internal successors, (822), 708 states have internal predecessors, (822), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 848 transitions. [2024-11-17 03:00:44,865 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 848 transitions. Word has length 72 [2024-11-17 03:00:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:44,867 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 848 transitions. [2024-11-17 03:00:44,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 848 transitions. [2024-11-17 03:00:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-17 03:00:44,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:44,868 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] [2024-11-17 03:00:44,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:00:44,870 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr232REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash 951926617, now seen corresponding path program 1 times [2024-11-17 03:00:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:44,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30335527] [2024-11-17 03:00:44,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:45,430 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-17 03:00:45,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30335527] [2024-11-17 03:00:45,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30335527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:45,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:45,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:00:45,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313892831] [2024-11-17 03:00:45,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:45,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:00:45,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:45,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:00:45,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:00:45,433 INFO L87 Difference]: Start difference. First operand 714 states and 848 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:46,045 INFO L93 Difference]: Finished difference Result 676 states and 810 transitions. [2024-11-17 03:00:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:00:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-17 03:00:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:46,049 INFO L225 Difference]: With dead ends: 676 [2024-11-17 03:00:46,049 INFO L226 Difference]: Without dead ends: 676 [2024-11-17 03:00:46,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:00:46,050 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 950 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:46,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 535 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 03:00:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-17 03:00:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 634. [2024-11-17 03:00:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 450 states have (on average 1.5622222222222222) internal successors, (703), 628 states have internal predecessors, (703), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 729 transitions. [2024-11-17 03:00:46,062 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 729 transitions. Word has length 75 [2024-11-17 03:00:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:46,062 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 729 transitions. [2024-11-17 03:00:46,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 729 transitions. [2024-11-17 03:00:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-17 03:00:46,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:46,064 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] [2024-11-17 03:00:46,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:00:46,064 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:46,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:46,065 INFO L85 PathProgramCache]: Analyzing trace with hash -352270282, now seen corresponding path program 1 times [2024-11-17 03:00:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:46,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821760982] [2024-11-17 03:00:46,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:46,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:46,359 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-17 03:00:46,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:46,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821760982] [2024-11-17 03:00:46,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821760982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:46,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:46,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:00:46,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453244656] [2024-11-17 03:00:46,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:46,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:00:46,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:46,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:00:46,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:00:46,361 INFO L87 Difference]: Start difference. First operand 634 states and 729 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:46,873 INFO L93 Difference]: Finished difference Result 633 states and 728 transitions. [2024-11-17 03:00:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:00:46,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-17 03:00:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:46,876 INFO L225 Difference]: With dead ends: 633 [2024-11-17 03:00:46,876 INFO L226 Difference]: Without dead ends: 633 [2024-11-17 03:00:46,876 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-17 03:00:46,877 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 2 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:46,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1662 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 03:00:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-17 03:00:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2024-11-17 03:00:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 450 states have (on average 1.56) internal successors, (702), 627 states have internal predecessors, (702), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 728 transitions. [2024-11-17 03:00:46,890 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 728 transitions. Word has length 80 [2024-11-17 03:00:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:46,890 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 728 transitions. [2024-11-17 03:00:46,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 728 transitions. [2024-11-17 03:00:46,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-17 03:00:46,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:46,892 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] [2024-11-17 03:00:46,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:00:46,892 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr226REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:46,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:46,893 INFO L85 PathProgramCache]: Analyzing trace with hash -352270281, now seen corresponding path program 1 times [2024-11-17 03:00:46,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:46,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464103674] [2024-11-17 03:00:46,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:47,301 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-17 03:00:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464103674] [2024-11-17 03:00:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464103674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:00:47,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046231434] [2024-11-17 03:00:47,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:47,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:00:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:47,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:00:47,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:00:47,304 INFO L87 Difference]: Start difference. First operand 633 states and 728 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:47,857 INFO L93 Difference]: Finished difference Result 632 states and 727 transitions. [2024-11-17 03:00:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:00:47,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-17 03:00:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:47,861 INFO L225 Difference]: With dead ends: 632 [2024-11-17 03:00:47,861 INFO L226 Difference]: Without dead ends: 632 [2024-11-17 03:00:47,861 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-17 03:00:47,862 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 1 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:47,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1672 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 03:00:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-17 03:00:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2024-11-17 03:00:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 449 states have (on average 1.5612472160356348) internal successors, (701), 626 states have internal predecessors, (701), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 727 transitions. [2024-11-17 03:00:47,874 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 727 transitions. Word has length 80 [2024-11-17 03:00:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:47,875 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 727 transitions. [2024-11-17 03:00:47,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:00:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 727 transitions. [2024-11-17 03:00:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 03:00:47,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:47,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:47,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 03:00:47,876 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:47,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1039804941, now seen corresponding path program 1 times [2024-11-17 03:00:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:47,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873590327] [2024-11-17 03:00:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:47,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:00:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:48,123 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-17 03:00:48,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873590327] [2024-11-17 03:00:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873590327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:48,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:48,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:00:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212398213] [2024-11-17 03:00:48,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:48,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:00:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:00:48,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:00:48,126 INFO L87 Difference]: Start difference. First operand 632 states and 727 transitions. Second operand has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:00:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:48,904 INFO L93 Difference]: Finished difference Result 644 states and 742 transitions. [2024-11-17 03:00:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:00:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-17 03:00:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:48,908 INFO L225 Difference]: With dead ends: 644 [2024-11-17 03:00:48,908 INFO L226 Difference]: Without dead ends: 644 [2024-11-17 03:00:48,908 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-17 03:00:48,909 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 16 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:48,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2451 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 03:00:48,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-17 03:00:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 638. [2024-11-17 03:00:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 454 states have (on average 1.5594713656387664) internal successors, (708), 631 states have internal predecessors, (708), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-17 03:00:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 737 transitions. [2024-11-17 03:00:48,919 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 737 transitions. Word has length 88 [2024-11-17 03:00:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:48,920 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 737 transitions. [2024-11-17 03:00:48,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:00:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 737 transitions. [2024-11-17 03:00:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 03:00:48,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:48,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:48,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 03:00:48,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr222REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:48,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1039804940, now seen corresponding path program 1 times [2024-11-17 03:00:48,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:48,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049976641] [2024-11-17 03:00:48,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:48,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:00:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:49,439 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-17 03:00:49,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:49,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049976641] [2024-11-17 03:00:49,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049976641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:49,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:49,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:00:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136812764] [2024-11-17 03:00:49,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:49,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:00:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:49,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:00:49,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:00:49,441 INFO L87 Difference]: Start difference. First operand 638 states and 737 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:00:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:50,178 INFO L93 Difference]: Finished difference Result 638 states and 736 transitions. [2024-11-17 03:00:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:00:50,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-17 03:00:50,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:50,183 INFO L225 Difference]: With dead ends: 638 [2024-11-17 03:00:50,183 INFO L226 Difference]: Without dead ends: 638 [2024-11-17 03:00:50,184 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-17 03:00:50,185 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 17 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:50,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2067 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 03:00:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-17 03:00:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2024-11-17 03:00:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 454 states have (on average 1.5572687224669604) internal successors, (707), 631 states have internal predecessors, (707), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-17 03:00:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 736 transitions. [2024-11-17 03:00:50,198 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 736 transitions. Word has length 88 [2024-11-17 03:00:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:50,198 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 736 transitions. [2024-11-17 03:00:50,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:00:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 736 transitions. [2024-11-17 03:00:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 03:00:50,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:50,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:50,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 03:00:50,200 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:50,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:50,201 INFO L85 PathProgramCache]: Analyzing trace with hash 263136202, now seen corresponding path program 1 times [2024-11-17 03:00:50,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:50,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117821849] [2024-11-17 03:00:50,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:50,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:50,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:00:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:00:50,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:50,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117821849] [2024-11-17 03:00:50,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117821849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:00:50,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041860527] [2024-11-17 03:00:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:50,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:00:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:00:50,774 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-17 03:00:50,776 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-17 03:00:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:50,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 03:00:50,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:00:51,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 03:00:51,129 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 03:00:51,130 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-17 03:00:51,142 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-17 03:00:51,228 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:00:51,228 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-17 03:00:51,262 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-17 03:00:51,265 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-17 03:00:51,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:00:51,322 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-17 03:00:51,323 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-17 03:00:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041860527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:00:51,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:00:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-17 03:00:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176802626] [2024-11-17 03:00:51,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:00:51,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 03:00:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:51,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 03:00:51,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=197, Unknown=5, NotChecked=0, Total=240 [2024-11-17 03:00:51,374 INFO L87 Difference]: Start difference. First operand 638 states and 736 transitions. Second operand has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 03:00:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:52,958 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-17 03:00:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 03:00:52,958 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-17 03:00:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:52,961 INFO L225 Difference]: With dead ends: 637 [2024-11-17 03:00:52,961 INFO L226 Difference]: Without dead ends: 637 [2024-11-17 03:00:52,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=454, Unknown=5, NotChecked=0, Total=552 [2024-11-17 03:00:52,962 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 514 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 3262 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:52,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 3262 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 03:00:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-17 03:00:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2024-11-17 03:00:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 454 states have (on average 1.5550660792951543) internal successors, (706), 630 states have internal predecessors, (706), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-17 03:00:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 735 transitions. [2024-11-17 03:00:52,974 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 735 transitions. Word has length 89 [2024-11-17 03:00:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:52,975 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 735 transitions. [2024-11-17 03:00:52,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 03:00:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 735 transitions. [2024-11-17 03:00:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 03:00:52,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:52,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:52,996 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-17 03:00:53,176 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-17 03:00:53,177 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr222REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 263136203, now seen corresponding path program 1 times [2024-11-17 03:00:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528619476] [2024-11-17 03:00:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:00:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:53,972 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-17 03:00:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528619476] [2024-11-17 03:00:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528619476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:00:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138392701] [2024-11-17 03:00:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:53,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:00:53,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:00:53,975 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-17 03:00:53,976 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-17 03:00:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:54,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-17 03:00:54,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:00:54,166 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-17 03:00:54,297 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 03:00:54,297 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-17 03:00:54,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 03:00:54,336 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-17 03:00:54,500 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:00:54,500 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 70 treesize of output 65 [2024-11-17 03:00:54,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-17 03:00:54,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-17 03:00:54,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-17 03:00:54,573 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-17 03:00:54,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:00:54,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 03:00:54,755 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 48 treesize of output 52 [2024-11-17 03:00:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138392701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:00:54,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:00:54,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-11-17 03:00:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568819585] [2024-11-17 03:00:54,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:00:54,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 03:00:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:54,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 03:00:54,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=437, Unknown=2, NotChecked=0, Total=506 [2024-11-17 03:00:54,876 INFO L87 Difference]: Start difference. First operand 637 states and 735 transitions. Second operand has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 19 states have internal predecessors, (139), 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-17 03:00:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:56,938 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-17 03:00:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:00:56,938 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 19 states have internal predecessors, (139), 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 89 [2024-11-17 03:00:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:56,941 INFO L225 Difference]: With dead ends: 636 [2024-11-17 03:00:56,941 INFO L226 Difference]: Without dead ends: 636 [2024-11-17 03:00:56,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=643, Unknown=2, NotChecked=0, Total=756 [2024-11-17 03:00:56,942 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 506 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 4161 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 4188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:56,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 4139 Invalid, 4188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4161 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 03:00:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-17 03:00:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 630. [2024-11-17 03:00:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.556792873051225) internal successors, (699), 624 states have internal predecessors, (699), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:00:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 725 transitions. [2024-11-17 03:00:56,953 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 725 transitions. Word has length 89 [2024-11-17 03:00:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:56,953 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 725 transitions. [2024-11-17 03:00:56,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 19 states have internal predecessors, (139), 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-17 03:00:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 725 transitions. [2024-11-17 03:00:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-17 03:00:56,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:56,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:56,974 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-17 03:00:57,155 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-17 03:00:57,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:57,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1524350262, now seen corresponding path program 1 times [2024-11-17 03:00:57,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:57,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881017608] [2024-11-17 03:00:57,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:57,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:57,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:00:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:57,706 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-17 03:00:57,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:57,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881017608] [2024-11-17 03:00:57,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881017608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:57,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:57,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 03:00:57,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514668179] [2024-11-17 03:00:57,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:57,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 03:00:57,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:57,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 03:00:57,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 03:00:57,711 INFO L87 Difference]: Start difference. First operand 630 states and 725 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:00:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:00:58,722 INFO L93 Difference]: Finished difference Result 640 states and 738 transitions. [2024-11-17 03:00:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 03:00:58,723 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-17 03:00:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:00:58,725 INFO L225 Difference]: With dead ends: 640 [2024-11-17 03:00:58,725 INFO L226 Difference]: Without dead ends: 640 [2024-11-17 03:00:58,726 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-17 03:00:58,726 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 523 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 03:00:58,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 2644 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 03:00:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-17 03:00:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 639. [2024-11-17 03:00:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 457 states have (on average 1.5514223194748358) internal successors, (709), 632 states have internal predecessors, (709), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-17 03:00:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 738 transitions. [2024-11-17 03:00:58,737 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 738 transitions. Word has length 91 [2024-11-17 03:00:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:00:58,738 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 738 transitions. [2024-11-17 03:00:58,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:00:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 738 transitions. [2024-11-17 03:00:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-17 03:00:58,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:00:58,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:00:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 03:00:58,740 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:00:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:00:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1524350261, now seen corresponding path program 1 times [2024-11-17 03:00:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:00:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101405653] [2024-11-17 03:00:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:00:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:00:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:59,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:00:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:00:59,393 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-17 03:00:59,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:00:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101405653] [2024-11-17 03:00:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101405653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:00:59,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:00:59,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 03:00:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622086608] [2024-11-17 03:00:59,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:00:59,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 03:00:59,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:00:59,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 03:00:59,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-17 03:00:59,396 INFO L87 Difference]: Start difference. First operand 639 states and 738 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:01:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:00,495 INFO L93 Difference]: Finished difference Result 639 states and 737 transitions. [2024-11-17 03:01:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:01:00,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-17 03:01:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:00,498 INFO L225 Difference]: With dead ends: 639 [2024-11-17 03:01:00,498 INFO L226 Difference]: Without dead ends: 639 [2024-11-17 03:01:00,498 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-17 03:01:00,499 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 535 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:00,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 2118 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 03:01:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-17 03:01:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2024-11-17 03:01:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 457 states have (on average 1.549234135667396) internal successors, (708), 632 states have internal predecessors, (708), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-17 03:01:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 737 transitions. [2024-11-17 03:01:00,509 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 737 transitions. Word has length 91 [2024-11-17 03:01:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:00,509 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 737 transitions. [2024-11-17 03:01:00,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:01:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 737 transitions. [2024-11-17 03:01:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 03:01:00,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:00,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:00,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 03:01:00,511 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:00,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash 775786899, now seen corresponding path program 1 times [2024-11-17 03:01:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:00,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277121321] [2024-11-17 03:01:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:00,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:01,030 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-17 03:01:01,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:01,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277121321] [2024-11-17 03:01:01,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277121321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:01,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24599601] [2024-11-17 03:01:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:01,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:01:01,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:01:01,034 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-17 03:01:01,035 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-17 03:01:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:01,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 03:01:01,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:01,245 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-17 03:01:01,343 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 03:01:01,344 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-17 03:01:01,352 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-17 03:01:01,421 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:01,422 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-17 03:01:01,468 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:01,468 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-17 03:01:01,479 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-17 03:01:01,484 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-17 03:01:01,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:01,494 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-17 03:01:01,500 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_899) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 03:01:01,536 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-17 03:01:01,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-17 03:01:01,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_902))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_899)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-17 03:01:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24599601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:01,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:01:01,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-17 03:01:01,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869505478] [2024-11-17 03:01:01,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:01:01,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 03:01:01,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 03:01:01,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=231, Unknown=3, NotChecked=96, Total=380 [2024-11-17 03:01:01,549 INFO L87 Difference]: Start difference. First operand 639 states and 737 transitions. Second operand has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 15 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:01:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:03,000 INFO L93 Difference]: Finished difference Result 638 states and 736 transitions. [2024-11-17 03:01:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 03:01:03,000 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 15 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-17 03:01:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:03,003 INFO L225 Difference]: With dead ends: 638 [2024-11-17 03:01:03,003 INFO L226 Difference]: Without dead ends: 638 [2024-11-17 03:01:03,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=503, Unknown=3, NotChecked=144, Total=756 [2024-11-17 03:01:03,004 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 506 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 3237 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 3942 SdHoareTripleChecker+Invalid, 3260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:03,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 3942 Invalid, 3260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3237 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 03:01:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-17 03:01:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2024-11-17 03:01:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 457 states have (on average 1.5470459518599562) internal successors, (707), 631 states have internal predecessors, (707), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-17 03:01:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 736 transitions. [2024-11-17 03:01:03,014 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 736 transitions. Word has length 92 [2024-11-17 03:01:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:03,014 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 736 transitions. [2024-11-17 03:01:03,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 15 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:01:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 736 transitions. [2024-11-17 03:01:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 03:01:03,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:03,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:03,036 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-17 03:01:03,219 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-17 03:01:03,220 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:03,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash 775786900, now seen corresponding path program 1 times [2024-11-17 03:01:03,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:03,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750512924] [2024-11-17 03:01:03,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:03,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:03,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:03,940 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-17 03:01:03,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750512924] [2024-11-17 03:01:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750512924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21411434] [2024-11-17 03:01:03,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:03,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:01:03,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:01:03,943 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-17 03:01:03,945 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-17 03:01:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:04,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 03:01:04,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:04,139 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-17 03:01:04,243 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 03:01:04,244 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-17 03:01:04,251 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-17 03:01:04,277 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-17 03:01:04,280 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-17 03:01:04,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 03:01:04,378 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-17 03:01:04,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:04,490 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-17 03:01:04,498 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-17 03:01:04,574 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:04,574 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-17 03:01:04,580 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-17 03:01:04,595 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-17 03:01:04,599 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-17 03:01:04,619 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-17 03:01:04,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:04,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1046 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2024-11-17 03:01:04,689 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1046 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-17 03:01:04,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1052) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1051))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1052) .cse1 v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-17 03:01:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21411434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:04,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:01:04,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-17 03:01:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634779519] [2024-11-17 03:01:04,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:01:04,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 03:01:04,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:04,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 03:01:04,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=437, Unknown=3, NotChecked=132, Total=650 [2024-11-17 03:01:04,749 INFO L87 Difference]: Start difference. First operand 638 states and 736 transitions. Second operand has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 03:01:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:06,574 INFO L93 Difference]: Finished difference Result 645 states and 743 transitions. [2024-11-17 03:01:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 03:01:06,575 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 92 [2024-11-17 03:01:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:06,577 INFO L225 Difference]: With dead ends: 645 [2024-11-17 03:01:06,577 INFO L226 Difference]: Without dead ends: 645 [2024-11-17 03:01:06,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=693, Unknown=3, NotChecked=168, Total=992 [2024-11-17 03:01:06,578 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 510 mSDsluCounter, 2779 mSDsCounter, 0 mSdLazyCounter, 3480 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 3508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:06,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 3138 Invalid, 3508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3480 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 03:01:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-17 03:01:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 633. [2024-11-17 03:01:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 453 states have (on average 1.5496688741721854) internal successors, (702), 626 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 728 transitions. [2024-11-17 03:01:06,588 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 728 transitions. Word has length 92 [2024-11-17 03:01:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:06,588 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 728 transitions. [2024-11-17 03:01:06,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 03:01:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 728 transitions. [2024-11-17 03:01:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 03:01:06,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:06,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:06,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 03:01:06,790 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-17 03:01:06,791 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:06,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1228933268, now seen corresponding path program 1 times [2024-11-17 03:01:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:06,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930050294] [2024-11-17 03:01:06,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:06,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:07,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:07,319 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-17 03:01:07,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:07,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930050294] [2024-11-17 03:01:07,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930050294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:07,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:07,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 03:01:07,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569554249] [2024-11-17 03:01:07,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:07,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 03:01:07,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:07,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 03:01:07,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-17 03:01:07,322 INFO L87 Difference]: Start difference. First operand 633 states and 728 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:01:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:08,708 INFO L93 Difference]: Finished difference Result 649 states and 747 transitions. [2024-11-17 03:01:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 03:01:08,709 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-17 03:01:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:08,711 INFO L225 Difference]: With dead ends: 649 [2024-11-17 03:01:08,711 INFO L226 Difference]: Without dead ends: 649 [2024-11-17 03:01:08,712 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-17 03:01:08,712 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 537 mSDsluCounter, 3218 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:08,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 3574 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2974 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 03:01:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-17 03:01:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 645. [2024-11-17 03:01:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 464 states have (on average 1.540948275862069) internal successors, (715), 637 states have internal predecessors, (715), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 742 transitions. [2024-11-17 03:01:08,722 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 742 transitions. Word has length 94 [2024-11-17 03:01:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:08,722 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 742 transitions. [2024-11-17 03:01:08,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:01:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 742 transitions. [2024-11-17 03:01:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 03:01:08,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:08,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:08,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 03:01:08,724 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr214REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:08,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1228933267, now seen corresponding path program 1 times [2024-11-17 03:01:08,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:08,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747138812] [2024-11-17 03:01:08,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:08,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:09,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:09,487 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-17 03:01:09,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747138812] [2024-11-17 03:01:09,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747138812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:09,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:09,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 03:01:09,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044733030] [2024-11-17 03:01:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:09,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:01:09,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:09,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:01:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:01:09,490 INFO L87 Difference]: Start difference. First operand 645 states and 742 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:01:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:10,936 INFO L93 Difference]: Finished difference Result 648 states and 746 transitions. [2024-11-17 03:01:10,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:01:10,936 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-17 03:01:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:10,938 INFO L225 Difference]: With dead ends: 648 [2024-11-17 03:01:10,938 INFO L226 Difference]: Without dead ends: 648 [2024-11-17 03:01:10,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-17 03:01:10,939 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 535 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 2765 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:10,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 2624 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2765 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 03:01:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-17 03:01:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2024-11-17 03:01:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 464 states have (on average 1.5387931034482758) internal successors, (714), 637 states have internal predecessors, (714), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 741 transitions. [2024-11-17 03:01:10,949 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 741 transitions. Word has length 94 [2024-11-17 03:01:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:10,949 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 741 transitions. [2024-11-17 03:01:10,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:01:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 741 transitions. [2024-11-17 03:01:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 03:01:10,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:10,950 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-17 03:01:10,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 03:01:10,951 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:10,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash 248989699, now seen corresponding path program 1 times [2024-11-17 03:01:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:10,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089760652] [2024-11-17 03:01:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:11,521 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-17 03:01:11,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:11,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089760652] [2024-11-17 03:01:11,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089760652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:11,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878825062] [2024-11-17 03:01:11,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:11,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:01:11,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:01:11,524 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-17 03:01:11,525 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-17 03:01:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:11,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-17 03:01:11,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:11,759 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-17 03:01:11,985 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 03:01:11,986 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-17 03:01:12,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 03:01:12,022 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-17 03:01:12,202 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:12,203 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-17 03:01:12,210 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-17 03:01:12,254 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 19 treesize of output 7 [2024-11-17 03:01:12,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:01:12,289 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2024-11-17 03:01:12,415 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-17 03:01:12,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 48 [2024-11-17 03:01:12,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 03:01:12,461 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-17 03:01:12,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-17 03:01:12,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:12,623 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1335 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem52#1.offset_15| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem52#1.offset_15| (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (= (select |c_#valid| (select (select (let ((.cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (store |c_#memory_$Pointer$#0.base| .cse2 (store (select |c_#memory_$Pointer$#0.base| .cse2) (+ |v_ULTIMATE.start_main_#t~mem52#1.offset_15| 16) |c_ULTIMATE.start_main_~user~0#1.base|))))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1335)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) 1)))) is different from false [2024-11-17 03:01:12,680 INFO L349 Elim1Store]: treesize reduction 5, result has 94.5 percent of original size [2024-11-17 03:01:12,681 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 95 treesize of output 94 [2024-11-17 03:01:12,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem52#1.offset_15| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem52#1.offset_15| (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1341))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem52#1.offset_15| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1335)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem50#1.base|)))) is different from false [2024-11-17 03:01:12,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878825062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:12,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:01:12,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2024-11-17 03:01:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797465835] [2024-11-17 03:01:12,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:01:12,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 03:01:12,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:12,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 03:01:12,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=789, Unknown=30, NotChecked=118, Total=1056 [2024-11-17 03:01:12,698 INFO L87 Difference]: Start difference. First operand 645 states and 741 transitions. Second operand has 28 states, 25 states have (on average 7.28) internal successors, (182), 26 states have internal predecessors, (182), 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-17 03:01:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:14,430 INFO L93 Difference]: Finished difference Result 658 states and 757 transitions. [2024-11-17 03:01:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 03:01:14,430 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 7.28) internal successors, (182), 26 states have internal predecessors, (182), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2024-11-17 03:01:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:14,433 INFO L225 Difference]: With dead ends: 658 [2024-11-17 03:01:14,433 INFO L226 Difference]: Without dead ends: 658 [2024-11-17 03:01:14,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=1456, Unknown=30, NotChecked=162, Total=1892 [2024-11-17 03:01:14,434 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 924 mSDsluCounter, 4295 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 4651 SdHoareTripleChecker+Invalid, 3846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:14,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 4651 Invalid, 3846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3798 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 03:01:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-17 03:01:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 644. [2024-11-17 03:01:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 464 states have (on average 1.5366379310344827) internal successors, (713), 636 states have internal predecessors, (713), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 740 transitions. [2024-11-17 03:01:14,444 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 740 transitions. Word has length 95 [2024-11-17 03:01:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:14,445 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 740 transitions. [2024-11-17 03:01:14,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 7.28) internal successors, (182), 26 states have internal predecessors, (182), 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-17 03:01:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 740 transitions. [2024-11-17 03:01:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 03:01:14,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:14,449 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-17 03:01:14,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-17 03:01:14,649 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-17 03:01:14,650 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr214REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:14,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash 248989700, now seen corresponding path program 1 times [2024-11-17 03:01:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137891333] [2024-11-17 03:01:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:15,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:15,524 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-17 03:01:15,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:15,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137891333] [2024-11-17 03:01:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137891333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:15,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811264188] [2024-11-17 03:01:15,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:15,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:01:15,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:01:15,528 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-17 03:01:15,530 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-17 03:01:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:15,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-17 03:01:15,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:15,764 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-17 03:01:15,859 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 03:01:15,860 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-17 03:01:15,864 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-17 03:01:15,887 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-17 03:01:15,894 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-17 03:01:15,964 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-17 03:01:15,968 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-17 03:01:16,070 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:16,071 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-17 03:01:16,078 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-17 03:01:16,154 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:16,155 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-17 03:01:16,161 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-17 03:01:16,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:16,216 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-17 03:01:16,224 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-17 03:01:16,239 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-17 03:01:16,244 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-17 03:01:16,262 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-17 03:01:16,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:16,325 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1498 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1499) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1498) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1499 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1499) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 03:01:16,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1497) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1499) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1496))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1497) .cse1 v_ArrVal_1499) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1498) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-17 03:01:16,409 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1496))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1497) .cse1 v_ArrVal_1499) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1498) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1497) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1499) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-17 03:01:16,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1505))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1504) .cse0 v_ArrVal_1497) (select (select (store .cse1 .cse0 v_ArrVal_1496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1499))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1505))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1496))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1504) .cse3 v_ArrVal_1497) .cse4 v_ArrVal_1499) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1498) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-17 03:01:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811264188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:16,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:01:16,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2024-11-17 03:01:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285460213] [2024-11-17 03:01:16,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:01:16,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-17 03:01:16,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-17 03:01:16,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=554, Unknown=13, NotChecked=204, Total=870 [2024-11-17 03:01:16,472 INFO L87 Difference]: Start difference. First operand 644 states and 740 transitions. Second operand has 23 states, 20 states have (on average 7.55) internal successors, (151), 22 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-17 03:01:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:18,941 INFO L93 Difference]: Finished difference Result 646 states and 744 transitions. [2024-11-17 03:01:18,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 03:01:18,942 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.55) internal successors, (151), 22 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 95 [2024-11-17 03:01:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:18,944 INFO L225 Difference]: With dead ends: 646 [2024-11-17 03:01:18,944 INFO L226 Difference]: Without dead ends: 646 [2024-11-17 03:01:18,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=894, Unknown=14, NotChecked=260, Total=1332 [2024-11-17 03:01:18,945 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 517 mSDsluCounter, 3821 mSDsCounter, 0 mSdLazyCounter, 4766 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 4803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 4766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:18,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 4179 Invalid, 4803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 4766 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 03:01:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-17 03:01:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 631. [2024-11-17 03:01:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 453 states have (on average 1.5452538631346577) internal successors, (700), 624 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 726 transitions. [2024-11-17 03:01:18,955 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 726 transitions. Word has length 95 [2024-11-17 03:01:18,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:18,955 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 726 transitions. [2024-11-17 03:01:18,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.55) internal successors, (151), 22 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-17 03:01:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 726 transitions. [2024-11-17 03:01:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-17 03:01:18,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:18,957 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] [2024-11-17 03:01:18,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 03:01:19,160 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-17 03:01:19,161 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:19,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash -849261469, now seen corresponding path program 1 times [2024-11-17 03:01:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820950130] [2024-11-17 03:01:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:19,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:19,758 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-17 03:01:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:19,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820950130] [2024-11-17 03:01:19,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820950130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:19,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:19,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-17 03:01:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184755203] [2024-11-17 03:01:19,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:19,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 03:01:19,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:19,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 03:01:19,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-17 03:01:19,761 INFO L87 Difference]: Start difference. First operand 631 states and 726 transitions. Second operand has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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-17 03:01:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:20,992 INFO L93 Difference]: Finished difference Result 650 states and 748 transitions. [2024-11-17 03:01:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 03:01:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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 97 [2024-11-17 03:01:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:20,995 INFO L225 Difference]: With dead ends: 650 [2024-11-17 03:01:20,995 INFO L226 Difference]: Without dead ends: 650 [2024-11-17 03:01:20,995 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-17 03:01:20,996 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 544 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 2922 SdHoareTripleChecker+Invalid, 2463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:20,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 2922 Invalid, 2463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2439 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 03:01:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-17 03:01:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 646. [2024-11-17 03:01:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 467 states have (on average 1.5331905781584583) internal successors, (716), 638 states have internal predecessors, (716), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 743 transitions. [2024-11-17 03:01:21,005 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 743 transitions. Word has length 97 [2024-11-17 03:01:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:21,006 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 743 transitions. [2024-11-17 03:01:21,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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-17 03:01:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 743 transitions. [2024-11-17 03:01:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-17 03:01:21,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:21,007 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] [2024-11-17 03:01:21,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 03:01:21,007 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr210REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash -849261468, now seen corresponding path program 1 times [2024-11-17 03:01:21,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:21,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869855044] [2024-11-17 03:01:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:21,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:21,807 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-17 03:01:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:21,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869855044] [2024-11-17 03:01:21,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869855044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:21,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 03:01:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766308739] [2024-11-17 03:01:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:21,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 03:01:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:21,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 03:01:21,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-17 03:01:21,811 INFO L87 Difference]: Start difference. First operand 646 states and 743 transitions. Second operand has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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-17 03:01:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:23,079 INFO L93 Difference]: Finished difference Result 649 states and 747 transitions. [2024-11-17 03:01:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:01:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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 97 [2024-11-17 03:01:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:23,081 INFO L225 Difference]: With dead ends: 649 [2024-11-17 03:01:23,081 INFO L226 Difference]: Without dead ends: 649 [2024-11-17 03:01:23,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-17 03:01:23,082 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 523 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 2296 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:23,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 2296 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 03:01:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-17 03:01:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2024-11-17 03:01:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 467 states have (on average 1.531049250535332) internal successors, (715), 638 states have internal predecessors, (715), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 742 transitions. [2024-11-17 03:01:23,090 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 742 transitions. Word has length 97 [2024-11-17 03:01:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:23,090 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 742 transitions. [2024-11-17 03:01:23,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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-17 03:01:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 742 transitions. [2024-11-17 03:01:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 03:01:23,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:23,091 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-17 03:01:23,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 03:01:23,091 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:23,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash 244097132, now seen corresponding path program 1 times [2024-11-17 03:01:23,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:23,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167683532] [2024-11-17 03:01:23,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:23,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:23,686 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-17 03:01:23,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167683532] [2024-11-17 03:01:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167683532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084103075] [2024-11-17 03:01:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:23,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:01:23,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:01:23,689 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-17 03:01:23,690 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-17 03:01:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:23,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-17 03:01:23,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:23,944 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-17 03:01:24,031 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 03:01:24,031 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-17 03:01:24,037 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-17 03:01:24,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:24,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 03:01:24,155 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:24,156 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-17 03:01:24,202 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:24,203 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-17 03:01:24,247 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:24,248 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-17 03:01:24,257 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-17 03:01:24,260 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-17 03:01:24,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:24,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1810 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 03:01:24,311 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1810 (Array Int Int)) (v_ArrVal_1809 (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$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1809))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1810)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 03:01:24,348 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1810 (Array Int Int)) (v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1808 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1808))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1809)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1810)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 03:01:24,426 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-17 03:01:24,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-17 03:01:24,434 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1810 (Array Int Int)) (v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1808 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1813))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1808)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1809)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1810)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-17 03:01:24,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084103075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:24,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:01:24,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2024-11-17 03:01:24,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634964955] [2024-11-17 03:01:24,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:01:24,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 03:01:24,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:24,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 03:01:24,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=499, Unknown=21, NotChecked=196, Total=812 [2024-11-17 03:01:24,437 INFO L87 Difference]: Start difference. First operand 646 states and 742 transitions. Second operand has 22 states, 20 states have (on average 7.4) internal successors, (148), 21 states have internal predecessors, (148), 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-17 03:01:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:25,802 INFO L93 Difference]: Finished difference Result 648 states and 746 transitions. [2024-11-17 03:01:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 03:01:25,803 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.4) internal successors, (148), 21 states have internal predecessors, (148), 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 98 [2024-11-17 03:01:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:25,805 INFO L225 Difference]: With dead ends: 648 [2024-11-17 03:01:25,805 INFO L226 Difference]: Without dead ends: 648 [2024-11-17 03:01:25,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=991, Unknown=29, NotChecked=276, Total=1482 [2024-11-17 03:01:25,806 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 512 mSDsluCounter, 3256 mSDsCounter, 0 mSdLazyCounter, 2979 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:25,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 3611 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2979 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 03:01:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-17 03:01:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2024-11-17 03:01:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 467 states have (on average 1.5289079229122056) internal successors, (714), 637 states have internal predecessors, (714), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 741 transitions. [2024-11-17 03:01:25,815 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 741 transitions. Word has length 98 [2024-11-17 03:01:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:25,815 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 741 transitions. [2024-11-17 03:01:25,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.4) internal successors, (148), 21 states have internal predecessors, (148), 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-17 03:01:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 741 transitions. [2024-11-17 03:01:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 03:01:25,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:25,817 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-17 03:01:25,837 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-17 03:01:26,017 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-17 03:01:26,018 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr210REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:26,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash 244097133, now seen corresponding path program 1 times [2024-11-17 03:01:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:26,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453520711] [2024-11-17 03:01:26,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:26,881 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-17 03:01:26,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453520711] [2024-11-17 03:01:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453520711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614593199] [2024-11-17 03:01:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:26,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:01:26,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:01:26,883 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-17 03:01:26,884 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-17 03:01:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:27,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-17 03:01:27,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:27,131 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-17 03:01:27,219 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-17 03:01:27,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 03:01:27,227 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-17 03:01:27,235 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-17 03:01:27,240 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-17 03:01:27,302 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-17 03:01:27,305 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-17 03:01:27,384 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:27,384 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-17 03:01:27,390 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-17 03:01:27,455 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:27,456 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-17 03:01:27,462 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-17 03:01:27,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:27,517 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-17 03:01:27,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 03:01:27,580 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:27,581 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-17 03:01:27,585 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-17 03:01:27,601 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-17 03:01:27,605 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-17 03:01:27,607 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-17 03:01:27,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:27,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1984 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1984 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 03:01:27,728 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1982))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1983) .cse0 v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1983) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1982) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-17 03:01:27,741 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1983) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1982) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1982))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1983) .cse2 v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-17 03:01:27,765 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1980))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1982))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1981) .cse0 v_ArrVal_1983) .cse1 v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1980))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1981) .cse5 v_ArrVal_1983) (select (select (store .cse6 .cse5 v_ArrVal_1982) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1984))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-17 03:01:27,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1980))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1982))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1981) .cse1 v_ArrVal_1983) .cse2 v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1980))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1981) .cse6 v_ArrVal_1983) (select (select (store .cse7 .cse6 v_ArrVal_1982) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1984))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-17 03:01:27,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1990))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1980))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1991) .cse0 v_ArrVal_1981) .cse1 v_ArrVal_1983) (select (select (store .cse2 .cse1 v_ArrVal_1982) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1984))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1990))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1980))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1982))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1991) .cse5 v_ArrVal_1981) .cse6 v_ArrVal_1983) .cse7 v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-17 03:01:27,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614593199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:27,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:01:27,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 20 [2024-11-17 03:01:27,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102081117] [2024-11-17 03:01:27,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:01:27,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 03:01:27,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:27,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 03:01:27,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=470, Unknown=11, NotChecked=294, Total=870 [2024-11-17 03:01:27,875 INFO L87 Difference]: Start difference. First operand 645 states and 741 transitions. Second operand has 21 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 20 states have internal predecessors, (147), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 03:01:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:30,310 INFO L93 Difference]: Finished difference Result 647 states and 745 transitions. [2024-11-17 03:01:30,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 03:01:30,311 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 20 states have internal predecessors, (147), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2024-11-17 03:01:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:30,313 INFO L225 Difference]: With dead ends: 647 [2024-11-17 03:01:30,313 INFO L226 Difference]: Without dead ends: 647 [2024-11-17 03:01:30,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=961, Unknown=12, NotChecked=414, Total=1560 [2024-11-17 03:01:30,314 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 506 mSDsluCounter, 3453 mSDsCounter, 0 mSdLazyCounter, 4530 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 3806 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:30,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 3806 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4530 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 03:01:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-17 03:01:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 629. [2024-11-17 03:01:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 453 states have (on average 1.5408388520971303) internal successors, (698), 622 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 724 transitions. [2024-11-17 03:01:30,323 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 724 transitions. Word has length 98 [2024-11-17 03:01:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:30,323 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 724 transitions. [2024-11-17 03:01:30,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 20 states have internal predecessors, (147), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 03:01:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 724 transitions. [2024-11-17 03:01:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 03:01:30,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:30,324 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-17 03:01:30,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-17 03:01:30,525 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-17 03:01:30,525 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:30,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:30,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1781856733, now seen corresponding path program 1 times [2024-11-17 03:01:30,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:30,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248758104] [2024-11-17 03:01:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:31,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:31,254 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-17 03:01:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:31,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248758104] [2024-11-17 03:01:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248758104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:31,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:31,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-17 03:01:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562558187] [2024-11-17 03:01:31,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:31,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 03:01:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:31,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 03:01:31,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-17 03:01:31,256 INFO L87 Difference]: Start difference. First operand 629 states and 724 transitions. Second operand has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:01:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:32,476 INFO L93 Difference]: Finished difference Result 652 states and 750 transitions. [2024-11-17 03:01:32,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 03:01:32,476 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-17 03:01:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:32,478 INFO L225 Difference]: With dead ends: 652 [2024-11-17 03:01:32,478 INFO L226 Difference]: Without dead ends: 652 [2024-11-17 03:01:32,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-17 03:01:32,479 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 539 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 2941 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:32,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 2941 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 03:01:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-17 03:01:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 648. [2024-11-17 03:01:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 471 states have (on average 1.5244161358811041) internal successors, (718), 640 states have internal predecessors, (718), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 745 transitions. [2024-11-17 03:01:32,487 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 745 transitions. Word has length 101 [2024-11-17 03:01:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:32,488 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 745 transitions. [2024-11-17 03:01:32,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:01:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 745 transitions. [2024-11-17 03:01:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 03:01:32,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:32,489 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-17 03:01:32,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-17 03:01:32,489 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr206REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:32,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1781856734, now seen corresponding path program 1 times [2024-11-17 03:01:32,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:32,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895241528] [2024-11-17 03:01:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:33,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:33,621 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-17 03:01:33,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:33,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895241528] [2024-11-17 03:01:33,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895241528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:33,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:33,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-17 03:01:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890172087] [2024-11-17 03:01:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:33,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 03:01:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 03:01:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-17 03:01:33,623 INFO L87 Difference]: Start difference. First operand 648 states and 745 transitions. Second operand has 18 states, 16 states have (on average 6.1875) internal successors, (99), 17 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-17 03:01:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:35,390 INFO L93 Difference]: Finished difference Result 651 states and 749 transitions. [2024-11-17 03:01:35,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 03:01:35,390 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.1875) internal successors, (99), 17 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-17 03:01:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:35,392 INFO L225 Difference]: With dead ends: 651 [2024-11-17 03:01:35,392 INFO L226 Difference]: Without dead ends: 651 [2024-11-17 03:01:35,393 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-17 03:01:35,393 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 518 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 3547 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 3041 SdHoareTripleChecker+Invalid, 3573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:35,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 3041 Invalid, 3573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3547 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 03:01:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-17 03:01:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 648. [2024-11-17 03:01:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 471 states have (on average 1.5222929936305734) internal successors, (717), 640 states have internal predecessors, (717), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 744 transitions. [2024-11-17 03:01:35,401 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 744 transitions. Word has length 101 [2024-11-17 03:01:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:35,402 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 744 transitions. [2024-11-17 03:01:35,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.1875) internal successors, (99), 17 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-17 03:01:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 744 transitions. [2024-11-17 03:01:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 03:01:35,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:35,403 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-17 03:01:35,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-17 03:01:35,403 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:35,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:35,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1105911450, now seen corresponding path program 1 times [2024-11-17 03:01:35,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:35,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341081040] [2024-11-17 03:01:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:36,062 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-17 03:01:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341081040] [2024-11-17 03:01:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341081040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709864340] [2024-11-17 03:01:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:36,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:01:36,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:01:36,065 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-17 03:01:36,067 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-17 03:01:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:36,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 03:01:36,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:36,322 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-17 03:01:36,399 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 03:01:36,400 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-17 03:01:36,404 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-17 03:01:36,479 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:36,480 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-17 03:01:36,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:36,522 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-17 03:01:36,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:36,569 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-17 03:01:36,616 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:36,617 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-17 03:01:36,652 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:36,652 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-17 03:01:36,660 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-17 03:01:36,672 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 03:01:36,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-17 03:01:36,674 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-17 03:01:36,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:37,238 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-17 03:01:37,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-17 03:01:37,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709864340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:37,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:01:37,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 23 [2024-11-17 03:01:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805054646] [2024-11-17 03:01:37,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:01:37,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 03:01:37,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:01:37,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 03:01:37,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=989, Unknown=50, NotChecked=0, Total=1190 [2024-11-17 03:01:37,320 INFO L87 Difference]: Start difference. First operand 648 states and 744 transitions. Second operand has 24 states, 22 states have (on average 7.0) internal successors, (154), 23 states have internal predecessors, (154), 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-17 03:01:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:39,223 INFO L93 Difference]: Finished difference Result 650 states and 748 transitions. [2024-11-17 03:01:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 03:01:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 7.0) internal successors, (154), 23 states have internal predecessors, (154), 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-17 03:01:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:39,226 INFO L225 Difference]: With dead ends: 650 [2024-11-17 03:01:39,226 INFO L226 Difference]: Without dead ends: 650 [2024-11-17 03:01:39,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=1740, Unknown=50, NotChecked=0, Total=2070 [2024-11-17 03:01:39,227 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 504 mSDsluCounter, 4479 mSDsCounter, 0 mSdLazyCounter, 4056 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 4833 SdHoareTripleChecker+Invalid, 4092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:39,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 4833 Invalid, 4092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4056 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 03:01:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-17 03:01:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 647. [2024-11-17 03:01:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 471 states have (on average 1.5201698513800426) internal successors, (716), 639 states have internal predecessors, (716), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 743 transitions. [2024-11-17 03:01:39,234 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 743 transitions. Word has length 102 [2024-11-17 03:01:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:39,235 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 743 transitions. [2024-11-17 03:01:39,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 7.0) internal successors, (154), 23 states have internal predecessors, (154), 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-17 03:01:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 743 transitions. [2024-11-17 03:01:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 03:01:39,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:39,235 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-17 03:01:39,255 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-17 03:01:39,436 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-17 03:01:39,437 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr206REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-17 03:01:39,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1105911449, now seen corresponding path program 1 times [2024-11-17 03:01:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:01:39,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977378597] [2024-11-17 03:01:39,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:39,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:01:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:40,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 03:01:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:40,562 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-17 03:01:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:01:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977378597] [2024-11-17 03:01:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977378597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:01:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752860748] [2024-11-17 03:01:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:40,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:01:40,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:01:40,566 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-17 03:01:40,568 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-17 03:01:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:40,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-17 03:01:40,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:40,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-17 03:01:40,897 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-17 03:01:40,911 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 03:01:40,911 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-17 03:01:40,941 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-17 03:01:40,945 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-17 03:01:41,037 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-17 03:01:41,040 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-17 03:01:41,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:41,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-17 03:01:41,217 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-17 03:01:41,303 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:41,304 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-17 03:01:41,310 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-17 03:01:41,400 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:41,400 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-17 03:01:41,409 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-17 03:01:41,490 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:41,490 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-17 03:01:41,494 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-17 03:01:41,585 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:01:41,586 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-17 03:01:41,595 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-17 03:01:41,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-17 03:01:41,622 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-17 03:01:41,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:01:41,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 03:01:41,688 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-17 03:01:41,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-17 03:01:41,691 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-17 03:01:41,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:42,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2521 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2517))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2520))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2518) .cse0 v_ArrVal_2519) .cse1 v_ArrVal_2522) (select (select (store .cse2 .cse1 v_ArrVal_2521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2524))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (v_ArrVal_2523 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2521 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2525 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2517))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2520))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2521))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2518) .cse5 v_ArrVal_2519) .cse6 v_ArrVal_2522) .cse7 v_ArrVal_2524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2525) (select (select (store .cse8 .cse7 v_ArrVal_2523) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-17 03:01:42,811 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2521 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2517))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2520))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2518) .cse1 v_ArrVal_2519) .cse2 v_ArrVal_2522) (select (select (store .cse3 .cse2 v_ArrVal_2521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2524))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (v_ArrVal_2523 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2521 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (or (forall ((v_ArrVal_2525 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2517))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2520))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2521))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2518) .cse6 v_ArrVal_2519) .cse7 v_ArrVal_2522) .cse8 v_ArrVal_2524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2525) (select (select (store .cse9 .cse8 v_ArrVal_2523) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))))))) is different from false