./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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_FNV_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 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:46:30,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:46:30,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:46:30,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:46:30,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:46:30,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:46:30,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:46:30,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:46:30,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:46:30,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:46:30,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:46:30,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:46:30,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:46:30,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:46:30,283 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:46:30,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:46:30,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:46:30,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:46:30,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:46:30,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:46:30,284 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:46:30,285 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:46:30,285 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:46:30,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:46:30,285 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:46:30,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:46:30,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:46:30,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:46:30,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:46:30,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:46:30,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:46:30,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:46:30,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:46:30,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:46:30,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:46:30,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:46:30,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:46:30,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:46:30,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:46:30,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:46:30,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:46:30,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:46:30,288 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 -> 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f [2024-11-17 02:46:30,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:46:30,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:46:30,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:46:30,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:46:30,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:46:30,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2024-11-17 02:46:31,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:46:31,958 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:46:31,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2024-11-17 02:46:31,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158ab63ef/7229995df8804349830f27878fc79500/FLAG03f45c286 [2024-11-17 02:46:32,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158ab63ef/7229995df8804349830f27878fc79500 [2024-11-17 02:46:32,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:46:32,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:46:32,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:46:32,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:46:32,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:46:32,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104d38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32, skipping insertion in model container [2024-11-17 02:46:32,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:46:32,623 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 02:46:32,655 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 02:46:32,659 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 02:46:32,664 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 02:46:32,671 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 02:46:32,685 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 02:46:32,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:46:32,699 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:46:32,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:46:32,788 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:46:32,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32 WrapperNode [2024-11-17 02:46:32,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:46:32,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:46:32,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:46:32,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:46:32,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,847 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 831 [2024-11-17 02:46:32,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:46:32,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:46:32,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:46:32,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:46:32,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,925 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-17 02:46:32,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:46:32,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:46:32,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:46:32,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:46:32,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (1/1) ... [2024-11-17 02:46:32,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:46:32,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:32,999 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 02:46:33,001 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 02:46:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 02:46:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 02:46:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 02:46:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 02:46:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 02:46:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 02:46:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:46:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:46:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:46:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:46:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:46:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:46:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:46:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:46:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:46:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:46:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:46:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 02:46:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 02:46:33,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:46:33,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:46:33,197 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:46:33,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:46:34,456 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2024-11-17 02:46:34,457 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:46:34,502 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:46:34,502 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 02:46:34,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:46:34 BoogieIcfgContainer [2024-11-17 02:46:34,503 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:46:34,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:46:34,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:46:34,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:46:34,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:46:32" (1/3) ... [2024-11-17 02:46:34,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21778615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:46:34, skipping insertion in model container [2024-11-17 02:46:34,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:46:32" (2/3) ... [2024-11-17 02:46:34,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21778615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:46:34, skipping insertion in model container [2024-11-17 02:46:34,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:46:34" (3/3) ... [2024-11-17 02:46:34,513 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test1-1.i [2024-11-17 02:46:34,526 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:46:34,526 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-17 02:46:34,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:46:34,579 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;@3e63974e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:46:34,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-17 02:46:34,586 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 02:46:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 02:46:34,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:34,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 02:46:34,591 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 02:46:34,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1074001219, now seen corresponding path program 1 times [2024-11-17 02:46:34,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:34,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610920182] [2024-11-17 02:46:34,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:34,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:34,712 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 02:46:34,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:34,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610920182] [2024-11-17 02:46:34,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610920182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:34,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:34,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:46:34,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110538648] [2024-11-17 02:46:34,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:34,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 02:46:34,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:34,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 02:46:34,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 02:46:34,739 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 02:46:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:34,822 INFO L93 Difference]: Finished difference Result 761 states and 868 transitions. [2024-11-17 02:46:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 02:46:34,824 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 02:46:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:34,841 INFO L225 Difference]: With dead ends: 761 [2024-11-17 02:46:34,843 INFO L226 Difference]: Without dead ends: 758 [2024-11-17 02:46:34,845 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 02:46:34,847 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 02:46:34,847 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 02:46:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-17 02:46:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2024-11-17 02:46:34,894 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 02:46:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 865 transitions. [2024-11-17 02:46:34,898 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 865 transitions. Word has length 6 [2024-11-17 02:46:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:34,898 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 865 transitions. [2024-11-17 02:46:34,898 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 02:46:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 865 transitions. [2024-11-17 02:46:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 02:46:34,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:34,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 02:46:34,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 02:46:34,899 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 02:46:34,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:34,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1074001188, now seen corresponding path program 1 times [2024-11-17 02:46:34,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:34,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427457921] [2024-11-17 02:46:34,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:34,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:35,005 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 02:46:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427457921] [2024-11-17 02:46:35,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427457921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:35,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:35,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:46:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795030019] [2024-11-17 02:46:35,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:35,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:46:35,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:35,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:46:35,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:46:35,008 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 02:46:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:35,468 INFO L93 Difference]: Finished difference Result 712 states and 820 transitions. [2024-11-17 02:46:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:46:35,469 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 02:46:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:35,471 INFO L225 Difference]: With dead ends: 712 [2024-11-17 02:46:35,471 INFO L226 Difference]: Without dead ends: 712 [2024-11-17 02:46:35,472 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 02:46:35,473 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 707 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:35,473 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.4s Time] [2024-11-17 02:46:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-17 02:46:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 709. [2024-11-17 02:46:35,486 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 02:46:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 816 transitions. [2024-11-17 02:46:35,488 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 816 transitions. Word has length 6 [2024-11-17 02:46:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:35,489 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 816 transitions. [2024-11-17 02:46:35,489 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 02:46:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 816 transitions. [2024-11-17 02:46:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 02:46:35,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:35,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 02:46:35,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 02:46:35,491 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 02:46:35,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1074001187, now seen corresponding path program 1 times [2024-11-17 02:46:35,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:35,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629782860] [2024-11-17 02:46:35,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:35,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:35,575 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 02:46:35,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:35,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629782860] [2024-11-17 02:46:35,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629782860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:35,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:46:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709579306] [2024-11-17 02:46:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:35,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:46:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:35,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:46:35,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:46:35,580 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 02:46:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:35,958 INFO L93 Difference]: Finished difference Result 790 states and 903 transitions. [2024-11-17 02:46:35,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:46:35,959 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 02:46:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:35,962 INFO L225 Difference]: With dead ends: 790 [2024-11-17 02:46:35,962 INFO L226 Difference]: Without dead ends: 790 [2024-11-17 02:46:35,963 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 02:46:35,963 INFO L432 NwaCegarLoop]: 667 mSDtfsCounter, 418 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:35,964 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.4s Time] [2024-11-17 02:46:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-17 02:46:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 741. [2024-11-17 02:46:35,978 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 02:46:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 887 transitions. [2024-11-17 02:46:35,982 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 887 transitions. Word has length 6 [2024-11-17 02:46:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:35,982 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 887 transitions. [2024-11-17 02:46:35,982 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 02:46:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 887 transitions. [2024-11-17 02:46:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 02:46:35,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:35,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:35,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 02:46:35,983 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 02:46:35,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1351003848, now seen corresponding path program 1 times [2024-11-17 02:46:35,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:35,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478506945] [2024-11-17 02:46:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:36,008 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 02:46:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:36,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478506945] [2024-11-17 02:46:36,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478506945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:36,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:36,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848194928] [2024-11-17 02:46:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:36,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:46:36,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:36,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:46:36,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:46:36,010 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 02:46:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:36,075 INFO L93 Difference]: Finished difference Result 1430 states and 1702 transitions. [2024-11-17 02:46:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:46:36,075 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 02:46:36,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:36,080 INFO L225 Difference]: With dead ends: 1430 [2024-11-17 02:46:36,080 INFO L226 Difference]: Without dead ends: 1430 [2024-11-17 02:46:36,081 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 02:46:36,081 INFO L432 NwaCegarLoop]: 1009 mSDtfsCounter, 726 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:36,082 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.0s Time] [2024-11-17 02:46:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-17 02:46:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 743. [2024-11-17 02:46:36,094 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 02:46:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 889 transitions. [2024-11-17 02:46:36,097 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 889 transitions. Word has length 8 [2024-11-17 02:46:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:36,097 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 889 transitions. [2024-11-17 02:46:36,097 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 02:46:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 889 transitions. [2024-11-17 02:46:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 02:46:36,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:36,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:36,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 02:46:36,098 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 02:46:36,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:36,099 INFO L85 PathProgramCache]: Analyzing trace with hash -673853147, now seen corresponding path program 1 times [2024-11-17 02:46:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812780825] [2024-11-17 02:46:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:36,159 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 02:46:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812780825] [2024-11-17 02:46:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812780825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:36,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:36,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:36,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830805903] [2024-11-17 02:46:36,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:36,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:36,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:36,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:36,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:36,162 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 02:46:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:36,636 INFO L93 Difference]: Finished difference Result 769 states and 942 transitions. [2024-11-17 02:46:36,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:46:36,637 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 02:46:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:36,639 INFO L225 Difference]: With dead ends: 769 [2024-11-17 02:46:36,639 INFO L226 Difference]: Without dead ends: 769 [2024-11-17 02:46:36,640 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 02:46:36,640 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 975 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:36,641 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.4s Time] [2024-11-17 02:46:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-17 02:46:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 720. [2024-11-17 02:46:36,650 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 02:46:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 866 transitions. [2024-11-17 02:46:36,651 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 866 transitions. Word has length 13 [2024-11-17 02:46:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:36,652 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 866 transitions. [2024-11-17 02:46:36,652 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 02:46:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 866 transitions. [2024-11-17 02:46:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 02:46:36,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:36,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:36,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 02:46:36,653 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 02:46:36,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash -673853146, now seen corresponding path program 1 times [2024-11-17 02:46:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:36,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516001971] [2024-11-17 02:46:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:36,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:36,709 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 02:46:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516001971] [2024-11-17 02:46:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516001971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:36,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:36,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:36,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239908240] [2024-11-17 02:46:36,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:36,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:46:36,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:36,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:46:36,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:46:36,719 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 02:46:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:36,761 INFO L93 Difference]: Finished difference Result 645 states and 763 transitions. [2024-11-17 02:46:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:46:36,762 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 02:46:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:36,764 INFO L225 Difference]: With dead ends: 645 [2024-11-17 02:46:36,764 INFO L226 Difference]: Without dead ends: 645 [2024-11-17 02:46:36,765 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 02:46:36,765 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 02:46:36,767 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 02:46:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-17 02:46:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2024-11-17 02:46:36,775 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 02:46:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 763 transitions. [2024-11-17 02:46:36,778 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 763 transitions. Word has length 13 [2024-11-17 02:46:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:36,778 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 763 transitions. [2024-11-17 02:46:36,778 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 02:46:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 763 transitions. [2024-11-17 02:46:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 02:46:36,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:36,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:36,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 02:46:36,779 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 02:46:36,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash 967063977, now seen corresponding path program 1 times [2024-11-17 02:46:36,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:36,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804013676] [2024-11-17 02:46:36,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:36,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:36,818 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 02:46:36,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:36,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804013676] [2024-11-17 02:46:36,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804013676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:36,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91467189] [2024-11-17 02:46:36,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:36,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:36,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:36,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:36,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:36,821 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 02:46:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:36,878 INFO L93 Difference]: Finished difference Result 627 states and 738 transitions. [2024-11-17 02:46:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:46:36,879 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 02:46:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:36,881 INFO L225 Difference]: With dead ends: 627 [2024-11-17 02:46:36,881 INFO L226 Difference]: Without dead ends: 627 [2024-11-17 02:46:36,881 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 02:46:36,883 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 41 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:36,883 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.0s Time] [2024-11-17 02:46:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-17 02:46:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 624. [2024-11-17 02:46:36,890 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 02:46:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 735 transitions. [2024-11-17 02:46:36,892 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 735 transitions. Word has length 15 [2024-11-17 02:46:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:36,892 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 735 transitions. [2024-11-17 02:46:36,892 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 02:46:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 735 transitions. [2024-11-17 02:46:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 02:46:36,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:36,893 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 02:46:36,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 02:46:36,893 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 02:46:36,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash 350292927, now seen corresponding path program 1 times [2024-11-17 02:46:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:36,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367428433] [2024-11-17 02:46:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:37,026 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 02:46:37,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367428433] [2024-11-17 02:46:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367428433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:37,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:37,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800114720] [2024-11-17 02:46:37,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:37,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:37,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:37,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:37,028 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 02:46:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:37,457 INFO L93 Difference]: Finished difference Result 718 states and 823 transitions. [2024-11-17 02:46:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:46:37,457 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 02:46:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:37,459 INFO L225 Difference]: With dead ends: 718 [2024-11-17 02:46:37,459 INFO L226 Difference]: Without dead ends: 718 [2024-11-17 02:46:37,459 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 02:46:37,460 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 423 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:37,462 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.4s Time] [2024-11-17 02:46:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-17 02:46:37,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 620. [2024-11-17 02:46:37,472 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 02:46:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 731 transitions. [2024-11-17 02:46:37,473 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 731 transitions. Word has length 29 [2024-11-17 02:46:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:37,475 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 731 transitions. [2024-11-17 02:46:37,475 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 02:46:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 731 transitions. [2024-11-17 02:46:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-17 02:46:37,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:37,477 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 02:46:37,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 02:46:37,477 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 02:46:37,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1284675059, now seen corresponding path program 1 times [2024-11-17 02:46:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442243112] [2024-11-17 02:46:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:37,556 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 02:46:37,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442243112] [2024-11-17 02:46:37,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442243112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:37,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:37,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86244665] [2024-11-17 02:46:37,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:37,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:37,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:37,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:37,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:37,562 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 02:46:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:37,624 INFO L93 Difference]: Finished difference Result 620 states and 727 transitions. [2024-11-17 02:46:37,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:46:37,624 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 02:46:37,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:37,626 INFO L225 Difference]: With dead ends: 620 [2024-11-17 02:46:37,626 INFO L226 Difference]: Without dead ends: 620 [2024-11-17 02:46:37,626 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 02:46:37,627 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.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:37,627 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.0s Time] [2024-11-17 02:46:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-17 02:46:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2024-11-17 02:46:37,634 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 02:46:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 727 transitions. [2024-11-17 02:46:37,636 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 727 transitions. Word has length 64 [2024-11-17 02:46:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:37,637 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 727 transitions. [2024-11-17 02:46:37,637 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 02:46:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 727 transitions. [2024-11-17 02:46:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 02:46:37,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:37,639 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 02:46:37,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 02:46:37,640 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 02:46:37,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:37,640 INFO L85 PathProgramCache]: Analyzing trace with hash -319592789, now seen corresponding path program 1 times [2024-11-17 02:46:37,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:37,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580454455] [2024-11-17 02:46:37,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:37,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:37,714 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 02:46:37,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:37,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580454455] [2024-11-17 02:46:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580454455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:37,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:37,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:37,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213595639] [2024-11-17 02:46:37,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:37,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:46:37,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:46:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:46:37,717 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 02:46:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:37,782 INFO L93 Difference]: Finished difference Result 714 states and 848 transitions. [2024-11-17 02:46:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:46:37,783 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 02:46:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:37,785 INFO L225 Difference]: With dead ends: 714 [2024-11-17 02:46:37,785 INFO L226 Difference]: Without dead ends: 714 [2024-11-17 02:46:37,785 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 02:46:37,785 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.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:37,786 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.0s Time] [2024-11-17 02:46:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-17 02:46:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2024-11-17 02:46:37,792 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 02:46:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 848 transitions. [2024-11-17 02:46:37,794 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 848 transitions. Word has length 72 [2024-11-17 02:46:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:37,794 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 848 transitions. [2024-11-17 02:46:37,794 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 02:46:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 848 transitions. [2024-11-17 02:46:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-17 02:46:37,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:37,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:37,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 02:46:37,795 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 02:46:37,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash 951926617, now seen corresponding path program 1 times [2024-11-17 02:46:37,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:37,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855730572] [2024-11-17 02:46:37,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:37,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:38,158 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 02:46:38,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:38,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855730572] [2024-11-17 02:46:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855730572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:38,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:38,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 02:46:38,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697866640] [2024-11-17 02:46:38,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:38,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:46:38,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:38,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:46:38,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:46:38,161 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 02:46:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:38,631 INFO L93 Difference]: Finished difference Result 676 states and 810 transitions. [2024-11-17 02:46:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:46:38,632 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 02:46:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:38,634 INFO L225 Difference]: With dead ends: 676 [2024-11-17 02:46:38,634 INFO L226 Difference]: Without dead ends: 676 [2024-11-17 02:46:38,634 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 02:46:38,634 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 950 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:38,635 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.5s Time] [2024-11-17 02:46:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-17 02:46:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 634. [2024-11-17 02:46:38,643 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 02:46:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 729 transitions. [2024-11-17 02:46:38,644 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 729 transitions. Word has length 75 [2024-11-17 02:46:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:38,645 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 729 transitions. [2024-11-17 02:46:38,645 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 02:46:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 729 transitions. [2024-11-17 02:46:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-17 02:46:38,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:38,648 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 02:46:38,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 02:46:38,648 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 02:46:38,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:38,649 INFO L85 PathProgramCache]: Analyzing trace with hash -352270282, now seen corresponding path program 1 times [2024-11-17 02:46:38,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:38,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106857351] [2024-11-17 02:46:38,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:38,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:38,858 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 02:46:38,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:38,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106857351] [2024-11-17 02:46:38,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106857351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:38,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:38,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732706250] [2024-11-17 02:46:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:38,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:46:38,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:38,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:46:38,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:46:38,860 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 02:46:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:39,269 INFO L93 Difference]: Finished difference Result 633 states and 728 transitions. [2024-11-17 02:46:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:46:39,270 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 02:46:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:39,272 INFO L225 Difference]: With dead ends: 633 [2024-11-17 02:46:39,272 INFO L226 Difference]: Without dead ends: 633 [2024-11-17 02:46:39,272 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 02:46:39,273 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 2 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:39,273 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.4s Time] [2024-11-17 02:46:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-17 02:46:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2024-11-17 02:46:39,280 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 02:46:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 728 transitions. [2024-11-17 02:46:39,282 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 728 transitions. Word has length 80 [2024-11-17 02:46:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:39,283 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 728 transitions. [2024-11-17 02:46:39,283 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 02:46:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 728 transitions. [2024-11-17 02:46:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-17 02:46:39,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:39,284 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 02:46:39,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 02:46:39,284 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 02:46:39,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -352270281, now seen corresponding path program 1 times [2024-11-17 02:46:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248644874] [2024-11-17 02:46:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:39,592 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 02:46:39,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:39,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248644874] [2024-11-17 02:46:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248644874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:39,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152544302] [2024-11-17 02:46:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:39,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:46:39,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:46:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:46:39,594 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 02:46:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:40,027 INFO L93 Difference]: Finished difference Result 632 states and 727 transitions. [2024-11-17 02:46:40,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:46:40,027 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 02:46:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:40,029 INFO L225 Difference]: With dead ends: 632 [2024-11-17 02:46:40,029 INFO L226 Difference]: Without dead ends: 632 [2024-11-17 02:46:40,029 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 02:46:40,030 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 1 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:40,030 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.4s Time] [2024-11-17 02:46:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-17 02:46:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2024-11-17 02:46:40,036 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 02:46:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 727 transitions. [2024-11-17 02:46:40,037 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 727 transitions. Word has length 80 [2024-11-17 02:46:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:40,037 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 727 transitions. [2024-11-17 02:46:40,038 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 02:46:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 727 transitions. [2024-11-17 02:46:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 02:46:40,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:40,038 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 02:46:40,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 02:46:40,039 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 02:46:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1454236493, now seen corresponding path program 1 times [2024-11-17 02:46:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:40,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803376767] [2024-11-17 02:46:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:40,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:40,204 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 02:46:40,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:40,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803376767] [2024-11-17 02:46:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803376767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:40,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:46:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335338009] [2024-11-17 02:46:40,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:46:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:40,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:46:40,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:46:40,206 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 02:46:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:40,829 INFO L93 Difference]: Finished difference Result 644 states and 742 transitions. [2024-11-17 02:46:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 02:46:40,829 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 02:46:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:40,832 INFO L225 Difference]: With dead ends: 644 [2024-11-17 02:46:40,832 INFO L226 Difference]: Without dead ends: 644 [2024-11-17 02:46:40,832 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 02:46:40,833 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 16 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:40,833 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.6s Time] [2024-11-17 02:46:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-17 02:46:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 638. [2024-11-17 02:46:40,841 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 02:46:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 737 transitions. [2024-11-17 02:46:40,843 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 737 transitions. Word has length 88 [2024-11-17 02:46:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:40,843 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 737 transitions. [2024-11-17 02:46:40,843 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 02:46:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 737 transitions. [2024-11-17 02:46:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 02:46:40,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:40,844 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 02:46:40,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 02:46:40,844 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 02:46:40,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1454236492, now seen corresponding path program 1 times [2024-11-17 02:46:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702695114] [2024-11-17 02:46:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:40,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:41,253 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 02:46:41,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:41,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702695114] [2024-11-17 02:46:41,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702695114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:41,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:41,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:46:41,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138675735] [2024-11-17 02:46:41,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:41,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:46:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:41,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:46:41,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:46:41,255 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 02:46:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:41,806 INFO L93 Difference]: Finished difference Result 638 states and 736 transitions. [2024-11-17 02:46:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:46:41,806 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 02:46:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:41,808 INFO L225 Difference]: With dead ends: 638 [2024-11-17 02:46:41,808 INFO L226 Difference]: Without dead ends: 638 [2024-11-17 02:46:41,809 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 02:46:41,809 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 17 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:41,809 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.5s Time] [2024-11-17 02:46:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-17 02:46:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2024-11-17 02:46:41,815 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 02:46:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 736 transitions. [2024-11-17 02:46:41,816 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 736 transitions. Word has length 88 [2024-11-17 02:46:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:41,817 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 736 transitions. [2024-11-17 02:46:41,817 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 02:46:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 736 transitions. [2024-11-17 02:46:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 02:46:41,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:41,818 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 02:46:41,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 02:46:41,818 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 02:46:41,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash 296042373, now seen corresponding path program 1 times [2024-11-17 02:46:41,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:41,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309857519] [2024-11-17 02:46:41,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:41,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:42,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:42,174 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 02:46:42,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309857519] [2024-11-17 02:46:42,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309857519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:42,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650162474] [2024-11-17 02:46:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:42,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:42,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:42,177 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 02:46:42,178 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 02:46:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:42,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 02:46:42,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:42,482 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:46:42,483 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 02:46:42,497 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 02:46:42,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:42,564 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 02:46:42,591 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 02:46:42,593 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 02:46:42,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:42,635 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-17 02:46:42,636 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 02:46:42,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-17 02:46:42,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650162474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:42,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2024-11-17 02:46:42,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272177785] [2024-11-17 02:46:42,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:42,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:46:42,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:42,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:46:42,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-17 02:46:42,647 INFO L87 Difference]: Start difference. First operand 638 states and 736 transitions. Second operand has 15 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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 02:46:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:43,860 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-17 02:46:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:46:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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 02:46:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:43,863 INFO L225 Difference]: With dead ends: 637 [2024-11-17 02:46:43,863 INFO L226 Difference]: Without dead ends: 637 [2024-11-17 02:46:43,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-17 02:46:43,864 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 538 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 3262 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:43,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 3262 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:46:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-17 02:46:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2024-11-17 02:46:43,870 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 02:46:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 735 transitions. [2024-11-17 02:46:43,871 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 735 transitions. Word has length 89 [2024-11-17 02:46:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:43,871 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 735 transitions. [2024-11-17 02:46:43,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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 02:46:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 735 transitions. [2024-11-17 02:46:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 02:46:43,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:43,872 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 02:46:43,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 02:46:44,076 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 02:46:44,077 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 02:46:44,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:44,078 INFO L85 PathProgramCache]: Analyzing trace with hash 296042374, now seen corresponding path program 1 times [2024-11-17 02:46:44,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:44,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990252563] [2024-11-17 02:46:44,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:44,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:44,602 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 02:46:44,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990252563] [2024-11-17 02:46:44,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990252563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297320429] [2024-11-17 02:46:44,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:44,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:44,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:44,604 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 02:46:44,605 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 02:46:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:44,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 02:46:44,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:44,861 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:46:44,862 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 02:46:44,868 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 02:46:44,888 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 02:46:44,893 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 02:46:44,954 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 02:46:44,957 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 02:46:45,044 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:45,044 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 02:46:45,047 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 02:46:45,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:46:45,082 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 02:46:45,097 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 02:46:45,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:45,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_642 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:46:45,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297320429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:45,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:45,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-17 02:46:45,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207549315] [2024-11-17 02:46:45,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:45,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 02:46:45,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:45,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 02:46:45,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-17 02:46:45,177 INFO L87 Difference]: Start difference. First operand 637 states and 735 transitions. Second operand has 19 states, 16 states have (on average 7.125) internal successors, (114), 18 states have internal predecessors, (114), 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 02:46:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:47,015 INFO L93 Difference]: Finished difference Result 644 states and 742 transitions. [2024-11-17 02:46:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:46:47,015 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.125) internal successors, (114), 18 states have internal predecessors, (114), 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 02:46:47,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:47,017 INFO L225 Difference]: With dead ends: 644 [2024-11-17 02:46:47,017 INFO L226 Difference]: Without dead ends: 644 [2024-11-17 02:46:47,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-17 02:46:47,032 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 534 mSDsluCounter, 3645 mSDsCounter, 0 mSdLazyCounter, 4302 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4005 SdHoareTripleChecker+Invalid, 4331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:47,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4005 Invalid, 4331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4302 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:46:47,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-17 02:46:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 635. [2024-11-17 02:46:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 453 states have (on average 1.554083885209713) internal successors, (704), 628 states have internal predecessors, (704), 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 02:46:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 730 transitions. [2024-11-17 02:46:47,041 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 730 transitions. Word has length 89 [2024-11-17 02:46:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:47,041 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 730 transitions. [2024-11-17 02:46:47,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.125) internal successors, (114), 18 states have internal predecessors, (114), 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 02:46:47,041 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 730 transitions. [2024-11-17 02:46:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-17 02:46:47,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:47,043 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 02:46:47,059 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 02:46:47,247 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 02:46:47,248 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 02:46:47,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash 176260106, now seen corresponding path program 1 times [2024-11-17 02:46:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126466753] [2024-11-17 02:46:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:47,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:47,589 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 02:46:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:47,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126466753] [2024-11-17 02:46:47,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126466753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:47,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:47,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:46:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070002792] [2024-11-17 02:46:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:47,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:46:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:47,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:46:47,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:46:47,591 INFO L87 Difference]: Start difference. First operand 635 states and 730 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 02:46:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:48,932 INFO L93 Difference]: Finished difference Result 648 states and 746 transitions. [2024-11-17 02:46:48,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:46:48,933 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 02:46:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:48,935 INFO L225 Difference]: With dead ends: 648 [2024-11-17 02:46:48,935 INFO L226 Difference]: Without dead ends: 648 [2024-11-17 02:46:48,935 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 02:46:48,936 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 517 mSDsluCounter, 3549 mSDsCounter, 0 mSdLazyCounter, 3292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 3906 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:48,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 3906 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3292 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 02:46:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-17 02:46:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 644. [2024-11-17 02:46:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 461 states have (on average 1.5488069414316703) internal successors, (714), 636 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 02:46:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 741 transitions. [2024-11-17 02:46:48,943 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 741 transitions. Word has length 91 [2024-11-17 02:46:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:48,944 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 741 transitions. [2024-11-17 02:46:48,944 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 02:46:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 741 transitions. [2024-11-17 02:46:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-17 02:46:48,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:48,944 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 02:46:48,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 02:46:48,945 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 02:46:48,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 176260107, now seen corresponding path program 1 times [2024-11-17 02:46:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:48,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268165462] [2024-11-17 02:46:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:49,446 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 02:46:49,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:49,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268165462] [2024-11-17 02:46:49,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268165462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:49,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:49,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 02:46:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853463028] [2024-11-17 02:46:49,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:49,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 02:46:49,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:49,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 02:46:49,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-17 02:46:49,449 INFO L87 Difference]: Start difference. First operand 644 states and 741 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 02:46:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:50,265 INFO L93 Difference]: Finished difference Result 647 states and 745 transitions. [2024-11-17 02:46:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 02:46:50,265 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 02:46:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:50,271 INFO L225 Difference]: With dead ends: 647 [2024-11-17 02:46:50,272 INFO L226 Difference]: Without dead ends: 647 [2024-11-17 02:46:50,272 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 02:46:50,272 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 522 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:50,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1786 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1832 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:46:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-17 02:46:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 644. [2024-11-17 02:46:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 461 states have (on average 1.5466377440347072) 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 02:46:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 740 transitions. [2024-11-17 02:46:50,280 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 740 transitions. Word has length 91 [2024-11-17 02:46:50,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:50,280 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 740 transitions. [2024-11-17 02:46:50,280 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 02:46:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 740 transitions. [2024-11-17 02:46:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 02:46:50,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:50,281 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 02:46:50,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 02:46:50,281 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 02:46:50,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:50,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1830983672, now seen corresponding path program 1 times [2024-11-17 02:46:50,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:50,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585180678] [2024-11-17 02:46:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:50,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:50,658 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 02:46:50,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:50,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585180678] [2024-11-17 02:46:50,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585180678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:50,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985530095] [2024-11-17 02:46:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:50,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:50,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:50,661 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 02:46:50,662 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 02:46:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:50,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 02:46:50,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:50,816 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 02:46:50,903 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:46:50,904 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 02:46:50,908 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 02:46:50,964 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:50,964 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 02:46:51,001 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:51,001 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 02:46:51,010 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 02:46:51,012 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 02:46:51,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:51,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))))) is different from false [2024-11-17 02:46:51,069 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-17 02:46:51,070 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 02:46:51,074 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_901 (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$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_901))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_898)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-17 02:46:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985530095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:51,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:51,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-17 02:46:51,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084843335] [2024-11-17 02:46:51,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:51,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 02:46:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:51,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 02:46:51,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=5, NotChecked=66, Total=380 [2024-11-17 02:46:51,077 INFO L87 Difference]: Start difference. First operand 644 states and 740 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 02:46:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:51,976 INFO L93 Difference]: Finished difference Result 646 states and 744 transitions. [2024-11-17 02:46:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:46:51,976 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 02:46:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:51,980 INFO L225 Difference]: With dead ends: 646 [2024-11-17 02:46:51,980 INFO L226 Difference]: Without dead ends: 646 [2024-11-17 02:46:51,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=541, Unknown=5, NotChecked=98, Total=756 [2024-11-17 02:46:51,981 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 516 mSDsluCounter, 2572 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:51,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 2929 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:46:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-17 02:46:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 643. [2024-11-17 02:46:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 461 states have (on average 1.5444685466377441) internal successors, (712), 635 states have internal predecessors, (712), 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 02:46:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 739 transitions. [2024-11-17 02:46:51,990 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 739 transitions. Word has length 92 [2024-11-17 02:46:51,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:51,990 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 739 transitions. [2024-11-17 02:46:51,990 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 02:46:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 739 transitions. [2024-11-17 02:46:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 02:46:51,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:51,991 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 02:46:52,006 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 02:46:52,193 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 02:46:52,193 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 02:46:52,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:52,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1830983673, now seen corresponding path program 1 times [2024-11-17 02:46:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:52,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326374828] [2024-11-17 02:46:52,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:52,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:46:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326374828] [2024-11-17 02:46:52,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326374828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878955533] [2024-11-17 02:46:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:52,780 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 02:46:52,781 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 02:46:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:52,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 02:46:52,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:52,951 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 02:46:53,029 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:46:53,030 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 02:46:53,036 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 02:46:53,047 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 02:46:53,050 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 02:46:53,088 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 02:46:53,092 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 02:46:53,171 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:53,172 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 02:46:53,175 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 02:46:53,232 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:53,232 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 02:46:53,238 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 02:46:53,250 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 02:46:53,253 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 02:46:53,256 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 02:46:53,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:53,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:46:53,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1051) .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1051) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-17 02:46:53,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878955533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:53,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:53,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-17 02:46:53,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066547359] [2024-11-17 02:46:53,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:53,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 02:46:53,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:53,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 02:46:53,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=316, Unknown=11, NotChecked=74, Total=462 [2024-11-17 02:46:53,397 INFO L87 Difference]: Start difference. First operand 643 states and 739 transitions. Second operand has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 16 states have internal predecessors, (137), 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 02:46:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:54,956 INFO L93 Difference]: Finished difference Result 645 states and 743 transitions. [2024-11-17 02:46:54,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:46:54,956 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 16 states have internal predecessors, (137), 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 92 [2024-11-17 02:46:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:54,958 INFO L225 Difference]: With dead ends: 645 [2024-11-17 02:46:54,958 INFO L226 Difference]: Without dead ends: 645 [2024-11-17 02:46:54,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=634, Unknown=11, NotChecked=106, Total=870 [2024-11-17 02:46:54,959 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 510 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 3584 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 3611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:54,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 3009 Invalid, 3611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3584 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:46:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-17 02:46:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 633. [2024-11-17 02:46:54,964 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 02:46:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 728 transitions. [2024-11-17 02:46:54,965 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 728 transitions. Word has length 92 [2024-11-17 02:46:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:54,966 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 728 transitions. [2024-11-17 02:46:54,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 16 states have internal predecessors, (137), 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 02:46:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 728 transitions. [2024-11-17 02:46:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 02:46:54,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:54,966 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 02:46:54,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 02:46:55,167 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 02:46:55,167 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 02:46:55,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:55,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1779683796, now seen corresponding path program 1 times [2024-11-17 02:46:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:55,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205710567] [2024-11-17 02:46:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:55,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:55,603 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 02:46:55,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:55,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205710567] [2024-11-17 02:46:55,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205710567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:55,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:55,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 02:46:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166449493] [2024-11-17 02:46:55,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:55,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:46:55,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:55,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:46:55,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-17 02:46:55,607 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 02:46:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:56,704 INFO L93 Difference]: Finished difference Result 649 states and 747 transitions. [2024-11-17 02:46:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:46:56,706 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 02:46:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:56,708 INFO L225 Difference]: With dead ends: 649 [2024-11-17 02:46:56,708 INFO L226 Difference]: Without dead ends: 649 [2024-11-17 02:46:56,708 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 02:46:56,708 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 543 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 2710 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:56,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 3241 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2710 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:46:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-17 02:46:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 645. [2024-11-17 02:46:56,714 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 02:46:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 742 transitions. [2024-11-17 02:46:56,717 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 742 transitions. Word has length 94 [2024-11-17 02:46:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:56,717 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 742 transitions. [2024-11-17 02:46:56,717 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 02:46:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 742 transitions. [2024-11-17 02:46:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 02:46:56,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:56,718 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 02:46:56,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 02:46:56,718 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 02:46:56,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1779683795, now seen corresponding path program 1 times [2024-11-17 02:46:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:56,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972319241] [2024-11-17 02:46:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:57,214 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 02:46:57,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:57,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972319241] [2024-11-17 02:46:57,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972319241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:57,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:57,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 02:46:57,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91166294] [2024-11-17 02:46:57,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:57,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 02:46:57,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:57,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 02:46:57,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-17 02:46:57,216 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 02:46:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:58,140 INFO L93 Difference]: Finished difference Result 648 states and 746 transitions. [2024-11-17 02:46:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:46:58,140 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 02:46:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:58,142 INFO L225 Difference]: With dead ends: 648 [2024-11-17 02:46:58,142 INFO L226 Difference]: Without dead ends: 648 [2024-11-17 02:46:58,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-17 02:46:58,142 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 517 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:58,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 2412 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:46:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-17 02:46:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2024-11-17 02:46:58,148 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 02:46:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 741 transitions. [2024-11-17 02:46:58,148 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 741 transitions. Word has length 94 [2024-11-17 02:46:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:58,149 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 741 transitions. [2024-11-17 02:46:58,149 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 02:46:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 741 transitions. [2024-11-17 02:46:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:46:58,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:58,149 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 02:46:58,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 02:46:58,149 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 02:46:58,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:58,150 INFO L85 PathProgramCache]: Analyzing trace with hash 750414718, now seen corresponding path program 1 times [2024-11-17 02:46:58,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:58,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302379491] [2024-11-17 02:46:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:46:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:58,545 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 02:46:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302379491] [2024-11-17 02:46:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302379491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:58,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659939012] [2024-11-17 02:46:58,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:58,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:58,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:58,547 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 02:46:58,548 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 02:46:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:58,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 02:46:58,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:58,721 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 02:46:58,806 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:46:58,807 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 02:46:58,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:46:58,872 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:58,872 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 02:46:58,899 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:58,900 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 02:46:58,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:58,930 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 02:46:58,940 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 02:46:58,941 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 02:46:58,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:58,947 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1331 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1331) |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 02:47:03,064 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-17 02:47:03,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-17 02:47:03,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659939012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:03,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:03,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-17 02:47:03,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563317774] [2024-11-17 02:47:03,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:03,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 02:47:03,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:03,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 02:47:03,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=451, Unknown=28, NotChecked=44, Total=600 [2024-11-17 02:47:03,103 INFO L87 Difference]: Start difference. First operand 645 states and 741 transitions. Second operand has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 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 02:47:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:04,582 INFO L93 Difference]: Finished difference Result 647 states and 745 transitions. [2024-11-17 02:47:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:47:04,586 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 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 95 [2024-11-17 02:47:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:04,588 INFO L225 Difference]: With dead ends: 647 [2024-11-17 02:47:04,588 INFO L226 Difference]: Without dead ends: 647 [2024-11-17 02:47:04,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=157, Invalid=875, Unknown=28, NotChecked=62, Total=1122 [2024-11-17 02:47:04,589 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 506 mSDsluCounter, 3879 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 4235 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:04,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 4235 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3446 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 02:47:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-17 02:47:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 644. [2024-11-17 02:47:04,595 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 02:47:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 740 transitions. [2024-11-17 02:47:04,596 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 740 transitions. Word has length 95 [2024-11-17 02:47:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:04,596 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 740 transitions. [2024-11-17 02:47:04,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 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 02:47:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 740 transitions. [2024-11-17 02:47:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:47:04,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:04,597 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 02:47:04,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 02:47:04,801 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 02:47:04,802 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 02:47:04,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash 750414719, now seen corresponding path program 1 times [2024-11-17 02:47:04,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:04,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725505540] [2024-11-17 02:47:04,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:05,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:47:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:05,382 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 02:47:05,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:05,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725505540] [2024-11-17 02:47:05,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725505540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:05,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484034716] [2024-11-17 02:47:05,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:05,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:05,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:05,384 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 02:47:05,385 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 02:47:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:05,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-17 02:47:05,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:05,561 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 02:47:05,668 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 02:47:05,674 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:47:05,674 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 02:47:05,702 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 02:47:05,709 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 02:47:05,780 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 02:47:05,783 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 02:47:05,871 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:05,872 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 02:47:05,877 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 02:47:05,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:05,940 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 02:47:05,945 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 02:47:05,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:05,998 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 02:47:06,005 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 02:47:06,018 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 02:47:06,022 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 02:47:06,039 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 02:47:06,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:06,094 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:47:06,111 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1491 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-17 02:47:06,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1490) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1489))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1490) .cse1 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-17 02:47:06,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1490) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1489))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1490) .cse2 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-17 02:47:06,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1497))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1489))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1498) .cse0 v_ArrVal_1490) .cse1 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1497))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1498) .cse5 v_ArrVal_1490) (select (select (store .cse6 .cse5 v_ArrVal_1489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1491))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2024-11-17 02:47:06,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484034716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:06,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:06,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2024-11-17 02:47:06,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159878854] [2024-11-17 02:47:06,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:06,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-17 02:47:06,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:06,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-17 02:47:06,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=523, Unknown=5, NotChecked=250, Total=870 [2024-11-17 02:47:06,190 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 02:47:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:08,562 INFO L93 Difference]: Finished difference Result 646 states and 744 transitions. [2024-11-17 02:47:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:47:08,562 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 02:47:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:08,564 INFO L225 Difference]: With dead ends: 646 [2024-11-17 02:47:08,564 INFO L226 Difference]: Without dead ends: 646 [2024-11-17 02:47:08,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=855, Unknown=5, NotChecked=320, Total=1332 [2024-11-17 02:47:08,564 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 514 mSDsluCounter, 4081 mSDsCounter, 0 mSdLazyCounter, 5095 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 5133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 5095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:08,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 4439 Invalid, 5133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 5095 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 02:47:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-17 02:47:08,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 631. [2024-11-17 02:47:08,570 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 02:47:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 726 transitions. [2024-11-17 02:47:08,570 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 726 transitions. Word has length 95 [2024-11-17 02:47:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:08,571 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 726 transitions. [2024-11-17 02:47:08,571 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 02:47:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 726 transitions. [2024-11-17 02:47:08,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-17 02:47:08,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:08,571 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 02:47:08,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-17 02:47:08,775 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 02:47:08,776 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 02:47:08,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1483170397, now seen corresponding path program 1 times [2024-11-17 02:47:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:08,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423509439] [2024-11-17 02:47:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:47:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:09,219 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 02:47:09,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:09,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423509439] [2024-11-17 02:47:09,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423509439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:09,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:09,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-17 02:47:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939014836] [2024-11-17 02:47:09,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:09,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 02:47:09,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:09,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 02:47:09,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:47:09,222 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 02:47:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:10,418 INFO L93 Difference]: Finished difference Result 650 states and 748 transitions. [2024-11-17 02:47:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:47:10,419 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 02:47:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:10,421 INFO L225 Difference]: With dead ends: 650 [2024-11-17 02:47:10,421 INFO L226 Difference]: Without dead ends: 650 [2024-11-17 02:47:10,421 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 02:47:10,421 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 540 mSDsluCounter, 2881 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:10,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 3236 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:47:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-17 02:47:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 646. [2024-11-17 02:47:10,428 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 02:47:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 743 transitions. [2024-11-17 02:47:10,428 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 743 transitions. Word has length 97 [2024-11-17 02:47:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:10,429 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 743 transitions. [2024-11-17 02:47:10,429 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 02:47:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 743 transitions. [2024-11-17 02:47:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-17 02:47:10,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:10,429 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 02:47:10,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 02:47:10,429 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 02:47:10,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:10,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1483170396, now seen corresponding path program 1 times [2024-11-17 02:47:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:10,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434446777] [2024-11-17 02:47:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:10,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:47:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:10,979 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 02:47:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434446777] [2024-11-17 02:47:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434446777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:10,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:10,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:47:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180065766] [2024-11-17 02:47:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:10,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:47:10,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:10,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:47:10,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:47:10,981 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 02:47:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:12,156 INFO L93 Difference]: Finished difference Result 649 states and 747 transitions. [2024-11-17 02:47:12,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 02:47:12,157 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 02:47:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:12,158 INFO L225 Difference]: With dead ends: 649 [2024-11-17 02:47:12,158 INFO L226 Difference]: Without dead ends: 649 [2024-11-17 02:47:12,159 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 02:47:12,159 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 542 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:12,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 2296 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:47:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-17 02:47:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2024-11-17 02:47:12,164 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 02:47:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 742 transitions. [2024-11-17 02:47:12,167 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 742 transitions. Word has length 97 [2024-11-17 02:47:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:12,168 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 742 transitions. [2024-11-17 02:47:12,168 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 02:47:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 742 transitions. [2024-11-17 02:47:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 02:47:12,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:12,168 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 02:47:12,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 02:47:12,168 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 02:47:12,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash 300582673, now seen corresponding path program 1 times [2024-11-17 02:47:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69308125] [2024-11-17 02:47:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:12,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:47:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:12,615 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 02:47:12,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:12,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69308125] [2024-11-17 02:47:12,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69308125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:12,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443982736] [2024-11-17 02:47:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:12,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:12,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:12,618 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 02:47:12,619 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 02:47:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:12,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-17 02:47:12,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:12,791 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 02:47:12,864 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:47:12,864 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 02:47:12,870 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 02:47:12,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:12,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:47:12,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:12,980 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 02:47:13,018 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:13,019 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 02:47:13,056 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:13,056 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 02:47:13,064 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 02:47:13,066 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 02:47:13,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:13,099 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 02:47:13,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:47:13,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1801))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:47:13,198 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-17 02:47:13,199 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 02:47:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443982736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:13,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:13,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2024-11-17 02:47:13,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413632101] [2024-11-17 02:47:13,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:13,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-17 02:47:13,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:13,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-17 02:47:13,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=578, Unknown=38, NotChecked=156, Total=870 [2024-11-17 02:47:13,249 INFO L87 Difference]: Start difference. First operand 646 states and 742 transitions. Second operand has 23 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 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 02:47:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:14,694 INFO L93 Difference]: Finished difference Result 648 states and 746 transitions. [2024-11-17 02:47:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:47:14,695 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 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 98 [2024-11-17 02:47:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:14,696 INFO L225 Difference]: With dead ends: 648 [2024-11-17 02:47:14,696 INFO L226 Difference]: Without dead ends: 648 [2024-11-17 02:47:14,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=1115, Unknown=42, NotChecked=216, Total=1560 [2024-11-17 02:47:14,697 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 502 mSDsluCounter, 3592 mSDsCounter, 0 mSdLazyCounter, 3225 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:14,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 3947 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3225 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 02:47:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-17 02:47:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2024-11-17 02:47:14,702 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 02:47:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 741 transitions. [2024-11-17 02:47:14,704 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 741 transitions. Word has length 98 [2024-11-17 02:47:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:14,704 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 741 transitions. [2024-11-17 02:47:14,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 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 02:47:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 741 transitions. [2024-11-17 02:47:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 02:47:14,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:14,705 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 02:47:14,719 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 02:47:14,905 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 02:47:14,906 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 02:47:14,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash 300582674, now seen corresponding path program 1 times [2024-11-17 02:47:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441994157] [2024-11-17 02:47:14,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:47:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:15,565 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 02:47:15,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441994157] [2024-11-17 02:47:15,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441994157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105934771] [2024-11-17 02:47:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:15,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:15,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:15,568 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 02:47:15,569 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 02:47:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:15,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-17 02:47:15,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:15,737 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 02:47:15,816 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:47:15,816 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 02:47:15,821 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 02:47:15,845 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 02:47:15,849 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 02:47:15,925 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 02:47:15,929 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 02:47:16,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:16,014 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 02:47:16,019 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 02:47:16,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:16,092 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 02:47:16,097 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 02:47:16,136 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:16,136 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 02:47:16,139 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 02:47:16,181 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:16,181 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 02:47:16,187 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 02:47:16,197 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 02:47:16,202 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 02:47:16,222 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 02:47:16,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:16,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:47:16,286 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1977 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-17 02:47:16,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1976) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1976) .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-17 02:47:16,309 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1975))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1976) .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1976) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-17 02:47:16,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1974))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973) .cse0 v_ArrVal_1976) (select (select (store .cse1 .cse0 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1977))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1974))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1975))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973) .cse3 v_ArrVal_1976) .cse4 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-17 02:47:16,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1974))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1984) .cse0 v_ArrVal_1973) .cse1 v_ArrVal_1976) (select (select (store .cse2 .cse1 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1977))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1974))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1975))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1984) .cse5 v_ArrVal_1973) .cse6 v_ArrVal_1976) .cse7 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-17 02:47:16,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105934771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:16,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:16,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-17 02:47:16,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738762595] [2024-11-17 02:47:16,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:16,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 02:47:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:16,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 02:47:16,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=652, Unknown=13, NotChecked=342, Total=1122 [2024-11-17 02:47:16,698 INFO L87 Difference]: Start difference. First operand 645 states and 741 transitions. Second operand has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 24 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:47:19,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:19,307 INFO L93 Difference]: Finished difference Result 647 states and 745 transitions. [2024-11-17 02:47:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:47:19,308 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 24 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2024-11-17 02:47:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:19,309 INFO L225 Difference]: With dead ends: 647 [2024-11-17 02:47:19,309 INFO L226 Difference]: Without dead ends: 647 [2024-11-17 02:47:19,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=1079, Unknown=14, NotChecked=438, Total=1722 [2024-11-17 02:47:19,310 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 504 mSDsluCounter, 4351 mSDsCounter, 0 mSdLazyCounter, 5358 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 4708 SdHoareTripleChecker+Invalid, 5385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 5358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:19,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 4708 Invalid, 5385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 5358 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-17 02:47:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-17 02:47:19,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 629. [2024-11-17 02:47:19,320 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 02:47:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 724 transitions. [2024-11-17 02:47:19,321 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 724 transitions. Word has length 98 [2024-11-17 02:47:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:19,322 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 724 transitions. [2024-11-17 02:47:19,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 24 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:47:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 724 transitions. [2024-11-17 02:47:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 02:47:19,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:19,323 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 02:47:19,337 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 02:47:19,523 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 02:47:19,523 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 02:47:19,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash -907957475, now seen corresponding path program 1 times [2024-11-17 02:47:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:19,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728292049] [2024-11-17 02:47:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:19,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:47:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:20,017 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 02:47:20,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:20,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728292049] [2024-11-17 02:47:20,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728292049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:20,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:20,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 02:47:20,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763416001] [2024-11-17 02:47:20,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:20,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:47:20,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:20,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:47:20,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-17 02:47:20,019 INFO L87 Difference]: Start difference. First operand 629 states and 724 transitions. Second operand has 15 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:21,010 INFO L93 Difference]: Finished difference Result 652 states and 750 transitions. [2024-11-17 02:47:21,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:47:21,010 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-17 02:47:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:21,012 INFO L225 Difference]: With dead ends: 652 [2024-11-17 02:47:21,012 INFO L226 Difference]: Without dead ends: 652 [2024-11-17 02:47:21,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-17 02:47:21,013 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 526 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:21,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2607 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 02:47:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-17 02:47:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 648. [2024-11-17 02:47:21,019 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 02:47:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 745 transitions. [2024-11-17 02:47:21,020 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 745 transitions. Word has length 101 [2024-11-17 02:47:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:21,020 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 745 transitions. [2024-11-17 02:47:21,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:47:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 745 transitions. [2024-11-17 02:47:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 02:47:21,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:21,021 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 02:47:21,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-17 02:47:21,021 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 02:47:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash -907957474, now seen corresponding path program 1 times [2024-11-17 02:47:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:21,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727567330] [2024-11-17 02:47:21,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:21,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:47:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:21,915 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 02:47:21,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:21,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727567330] [2024-11-17 02:47:21,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727567330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:47:21,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:47:21,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-17 02:47:21,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010577670] [2024-11-17 02:47:21,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:47:21,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 02:47:21,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:21,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 02:47:21,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-17 02:47:21,917 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 02:47:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:23,388 INFO L93 Difference]: Finished difference Result 651 states and 749 transitions. [2024-11-17 02:47:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:47:23,389 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 02:47:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:23,390 INFO L225 Difference]: With dead ends: 651 [2024-11-17 02:47:23,390 INFO L226 Difference]: Without dead ends: 651 [2024-11-17 02:47:23,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-17 02:47:23,391 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 521 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:23,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2588 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 02:47:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-17 02:47:23,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 648. [2024-11-17 02:47:23,396 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 02:47:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 744 transitions. [2024-11-17 02:47:23,396 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 744 transitions. Word has length 101 [2024-11-17 02:47:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:23,397 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 744 transitions. [2024-11-17 02:47:23,397 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 02:47:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 744 transitions. [2024-11-17 02:47:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:47:23,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:23,398 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 02:47:23,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-17 02:47:23,398 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 02:47:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2099588491, now seen corresponding path program 1 times [2024-11-17 02:47:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:23,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901267617] [2024-11-17 02:47:23,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:47:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:23,918 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 02:47:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901267617] [2024-11-17 02:47:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901267617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361966061] [2024-11-17 02:47:23,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:23,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:23,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:23,920 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 02:47:23,920 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 02:47:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:24,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-17 02:47:24,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:24,115 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 02:47:24,197 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:47:24,197 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 02:47:24,202 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 02:47:24,233 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:24,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-17 02:47:24,255 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:24,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-17 02:47:24,281 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:24,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-17 02:47:24,307 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:24,307 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 02:47:24,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:24,343 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 02:47:24,350 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 02:47:24,360 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 02:47:24,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 02:47:24,371 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 02:47:24,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:24,442 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-17 02:47:24,442 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 02:47:24,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2321))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem54#1.base|)) is different from false [2024-11-17 02:47:24,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2321))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-17 02:47:24,459 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2320)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_2321))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-17 02:47:24,464 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2320))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_2321))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-17 02:47:24,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2319))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2320)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_2321))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-17 02:47:24,478 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2319))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2320)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_2321))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-17 02:47:24,501 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2326 (Array Int Int)) (v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2326))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2319)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2320)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_2321))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-17 02:47:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361966061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:24,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 20 [2024-11-17 02:47:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539824388] [2024-11-17 02:47:24,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:24,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 02:47:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 02:47:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=430, Unknown=19, NotChecked=336, Total=870 [2024-11-17 02:47:24,504 INFO L87 Difference]: Start difference. First operand 648 states and 744 transitions. Second operand has 21 states, 19 states have (on average 7.894736842105263) internal successors, (150), 20 states have internal predecessors, (150), 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 02:47:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:25,858 INFO L93 Difference]: Finished difference Result 650 states and 748 transitions. [2024-11-17 02:47:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:47:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.894736842105263) internal successors, (150), 20 states have internal predecessors, (150), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-17 02:47:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:25,860 INFO L225 Difference]: With dead ends: 650 [2024-11-17 02:47:25,860 INFO L226 Difference]: Without dead ends: 650 [2024-11-17 02:47:25,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=843, Unknown=20, NotChecked=462, Total=1482 [2024-11-17 02:47:25,861 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 501 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:25,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 3619 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 02:47:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-17 02:47:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 647. [2024-11-17 02:47:25,865 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 02:47:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 743 transitions. [2024-11-17 02:47:25,866 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 743 transitions. Word has length 102 [2024-11-17 02:47:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:25,866 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 743 transitions. [2024-11-17 02:47:25,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.894736842105263) internal successors, (150), 20 states have internal predecessors, (150), 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 02:47:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 743 transitions. [2024-11-17 02:47:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:47:25,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:25,867 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 02:47:25,881 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 02:47:26,068 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 02:47:26,068 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 02:47:26,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2099588492, now seen corresponding path program 1 times [2024-11-17 02:47:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:26,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286733622] [2024-11-17 02:47:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:26,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:26,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-17 02:47:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:26,853 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 02:47:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286733622] [2024-11-17 02:47:26,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286733622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252131422] [2024-11-17 02:47:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:26,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:26,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:26,855 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 02:47:26,856 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 02:47:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:27,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-17 02:47:27,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:27,045 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 02:47:27,123 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 02:47:27,128 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:47:27,128 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 02:47:27,147 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 02:47:27,151 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 02:47:27,212 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 02:47:27,214 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 02:47:27,319 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:27,319 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 02:47:27,323 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 02:47:27,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:27,411 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 02:47:27,414 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 02:47:27,491 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:27,492 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 02:47:27,495 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 02:47:27,572 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:27,572 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 02:47:27,575 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 02:47:27,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:27,655 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 02:47:27,661 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 02:47:27,679 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 02:47:27,685 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 02:47:27,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:47:27,728 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-17 02:47:27,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-17 02:47:27,738 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:47:27,739 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 02:47:27,773 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 02:47:27,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:28,092 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2513) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 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_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2517 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2514))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2513) .cse1 v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2517) (select (select (store .cse2 .cse1 v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-17 02:47:37,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 02:47:37,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-17 02:47:38,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2515 (Array Int Int)) (v_prenex_19 (Array Int Int)) (v_prenex_25 Int) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_2517 Int) (v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_25) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_20))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_24))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_21))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_18))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_22) .cse0 v_prenex_26) .cse1 v_prenex_23) .cse2 v_prenex_19) .cse3 v_prenex_17) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_25 v_ArrVal_2517) (select (select (store .cse5 .cse3 v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) (forall ((v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2523 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2511 (Array Int Int)) (v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2509 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2523))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2510))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2512))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2522) .cse9 v_ArrVal_2509) .cse10 v_ArrVal_2511) .cse11 v_ArrVal_2513) (select (select (store .cse12 .cse11 v_ArrVal_2514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2516))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-17 02:47:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252131422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:38,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:38,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-17 02:47:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250305534] [2024-11-17 02:47:38,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:38,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-17 02:47:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:38,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-17 02:47:38,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1486, Unknown=52, NotChecked=162, Total=1892 [2024-11-17 02:47:38,434 INFO L87 Difference]: Start difference. First operand 647 states and 743 transitions. Second operand has 32 states, 29 states have (on average 5.689655172413793) internal successors, (165), 30 states have internal predecessors, (165), 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)