./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:03:08,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:03:08,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:03:08,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:03:08,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:03:08,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:03:08,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:03:08,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:03:08,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:03:08,957 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:03:08,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:03:08,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:03:08,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:03:08,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:03:08,959 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:03:08,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:03:08,959 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:03:08,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:03:08,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:03:08,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:03:08,960 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:03:08,964 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:03:08,965 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:03:08,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:03:08,965 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:03:08,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:03:08,966 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:03:08,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:03:08,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:03:08,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:03:08,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:03:08,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:03:08,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:03:08,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:03:08,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:03:08,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:03:08,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:03:08,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:03:08,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:03:08,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:03:08,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:03:08,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:03:08,969 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 -> c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e [2024-11-09 10:03:09,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:03:09,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:03:09,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:03:09,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:03:09,254 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:03:09,255 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_test2-1.i [2024-11-09 10:03:10,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:03:11,078 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:03:11,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2024-11-09 10:03:11,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8853a3e/96a2562f847a425fb9ba0869d079ff89/FLAGd4cae3332 [2024-11-09 10:03:11,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8853a3e/96a2562f847a425fb9ba0869d079ff89 [2024-11-09 10:03:11,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:03:11,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:03:11,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:03:11,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:03:11,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:03:11,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:11,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1d7e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11, skipping insertion in model container [2024-11-09 10:03:11,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:11,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:03:11,673 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:03:11,712 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:03:11,718 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:03:11,722 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:03:11,733 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:03:11,782 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:03:11,782 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:03:11,787 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:03:11,788 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:03:11,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:03:11,822 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:03:11,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:03:11,987 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:03:11,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11 WrapperNode [2024-11-09 10:03:11,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:03:11,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:03:11,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:03:11,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:03:11,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,122 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1312 [2024-11-09 10:03:12,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:03:12,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:03:12,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:03:12,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:03:12,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,228 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-09 10:03:12,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:03:12,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:03:12,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:03:12,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:03:12,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (1/1) ... [2024-11-09 10:03:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:03:12,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:03:12,352 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-09 10:03:12,382 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-09 10:03:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:03:12,437 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:03:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:03:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:03:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:03:12,438 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:03:12,438 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:03:12,438 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:03:12,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:03:12,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:03:12,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:03:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:03:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:03:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:03:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:03:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:03:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:03:12,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:03:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:03:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:03:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:03:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:03:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:03:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:03:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:03:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:03:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:03:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:03:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:03:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:03:12,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:03:12,707 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:03:12,710 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:03:12,736 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:03:12,765 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:03:12,794 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:03:14,821 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2024-11-09 10:03:14,821 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:03:14,860 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:03:14,860 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 10:03:14,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:03:14 BoogieIcfgContainer [2024-11-09 10:03:14,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:03:14,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:03:14,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:03:14,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:03:14,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:03:11" (1/3) ... [2024-11-09 10:03:14,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e60553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:03:14, skipping insertion in model container [2024-11-09 10:03:14,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:03:11" (2/3) ... [2024-11-09 10:03:14,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e60553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:03:14, skipping insertion in model container [2024-11-09 10:03:14,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:03:14" (3/3) ... [2024-11-09 10:03:14,872 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-1.i [2024-11-09 10:03:14,888 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:03:14,889 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-11-09 10:03:14,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:03:14,974 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;@79a921d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:03:14,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-09 10:03:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 1076 states, 641 states have (on average 2.012480499219969) internal successors, (1290), 1069 states have internal predecessors, (1290), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 10:03:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:03:14,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:14,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:03:14,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:14,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:14,996 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-09 10:03:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:15,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082252376] [2024-11-09 10:03:15,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:15,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:15,229 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-09 10:03:15,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:15,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082252376] [2024-11-09 10:03:15,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082252376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:15,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:15,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:03:15,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302317933] [2024-11-09 10:03:15,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:15,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:03:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:03:15,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:03:15,270 INFO L87 Difference]: Start difference. First operand has 1076 states, 641 states have (on average 2.012480499219969) internal successors, (1290), 1069 states have internal predecessors, (1290), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:16,040 INFO L93 Difference]: Finished difference Result 1062 states and 1236 transitions. [2024-11-09 10:03:16,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:03:16,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 10:03:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:16,081 INFO L225 Difference]: With dead ends: 1062 [2024-11-09 10:03:16,082 INFO L226 Difference]: Without dead ends: 1060 [2024-11-09 10:03:16,085 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-09 10:03:16,088 INFO L432 NwaCegarLoop]: 847 mSDtfsCounter, 1101 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:16,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 899 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:03:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-09 10:03:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-09 10:03:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 643 states have (on average 1.8911353032659408) internal successors, (1216), 1053 states have internal predecessors, (1216), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:03:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1234 transitions. [2024-11-09 10:03:16,176 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1234 transitions. Word has length 3 [2024-11-09 10:03:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:16,177 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1234 transitions. [2024-11-09 10:03:16,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1234 transitions. [2024-11-09 10:03:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:03:16,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:16,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:03:16,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:03:16,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:16,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-09 10:03:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:16,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937349388] [2024-11-09 10:03:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:16,280 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-09 10:03:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:16,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937349388] [2024-11-09 10:03:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937349388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:03:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516597622] [2024-11-09 10:03:16,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:16,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:03:16,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:16,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:03:16,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:03:16,285 INFO L87 Difference]: Start difference. First operand 1060 states and 1234 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:16,925 INFO L93 Difference]: Finished difference Result 1379 states and 1641 transitions. [2024-11-09 10:03:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:03:16,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 10:03:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:16,941 INFO L225 Difference]: With dead ends: 1379 [2024-11-09 10:03:16,941 INFO L226 Difference]: Without dead ends: 1379 [2024-11-09 10:03:16,941 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-09 10:03:16,948 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 396 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:16,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1926 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:03:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-09 10:03:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1291. [2024-11-09 10:03:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 870 states have (on average 1.8517241379310345) internal successors, (1611), 1284 states have internal predecessors, (1611), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:03:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1639 transitions. [2024-11-09 10:03:16,991 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1639 transitions. Word has length 3 [2024-11-09 10:03:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:16,992 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1639 transitions. [2024-11-09 10:03:16,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1639 transitions. [2024-11-09 10:03:16,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 10:03:16,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:16,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:16,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:03:16,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-09 10:03:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:16,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048432775] [2024-11-09 10:03:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:17,282 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-09 10:03:17,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048432775] [2024-11-09 10:03:17,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048432775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:17,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:17,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:03:17,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274886700] [2024-11-09 10:03:17,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:17,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:03:17,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:17,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:03:17,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:03:17,285 INFO L87 Difference]: Start difference. First operand 1291 states and 1639 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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-09 10:03:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:18,340 INFO L93 Difference]: Finished difference Result 1368 states and 1629 transitions. [2024-11-09 10:03:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:03:18,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-09 10:03:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:18,350 INFO L225 Difference]: With dead ends: 1368 [2024-11-09 10:03:18,350 INFO L226 Difference]: Without dead ends: 1368 [2024-11-09 10:03:18,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:03:18,351 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 2203 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:18,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 1195 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:03:18,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-09 10:03:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1048. [2024-11-09 10:03:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 643 states have (on average 1.8709175738724728) internal successors, (1203), 1041 states have internal predecessors, (1203), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:03:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1221 transitions. [2024-11-09 10:03:18,383 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1221 transitions. Word has length 7 [2024-11-09 10:03:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:18,383 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1221 transitions. [2024-11-09 10:03:18,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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-09 10:03:18,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1221 transitions. [2024-11-09 10:03:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:03:18,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:18,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:18,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:03:18,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:18,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-09 10:03:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:18,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118401030] [2024-11-09 10:03:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:18,453 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-09 10:03:18,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:18,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118401030] [2024-11-09 10:03:18,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118401030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:18,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:18,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:03:18,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741372887] [2024-11-09 10:03:18,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:18,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:03:18,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:18,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:03:18,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:03:18,456 INFO L87 Difference]: Start difference. First operand 1048 states and 1221 transitions. Second operand has 3 states, 2 states have (on average 4.0) 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-09 10:03:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:19,165 INFO L93 Difference]: Finished difference Result 1348 states and 1608 transitions. [2024-11-09 10:03:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:03:19,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:03:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:19,171 INFO L225 Difference]: With dead ends: 1348 [2024-11-09 10:03:19,171 INFO L226 Difference]: Without dead ends: 1348 [2024-11-09 10:03:19,172 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-09 10:03:19,173 INFO L432 NwaCegarLoop]: 1322 mSDtfsCounter, 867 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:19,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1764 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:03:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2024-11-09 10:03:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1023. [2024-11-09 10:03:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 643 states have (on average 1.8320373250388802) internal successors, (1178), 1016 states have internal predecessors, (1178), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:03:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1196 transitions. [2024-11-09 10:03:19,201 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1196 transitions. Word has length 8 [2024-11-09 10:03:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:19,202 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1196 transitions. [2024-11-09 10:03:19,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:03:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1196 transitions. [2024-11-09 10:03:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:03:19,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:19,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:19,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:03:19,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:19,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-09 10:03:19,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:19,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64395778] [2024-11-09 10:03:19,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:19,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:19,264 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-09 10:03:19,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:19,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64395778] [2024-11-09 10:03:19,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64395778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:19,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:19,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:03:19,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663487089] [2024-11-09 10:03:19,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:19,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:03:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:19,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:03:19,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:03:19,267 INFO L87 Difference]: Start difference. First operand 1023 states and 1196 transitions. Second operand has 3 states, 2 states have (on average 4.0) 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-09 10:03:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:19,861 INFO L93 Difference]: Finished difference Result 1296 states and 1557 transitions. [2024-11-09 10:03:19,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:03:19,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:03:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:19,868 INFO L225 Difference]: With dead ends: 1296 [2024-11-09 10:03:19,869 INFO L226 Difference]: Without dead ends: 1296 [2024-11-09 10:03:19,869 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-09 10:03:19,870 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 1075 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:19,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1491 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:03:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-11-09 10:03:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 976. [2024-11-09 10:03:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 643 states have (on average 1.7589424572317263) internal successors, (1131), 969 states have internal predecessors, (1131), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:03:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1149 transitions. [2024-11-09 10:03:19,907 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1149 transitions. Word has length 8 [2024-11-09 10:03:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:19,907 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1149 transitions. [2024-11-09 10:03:19,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:03:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1149 transitions. [2024-11-09 10:03:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 10:03:19,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:19,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:19,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:03:19,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:19,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1321547200, now seen corresponding path program 1 times [2024-11-09 10:03:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:19,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044196871] [2024-11-09 10:03:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:20,004 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-09 10:03:20,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044196871] [2024-11-09 10:03:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044196871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:20,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:03:20,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269096441] [2024-11-09 10:03:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:20,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:03:20,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:20,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:03:20,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:03:20,008 INFO L87 Difference]: Start difference. First operand 976 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-09 10:03:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:20,153 INFO L93 Difference]: Finished difference Result 1930 states and 2278 transitions. [2024-11-09 10:03:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:03:20,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-09 10:03:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:20,160 INFO L225 Difference]: With dead ends: 1930 [2024-11-09 10:03:20,160 INFO L226 Difference]: Without dead ends: 1930 [2024-11-09 10:03:20,161 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-09 10:03:20,163 INFO L432 NwaCegarLoop]: 1104 mSDtfsCounter, 1100 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:20,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 3298 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:03:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2024-11-09 10:03:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 978. [2024-11-09 10:03:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 645 states have (on average 1.7565891472868218) internal successors, (1133), 971 states have internal predecessors, (1133), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:03:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1151 transitions. [2024-11-09 10:03:20,193 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1151 transitions. Word has length 10 [2024-11-09 10:03:20,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:20,193 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1151 transitions. [2024-11-09 10:03:20,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-09 10:03:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1151 transitions. [2024-11-09 10:03:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 10:03:20,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:20,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:20,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:03:20,195 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:20,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:20,195 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-09 10:03:20,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:20,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26936469] [2024-11-09 10:03:20,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:20,298 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-09 10:03:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26936469] [2024-11-09 10:03:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26936469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:20,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:03:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281716184] [2024-11-09 10:03:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:20,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:03:20,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:20,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:03:20,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:03:20,302 INFO L87 Difference]: Start difference. First operand 978 states and 1151 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-09 10:03:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:20,951 INFO L93 Difference]: Finished difference Result 1004 states and 1204 transitions. [2024-11-09 10:03:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:03:20,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-09 10:03:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:20,955 INFO L225 Difference]: With dead ends: 1004 [2024-11-09 10:03:20,956 INFO L226 Difference]: Without dead ends: 1004 [2024-11-09 10:03:20,956 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-09 10:03:20,957 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 1340 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:20,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1336 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:03:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2024-11-09 10:03:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 955. [2024-11-09 10:03:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 645 states have (on average 1.7209302325581395) internal successors, (1110), 948 states have internal predecessors, (1110), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:03:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1128 transitions. [2024-11-09 10:03:20,974 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1128 transitions. Word has length 18 [2024-11-09 10:03:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:20,975 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1128 transitions. [2024-11-09 10:03:20,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-09 10:03:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1128 transitions. [2024-11-09 10:03:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 10:03:20,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:20,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:20,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:03:20,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:20,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:20,977 INFO L85 PathProgramCache]: Analyzing trace with hash 183846335, now seen corresponding path program 1 times [2024-11-09 10:03:20,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:20,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092848535] [2024-11-09 10:03:20,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:20,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:21,042 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-09 10:03:21,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:21,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092848535] [2024-11-09 10:03:21,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092848535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:21,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:21,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:03:21,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830839145] [2024-11-09 10:03:21,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:21,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:03:21,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:21,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:03:21,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:03:21,045 INFO L87 Difference]: Start difference. First operand 955 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-09 10:03:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:21,072 INFO L93 Difference]: Finished difference Result 880 states and 1025 transitions. [2024-11-09 10:03:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:03:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-09 10:03:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:21,076 INFO L225 Difference]: With dead ends: 880 [2024-11-09 10:03:21,076 INFO L226 Difference]: Without dead ends: 880 [2024-11-09 10:03:21,076 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-09 10:03:21,077 INFO L432 NwaCegarLoop]: 1003 mSDtfsCounter, 61 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:21,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1953 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:03:21,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-09 10:03:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-11-09 10:03:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 582 states have (on average 1.7302405498281788) internal successors, (1007), 873 states have internal predecessors, (1007), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:03:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1025 transitions. [2024-11-09 10:03:21,092 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1025 transitions. Word has length 18 [2024-11-09 10:03:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:21,092 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1025 transitions. [2024-11-09 10:03:21,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-09 10:03:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1025 transitions. [2024-11-09 10:03:21,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 10:03:21,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:21,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:21,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:03:21,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:21,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash 582825947, now seen corresponding path program 1 times [2024-11-09 10:03:21,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130121993] [2024-11-09 10:03:21,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:21,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:21,151 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-09 10:03:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:21,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130121993] [2024-11-09 10:03:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130121993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:21,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:21,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:03:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316396392] [2024-11-09 10:03:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:21,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:03:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:03:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:03:21,154 INFO L87 Difference]: Start difference. First operand 880 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:21,210 INFO L93 Difference]: Finished difference Result 862 states and 1000 transitions. [2024-11-09 10:03:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:03:21,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 10:03:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:21,214 INFO L225 Difference]: With dead ends: 862 [2024-11-09 10:03:21,214 INFO L226 Difference]: Without dead ends: 862 [2024-11-09 10:03:21,214 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-09 10:03:21,215 INFO L432 NwaCegarLoop]: 968 mSDtfsCounter, 41 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:21,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2876 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:03:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-11-09 10:03:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 859. [2024-11-09 10:03:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 568 states have (on average 1.7235915492957747) internal successors, (979), 852 states have internal predecessors, (979), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:03:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 997 transitions. [2024-11-09 10:03:21,232 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 997 transitions. Word has length 20 [2024-11-09 10:03:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:21,233 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 997 transitions. [2024-11-09 10:03:21,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 997 transitions. [2024-11-09 10:03:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 10:03:21,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:21,234 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] [2024-11-09 10:03:21,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:03:21,234 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:21,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1292750889, now seen corresponding path program 1 times [2024-11-09 10:03:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:21,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136927112] [2024-11-09 10:03:21,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:21,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:21,364 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-09 10:03:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136927112] [2024-11-09 10:03:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136927112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:21,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:03:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902683318] [2024-11-09 10:03:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:21,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:03:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:03:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:03:21,366 INFO L87 Difference]: Start difference. First operand 859 states and 997 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-09 10:03:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:22,125 INFO L93 Difference]: Finished difference Result 1315 states and 1572 transitions. [2024-11-09 10:03:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:03:22,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 10:03:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:22,130 INFO L225 Difference]: With dead ends: 1315 [2024-11-09 10:03:22,130 INFO L226 Difference]: Without dead ends: 1315 [2024-11-09 10:03:22,130 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-09 10:03:22,131 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 816 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:22,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1913 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:03:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-09 10:03:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 855. [2024-11-09 10:03:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 568 states have (on average 1.716549295774648) internal successors, (975), 848 states have internal predecessors, (975), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:03:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 993 transitions. [2024-11-09 10:03:22,150 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 993 transitions. Word has length 34 [2024-11-09 10:03:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:22,151 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 993 transitions. [2024-11-09 10:03:22,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-09 10:03:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 993 transitions. [2024-11-09 10:03:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 10:03:22,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:22,153 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] [2024-11-09 10:03:22,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:03:22,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:22,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:22,154 INFO L85 PathProgramCache]: Analyzing trace with hash 808848765, now seen corresponding path program 1 times [2024-11-09 10:03:22,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:22,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157551146] [2024-11-09 10:03:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:22,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:22,248 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-09 10:03:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:22,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157551146] [2024-11-09 10:03:22,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157551146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:22,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:22,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:03:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279775703] [2024-11-09 10:03:22,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:22,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:03:22,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:22,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:03:22,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:03:22,251 INFO L87 Difference]: Start difference. First operand 855 states and 993 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-09 10:03:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:22,298 INFO L93 Difference]: Finished difference Result 855 states and 989 transitions. [2024-11-09 10:03:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:03:22,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-09 10:03:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:22,301 INFO L225 Difference]: With dead ends: 855 [2024-11-09 10:03:22,301 INFO L226 Difference]: Without dead ends: 855 [2024-11-09 10:03:22,302 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-09 10:03:22,302 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 21 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:22,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2858 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:03:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-09 10:03:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2024-11-09 10:03:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 568 states have (on average 1.7095070422535212) internal successors, (971), 848 states have internal predecessors, (971), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:03:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 989 transitions. [2024-11-09 10:03:22,317 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 989 transitions. Word has length 68 [2024-11-09 10:03:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:22,318 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 989 transitions. [2024-11-09 10:03:22,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-09 10:03:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 989 transitions. [2024-11-09 10:03:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 10:03:22,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:22,319 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] [2024-11-09 10:03:22,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:03:22,320 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:22,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash -324916151, now seen corresponding path program 1 times [2024-11-09 10:03:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:22,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056390825] [2024-11-09 10:03:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:22,451 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-09 10:03:22,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:22,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056390825] [2024-11-09 10:03:22,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056390825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:22,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:22,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:03:22,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882261563] [2024-11-09 10:03:22,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:22,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:03:22,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:22,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:03:22,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:03:22,453 INFO L87 Difference]: Start difference. First operand 855 states and 989 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:22,512 INFO L93 Difference]: Finished difference Result 1194 states and 1432 transitions. [2024-11-09 10:03:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:03:22,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 10:03:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:22,517 INFO L225 Difference]: With dead ends: 1194 [2024-11-09 10:03:22,518 INFO L226 Difference]: Without dead ends: 1194 [2024-11-09 10:03:22,518 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-09 10:03:22,518 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 361 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:22,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 2192 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:03:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-09 10:03:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1140. [2024-11-09 10:03:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 848 states have (on average 1.6521226415094339) internal successors, (1401), 1133 states have internal predecessors, (1401), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:03:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1429 transitions. [2024-11-09 10:03:22,543 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1429 transitions. Word has length 76 [2024-11-09 10:03:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:22,544 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1429 transitions. [2024-11-09 10:03:22,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1429 transitions. [2024-11-09 10:03:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 10:03:22,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:22,548 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] [2024-11-09 10:03:22,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:03:22,549 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:22,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1012783132, now seen corresponding path program 1 times [2024-11-09 10:03:22,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:22,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289568913] [2024-11-09 10:03:22,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:22,881 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-09 10:03:22,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:22,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289568913] [2024-11-09 10:03:22,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289568913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:22,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:22,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:03:22,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496466087] [2024-11-09 10:03:22,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:22,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:03:22,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:22,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:03:22,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:03:22,884 INFO L87 Difference]: Start difference. First operand 1140 states and 1429 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:23,464 INFO L93 Difference]: Finished difference Result 1139 states and 1428 transitions. [2024-11-09 10:03:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:03:23,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-09 10:03:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:23,468 INFO L225 Difference]: With dead ends: 1139 [2024-11-09 10:03:23,468 INFO L226 Difference]: Without dead ends: 1139 [2024-11-09 10:03:23,469 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-09 10:03:23,469 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:23,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2905 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:03:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-11-09 10:03:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-11-09 10:03:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 848 states have (on average 1.650943396226415) internal successors, (1400), 1132 states have internal predecessors, (1400), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:03:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1428 transitions. [2024-11-09 10:03:23,492 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1428 transitions. Word has length 84 [2024-11-09 10:03:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1428 transitions. [2024-11-09 10:03:23,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1428 transitions. [2024-11-09 10:03:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 10:03:23,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:23,494 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] [2024-11-09 10:03:23,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:03:23,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1012783133, now seen corresponding path program 1 times [2024-11-09 10:03:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419332210] [2024-11-09 10:03:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:23,997 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-09 10:03:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419332210] [2024-11-09 10:03:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419332210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:24,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:24,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:03:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728613097] [2024-11-09 10:03:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:24,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:03:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:03:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:03:24,002 INFO L87 Difference]: Start difference. First operand 1139 states and 1428 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:24,696 INFO L93 Difference]: Finished difference Result 1138 states and 1427 transitions. [2024-11-09 10:03:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:03:24,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-09 10:03:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:24,700 INFO L225 Difference]: With dead ends: 1138 [2024-11-09 10:03:24,700 INFO L226 Difference]: Without dead ends: 1138 [2024-11-09 10:03:24,700 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-09 10:03:24,700 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 1 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:24,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2876 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:03:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2024-11-09 10:03:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2024-11-09 10:03:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 847 states have (on average 1.6517119244391971) internal successors, (1399), 1131 states have internal predecessors, (1399), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:03:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1427 transitions. [2024-11-09 10:03:24,721 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1427 transitions. Word has length 84 [2024-11-09 10:03:24,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:24,722 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1427 transitions. [2024-11-09 10:03:24,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:03:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1427 transitions. [2024-11-09 10:03:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:03:24,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:24,723 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-09 10:03:24,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:03:24,724 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:24,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 243663683, now seen corresponding path program 1 times [2024-11-09 10:03:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:24,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724040701] [2024-11-09 10:03:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:25,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:25,052 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-09 10:03:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:25,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724040701] [2024-11-09 10:03:25,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724040701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:03:25,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652708279] [2024-11-09 10:03:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:25,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:03:25,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:25,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:03:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:03:25,055 INFO L87 Difference]: Start difference. First operand 1138 states and 1427 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-09 10:03:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:25,955 INFO L93 Difference]: Finished difference Result 1150 states and 1442 transitions. [2024-11-09 10:03:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:03:25,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 92 [2024-11-09 10:03:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:25,959 INFO L225 Difference]: With dead ends: 1150 [2024-11-09 10:03:25,960 INFO L226 Difference]: Without dead ends: 1150 [2024-11-09 10:03:25,960 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-09 10:03:25,963 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 17 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:25,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4453 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:03:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-09 10:03:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1144. [2024-11-09 10:03:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 852 states have (on average 1.6502347417840375) internal successors, (1406), 1136 states have internal predecessors, (1406), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-09 10:03:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1437 transitions. [2024-11-09 10:03:25,989 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1437 transitions. Word has length 92 [2024-11-09 10:03:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:25,989 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1437 transitions. [2024-11-09 10:03:25,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-09 10:03:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1437 transitions. [2024-11-09 10:03:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:03:25,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:25,990 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-09 10:03:25,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:03:25,990 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:25,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash 243663684, now seen corresponding path program 1 times [2024-11-09 10:03:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:25,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733571989] [2024-11-09 10:03:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:25,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:26,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:26,535 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-09 10:03:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733571989] [2024-11-09 10:03:26,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733571989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:26,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:26,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:03:26,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524240394] [2024-11-09 10:03:26,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:26,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:03:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:26,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:03:26,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:03:26,538 INFO L87 Difference]: Start difference. First operand 1144 states and 1437 transitions. Second operand has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-09 10:03:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:27,378 INFO L93 Difference]: Finished difference Result 1144 states and 1436 transitions. [2024-11-09 10:03:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:03:27,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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 92 [2024-11-09 10:03:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:27,384 INFO L225 Difference]: With dead ends: 1144 [2024-11-09 10:03:27,384 INFO L226 Difference]: Without dead ends: 1144 [2024-11-09 10:03:27,385 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-09 10:03:27,385 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 18 mSDsluCounter, 2702 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:27,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3665 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:03:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-09 10:03:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2024-11-09 10:03:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 852 states have (on average 1.6490610328638498) internal successors, (1405), 1136 states have internal predecessors, (1405), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-09 10:03:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1436 transitions. [2024-11-09 10:03:27,411 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1436 transitions. Word has length 92 [2024-11-09 10:03:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:27,411 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1436 transitions. [2024-11-09 10:03:27,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-09 10:03:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1436 transitions. [2024-11-09 10:03:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:03:27,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:27,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:27,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:03:27,413 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:27,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash -461782989, now seen corresponding path program 1 times [2024-11-09 10:03:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620325557] [2024-11-09 10:03:27,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:27,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:28,004 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-09 10:03:28,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:28,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620325557] [2024-11-09 10:03:28,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620325557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:28,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500046710] [2024-11-09 10:03:28,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:28,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:28,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:03:28,007 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-09 10:03:28,008 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-09 10:03:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:28,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 10:03:28,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:03:28,333 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-09 10:03:28,476 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:03:28,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 10:03:28,528 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-09 10:03:28,635 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-09 10:03:28,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:28,817 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-09 10:03:28,858 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-09 10:03:28,890 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-09 10:03:28,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:03:28,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500046710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:28,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:03:28,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:03:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030607573] [2024-11-09 10:03:28,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:03:28,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:03:28,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:28,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:03:28,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=320, Unknown=6, NotChecked=0, Total=380 [2024-11-09 10:03:28,954 INFO L87 Difference]: Start difference. First operand 1144 states and 1436 transitions. Second operand has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:03:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:31,371 INFO L93 Difference]: Finished difference Result 1151 states and 1443 transitions. [2024-11-09 10:03:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:03:31,372 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2024-11-09 10:03:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:31,376 INFO L225 Difference]: With dead ends: 1151 [2024-11-09 10:03:31,376 INFO L226 Difference]: Without dead ends: 1151 [2024-11-09 10:03:31,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=506, Unknown=7, NotChecked=0, Total=600 [2024-11-09 10:03:31,377 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 876 mSDsluCounter, 6617 mSDsCounter, 0 mSdLazyCounter, 4388 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 7243 SdHoareTripleChecker+Invalid, 4407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:31,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 7243 Invalid, 4407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4388 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:03:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-09 10:03:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1148. [2024-11-09 10:03:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 856 states have (on average 1.6460280373831775) internal successors, (1409), 1139 states have internal predecessors, (1409), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:03:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1438 transitions. [2024-11-09 10:03:31,398 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1438 transitions. Word has length 93 [2024-11-09 10:03:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:31,399 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1438 transitions. [2024-11-09 10:03:31,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:03:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1438 transitions. [2024-11-09 10:03:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:03:31,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:31,400 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] [2024-11-09 10:03:31,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:03:31,604 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,SelfDestructingSolverStorable16 [2024-11-09 10:03:31,605 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:31,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash -461782988, now seen corresponding path program 1 times [2024-11-09 10:03:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:31,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017221354] [2024-11-09 10:03:31,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:31,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:32,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:32,543 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-09 10:03:32,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:32,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017221354] [2024-11-09 10:03:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017221354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138113370] [2024-11-09 10:03:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:32,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:32,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:03:32,546 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-09 10:03:32,548 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-09 10:03:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:32,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 10:03:32,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:03:32,786 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-09 10:03:32,913 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:03:32,913 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-09 10:03:32,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:03:32,934 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-09 10:03:32,939 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-09 10:03:33,011 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-09 10:03:33,015 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-09 10:03:33,125 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:33,126 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-09 10:03:33,131 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-09 10:03:33,164 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-09 10:03:33,172 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-09 10:03:33,173 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-09 10:03:33,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:03:33,279 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_752) |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~mem54#1.base| v_ArrVal_753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_752 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-09 10:03:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138113370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:33,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:03:33,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2024-11-09 10:03:33,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174759756] [2024-11-09 10:03:33,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:03:33,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:03:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:33,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:03:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-09 10:03:33,284 INFO L87 Difference]: Start difference. First operand 1148 states and 1438 transitions. Second operand has 16 states, 13 states have (on average 10.846153846153847) internal successors, (141), 15 states have internal predecessors, (141), 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-09 10:03:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:35,269 INFO L93 Difference]: Finished difference Result 1150 states and 1442 transitions. [2024-11-09 10:03:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:03:35,270 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 10.846153846153847) internal successors, (141), 15 states have internal predecessors, (141), 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 93 [2024-11-09 10:03:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:35,274 INFO L225 Difference]: With dead ends: 1150 [2024-11-09 10:03:35,274 INFO L226 Difference]: Without dead ends: 1150 [2024-11-09 10:03:35,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=420, Unknown=1, NotChecked=42, Total=552 [2024-11-09 10:03:35,275 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 874 mSDsluCounter, 4254 mSDsCounter, 0 mSdLazyCounter, 3896 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:35,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 4883 Invalid, 3918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3896 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:03:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-09 10:03:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1141. [2024-11-09 10:03:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 851 states have (on average 1.6474735605170387) internal successors, (1402), 1133 states have internal predecessors, (1402), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:03:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1430 transitions. [2024-11-09 10:03:35,296 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1430 transitions. Word has length 93 [2024-11-09 10:03:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:35,296 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1430 transitions. [2024-11-09 10:03:35,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 10.846153846153847) internal successors, (141), 15 states have internal predecessors, (141), 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-09 10:03:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1430 transitions. [2024-11-09 10:03:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:03:35,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:35,298 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-09 10:03:35,318 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-09 10:03:35,502 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,SelfDestructingSolverStorable17 [2024-11-09 10:03:35,503 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:35,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash 490689540, now seen corresponding path program 1 times [2024-11-09 10:03:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:35,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176397196] [2024-11-09 10:03:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:35,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:36,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:36,134 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-09 10:03:36,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176397196] [2024-11-09 10:03:36,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176397196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:36,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:36,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:03:36,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215732332] [2024-11-09 10:03:36,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:36,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:03:36,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:36,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:03:36,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:03:36,139 INFO L87 Difference]: Start difference. First operand 1141 states and 1430 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:38,011 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-09 10:03:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:03:38,012 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-09 10:03:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:38,016 INFO L225 Difference]: With dead ends: 1154 [2024-11-09 10:03:38,016 INFO L226 Difference]: Without dead ends: 1154 [2024-11-09 10:03:38,016 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-09 10:03:38,017 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 910 mSDsluCounter, 6027 mSDsCounter, 0 mSdLazyCounter, 4012 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 6653 SdHoareTripleChecker+Invalid, 4031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:38,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 6653 Invalid, 4031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4012 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:03:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-09 10:03:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1150. [2024-11-09 10:03:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 859 states have (on average 1.6437718277066355) internal successors, (1412), 1141 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:03:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1441 transitions. [2024-11-09 10:03:38,037 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1441 transitions. Word has length 95 [2024-11-09 10:03:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:38,038 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1441 transitions. [2024-11-09 10:03:38,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1441 transitions. [2024-11-09 10:03:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:03:38,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:38,039 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-09 10:03:38,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:03:38,040 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:38,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash 490689541, now seen corresponding path program 1 times [2024-11-09 10:03:38,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:38,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132155224] [2024-11-09 10:03:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:38,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:38,832 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-09 10:03:38,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:38,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132155224] [2024-11-09 10:03:38,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132155224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:38,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:03:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208062702] [2024-11-09 10:03:38,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:38,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:03:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:38,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:03:38,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:03:38,835 INFO L87 Difference]: Start difference. First operand 1150 states and 1441 transitions. Second operand has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:40,966 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-09 10:03:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:03:40,967 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-09 10:03:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:40,971 INFO L225 Difference]: With dead ends: 1153 [2024-11-09 10:03:40,972 INFO L226 Difference]: Without dead ends: 1153 [2024-11-09 10:03:40,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:03:40,972 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 904 mSDsluCounter, 4257 mSDsCounter, 0 mSdLazyCounter, 3881 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4887 SdHoareTripleChecker+Invalid, 3898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:40,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 4887 Invalid, 3898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3881 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:03:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-09 10:03:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1150. [2024-11-09 10:03:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 859 states have (on average 1.6426076833527357) internal successors, (1411), 1141 states have internal predecessors, (1411), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:03:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1440 transitions. [2024-11-09 10:03:40,995 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1440 transitions. Word has length 95 [2024-11-09 10:03:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:40,996 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1440 transitions. [2024-11-09 10:03:40,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1440 transitions. [2024-11-09 10:03:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:03:40,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:40,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:40,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 10:03:40,997 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:40,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash -196136684, now seen corresponding path program 1 times [2024-11-09 10:03:40,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:40,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885750336] [2024-11-09 10:03:40,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:41,611 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-09 10:03:41,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:41,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885750336] [2024-11-09 10:03:41,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885750336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:41,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953093597] [2024-11-09 10:03:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:41,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:41,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:03:41,615 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-09 10:03:41,616 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-09 10:03:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:41,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 10:03:41,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:03:41,885 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-09 10:03:42,033 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:03:42,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 10:03:42,066 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-09 10:03:42,152 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-09 10:03:42,304 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:42,305 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-09 10:03:42,392 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:42,393 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-09 10:03:42,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:03:42,435 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-09 10:03:42,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:03:42,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1040 (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_1040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 10:03:42,499 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1040 (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| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1043))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1040)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:03:42,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953093597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:42,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:03:42,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-09 10:03:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593904480] [2024-11-09 10:03:42,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:03:42,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 10:03:42,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:42,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 10:03:42,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=428, Unknown=10, NotChecked=86, Total=600 [2024-11-09 10:03:42,503 INFO L87 Difference]: Start difference. First operand 1150 states and 1440 transitions. Second operand has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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-09 10:03:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:45,557 INFO L93 Difference]: Finished difference Result 1152 states and 1444 transitions. [2024-11-09 10:03:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:03:45,558 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-09 10:03:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:45,562 INFO L225 Difference]: With dead ends: 1152 [2024-11-09 10:03:45,562 INFO L226 Difference]: Without dead ends: 1152 [2024-11-09 10:03:45,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=597, Unknown=10, NotChecked=102, Total=812 [2024-11-09 10:03:45,563 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 869 mSDsluCounter, 9615 mSDsCounter, 0 mSdLazyCounter, 6158 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 10240 SdHoareTripleChecker+Invalid, 6176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:45,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 10240 Invalid, 6176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6158 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 10:03:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-11-09 10:03:45,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1149. [2024-11-09 10:03:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 859 states have (on average 1.6414435389988358) internal successors, (1410), 1140 states have internal predecessors, (1410), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:03:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1439 transitions. [2024-11-09 10:03:45,587 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1439 transitions. Word has length 96 [2024-11-09 10:03:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:45,588 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1439 transitions. [2024-11-09 10:03:45,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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-09 10:03:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1439 transitions. [2024-11-09 10:03:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:03:45,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:45,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:45,609 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-09 10:03:45,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:45,792 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:45,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:45,793 INFO L85 PathProgramCache]: Analyzing trace with hash -196136683, now seen corresponding path program 1 times [2024-11-09 10:03:45,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:45,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946924679] [2024-11-09 10:03:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:46,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:46,705 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-09 10:03:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:46,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946924679] [2024-11-09 10:03:46,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946924679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:46,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781802144] [2024-11-09 10:03:46,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:46,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:46,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:03:46,708 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-09 10:03:46,710 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-09 10:03:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:46,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 10:03:46,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:03:46,954 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-09 10:03:47,053 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-09 10:03:47,061 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:03:47,061 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-09 10:03:47,074 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-09 10:03:47,081 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-09 10:03:47,142 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-09 10:03:47,147 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-09 10:03:47,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:47,254 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-09 10:03:47,260 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-09 10:03:47,327 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:47,328 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-09 10:03:47,336 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-09 10:03:47,352 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-09 10:03:47,356 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-09 10:03:47,360 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-09 10:03:47,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:03:47,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1201 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1201) |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~mem56#1.base| v_ArrVal_1202) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:03:47,433 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_1201 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1202) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:03:47,487 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1207 (Array Int Int)) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1207))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1208) .cse0 v_ArrVal_1201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1202) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1207 (Array Int Int)) (v_ArrVal_1201 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1208) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-09 10:03:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781802144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:47,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:03:47,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-11-09 10:03:47,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970056497] [2024-11-09 10:03:47,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:03:47,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:03:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:47,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:03:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=320, Unknown=3, NotChecked=114, Total=506 [2024-11-09 10:03:47,492 INFO L87 Difference]: Start difference. First operand 1149 states and 1439 transitions. Second operand has 18 states, 15 states have (on average 9.733333333333333) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:03:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:49,127 INFO L93 Difference]: Finished difference Result 1151 states and 1443 transitions. [2024-11-09 10:03:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:03:49,129 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.733333333333333) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-09 10:03:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:49,133 INFO L225 Difference]: With dead ends: 1151 [2024-11-09 10:03:49,133 INFO L226 Difference]: Without dead ends: 1151 [2024-11-09 10:03:49,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=546, Unknown=3, NotChecked=150, Total=812 [2024-11-09 10:03:49,134 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 883 mSDsluCounter, 3860 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 4488 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:49,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 4488 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3310 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:03:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-09 10:03:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1139. [2024-11-09 10:03:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 851 states have (on average 1.645123384253819) internal successors, (1400), 1131 states have internal predecessors, (1400), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:03:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1428 transitions. [2024-11-09 10:03:49,153 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1428 transitions. Word has length 96 [2024-11-09 10:03:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:49,153 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1428 transitions. [2024-11-09 10:03:49,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.733333333333333) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:03:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1428 transitions. [2024-11-09 10:03:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 10:03:49,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:49,154 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-09 10:03:49,174 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-09 10:03:49,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:49,355 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:49,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1935942966, now seen corresponding path program 1 times [2024-11-09 10:03:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422487653] [2024-11-09 10:03:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:49,973 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-09 10:03:49,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:49,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422487653] [2024-11-09 10:03:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422487653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:49,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:49,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:03:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237856177] [2024-11-09 10:03:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:49,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:03:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:49,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:03:49,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:03:49,975 INFO L87 Difference]: Start difference. First operand 1139 states and 1428 transitions. Second operand has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:51,530 INFO L93 Difference]: Finished difference Result 1155 states and 1447 transitions. [2024-11-09 10:03:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:03:51,531 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-09 10:03:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:51,534 INFO L225 Difference]: With dead ends: 1155 [2024-11-09 10:03:51,534 INFO L226 Difference]: Without dead ends: 1155 [2024-11-09 10:03:51,535 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-09 10:03:51,535 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 913 mSDsluCounter, 4847 mSDsCounter, 0 mSdLazyCounter, 3316 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 5472 SdHoareTripleChecker+Invalid, 3335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:51,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 5472 Invalid, 3335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3316 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:03:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-09 10:03:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1151. [2024-11-09 10:03:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 862 states have (on average 1.6392111368909512) internal successors, (1413), 1142 states have internal predecessors, (1413), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:03:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1442 transitions. [2024-11-09 10:03:51,554 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1442 transitions. Word has length 98 [2024-11-09 10:03:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:51,554 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1442 transitions. [2024-11-09 10:03:51,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1442 transitions. [2024-11-09 10:03:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 10:03:51,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:51,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:51,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 10:03:51,556 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:51,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:51,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1935942965, now seen corresponding path program 1 times [2024-11-09 10:03:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:51,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283836264] [2024-11-09 10:03:51,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:52,421 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-09 10:03:52,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:52,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283836264] [2024-11-09 10:03:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283836264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:52,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:52,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:03:52,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511244638] [2024-11-09 10:03:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:52,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:03:52,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:52,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:03:52,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:03:52,423 INFO L87 Difference]: Start difference. First operand 1151 states and 1442 transitions. Second operand has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:53,721 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-09 10:03:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:03:53,721 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-09 10:03:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:53,724 INFO L225 Difference]: With dead ends: 1154 [2024-11-09 10:03:53,724 INFO L226 Difference]: Without dead ends: 1154 [2024-11-09 10:03:53,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:03:53,725 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 912 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 2594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:53,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 3306 Invalid, 2594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:03:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-09 10:03:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2024-11-09 10:03:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 862 states have (on average 1.6380510440835268) internal successors, (1412), 1142 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:03:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1441 transitions. [2024-11-09 10:03:53,742 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1441 transitions. Word has length 98 [2024-11-09 10:03:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:53,742 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1441 transitions. [2024-11-09 10:03:53,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1441 transitions. [2024-11-09 10:03:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:03:53,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:53,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:53,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 10:03:53,744 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:53,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:53,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1951784006, now seen corresponding path program 1 times [2024-11-09 10:03:53,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:53,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031597162] [2024-11-09 10:03:53,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:53,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:54,465 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-09 10:03:54,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031597162] [2024-11-09 10:03:54,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031597162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:54,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276520770] [2024-11-09 10:03:54,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:54,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:54,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:03:54,468 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-09 10:03:54,470 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-09 10:03:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:54,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 10:03:54,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:03:54,725 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-09 10:03:54,839 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:03:54,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 10:03:54,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-09 10:03:54,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-09 10:03:55,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:55,087 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-09 10:03:55,172 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:55,173 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-09 10:03:55,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:55,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:03:55,242 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-09 10:03:55,278 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-09 10:03:55,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:03:55,291 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1520 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 10:03:55,337 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (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| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1519))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1520)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:03:55,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276520770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:55,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:03:55,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-09 10:03:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649654759] [2024-11-09 10:03:55,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:03:55,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:03:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:55,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:03:55,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=569, Unknown=37, NotChecked=102, Total=812 [2024-11-09 10:03:55,462 INFO L87 Difference]: Start difference. First operand 1151 states and 1441 transitions. Second operand has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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-09 10:03:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:58,087 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-09 10:03:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:03:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-09 10:03:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:58,090 INFO L225 Difference]: With dead ends: 1153 [2024-11-09 10:03:58,090 INFO L226 Difference]: Without dead ends: 1153 [2024-11-09 10:03:58,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=766, Unknown=39, NotChecked=118, Total=1056 [2024-11-09 10:03:58,091 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 862 mSDsluCounter, 8437 mSDsCounter, 0 mSdLazyCounter, 5521 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 9061 SdHoareTripleChecker+Invalid, 5541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:58,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 9061 Invalid, 5541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5521 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 10:03:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-09 10:03:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1150. [2024-11-09 10:03:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 862 states have (on average 1.636890951276102) internal successors, (1411), 1141 states have internal predecessors, (1411), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:03:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1440 transitions. [2024-11-09 10:03:58,108 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1440 transitions. Word has length 99 [2024-11-09 10:03:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:58,108 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1440 transitions. [2024-11-09 10:03:58,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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-09 10:03:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1440 transitions. [2024-11-09 10:03:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:03:58,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:58,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:58,129 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-09 10:03:58,313 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,SelfDestructingSolverStorable24 [2024-11-09 10:03:58,314 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:03:58,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1951784005, now seen corresponding path program 1 times [2024-11-09 10:03:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:58,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361985833] [2024-11-09 10:03:58,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:59,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:03:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:59,249 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-09 10:03:59,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361985833] [2024-11-09 10:03:59,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361985833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875552613] [2024-11-09 10:03:59,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:59,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:59,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:03:59,252 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-09 10:03:59,254 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-09 10:03:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:59,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 10:03:59,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:03:59,519 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-09 10:03:59,780 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:03:59,781 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-09 10:03:59,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:03:59,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 10:03:59,947 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 10:03:59,947 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 41 treesize of output 38 [2024-11-09 10:03:59,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 10:04:00,012 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 10:04:00,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 10:04:00,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 10:04:00,121 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 10:04:00,121 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 61 treesize of output 54 [2024-11-09 10:04:00,135 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 35 treesize of output 11 [2024-11-09 10:04:00,156 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 25 treesize of output 13 [2024-11-09 10:04:00,160 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 7 treesize of output 3 [2024-11-09 10:04:00,183 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-09 10:04:00,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:04:00,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:04:00,398 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 140 treesize of output 144 [2024-11-09 10:04:00,489 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_7 Int) (v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1692))) (let ((.cse0 (+ (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4))) (or (< .cse0 0) (< 0 (+ (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_prenex_7))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 9)))))) (or (forall ((v_ArrVal_1695 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1693))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1695)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~mem56#1.base|)) (forall ((v_ArrVal_1692 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) 0))) (forall ((v_ArrVal_1692 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1692))) (let ((.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4))) (or (< .cse5 0) (forall ((v_ArrVal_1694 Int) (v_ArrVal_1693 (Array Int Int))) (< (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse5 v_ArrVal_1694))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 9))))))))) is different from false [2024-11-09 10:04:00,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1694 Int) (v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1692))) (let ((.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (or (< (select (select (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1694))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 9)) (< .cse2 0))))) (or (forall ((v_ArrVal_1695 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1693))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_1695)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) .cse3)) (forall ((v_ArrVal_1692 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) 0))) (forall ((v_prenex_7 Int) (v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1692))) (let ((.cse8 (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (or (< 0 (+ 9 (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_prenex_7))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< .cse8 0)))))))) is different from false [2024-11-09 10:04:00,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1702))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1692 (Array Int Int))) (< (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1701) .cse0 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_1695 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store .cse3 .cse0 v_ArrVal_1693))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1695)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1694 Int) (v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1702))) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1701)) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse9 .cse8 v_ArrVal_1692))) (let ((.cse4 (+ 4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (or (< .cse4 0) (< (select (select (let ((.cse6 (select (select (store .cse7 .cse8 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse4 v_ArrVal_1694))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1702 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1702))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1701) .cse14 v_ArrVal_1692))) (let ((.cse10 (+ 4 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (or (< .cse10 0) (< 0 (+ 9 (select (select (let ((.cse12 (select (select (store .cse13 .cse14 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store .cse11 .cse12 (store (select .cse11 .cse12) .cse10 v_prenex_7))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-09 10:04:00,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875552613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:00,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:04:00,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2024-11-09 10:04:00,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066187103] [2024-11-09 10:04:00,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:04:00,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 10:04:00,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:00,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 10:04:00,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=620, Unknown=3, NotChecked=156, Total=870 [2024-11-09 10:04:00,649 INFO L87 Difference]: Start difference. First operand 1150 states and 1440 transitions. Second operand has 23 states, 20 states have (on average 9.3) internal successors, (186), 22 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:04:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:03,750 INFO L93 Difference]: Finished difference Result 1663 states and 2171 transitions. [2024-11-09 10:04:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:04:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 9.3) internal successors, (186), 22 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-09 10:04:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:03,758 INFO L225 Difference]: With dead ends: 1663 [2024-11-09 10:04:03,758 INFO L226 Difference]: Without dead ends: 1663 [2024-11-09 10:04:03,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=964, Unknown=3, NotChecked=198, Total=1332 [2024-11-09 10:04:03,759 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 1279 mSDsluCounter, 8019 mSDsCounter, 0 mSdLazyCounter, 6420 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 8647 SdHoareTripleChecker+Invalid, 6450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 6420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:03,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 8647 Invalid, 6450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 6420 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 10:04:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-09 10:04:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1137. [2024-11-09 10:04:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 851 states have (on average 1.6427732079905992) internal successors, (1398), 1129 states have internal predecessors, (1398), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:04:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1426 transitions. [2024-11-09 10:04:03,788 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1426 transitions. Word has length 99 [2024-11-09 10:04:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:03,789 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1426 transitions. [2024-11-09 10:04:03,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 9.3) internal successors, (186), 22 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:04:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1426 transitions. [2024-11-09 10:04:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 10:04:03,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:03,790 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-09 10:04:03,812 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-09 10:04:03,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 10:04:03,992 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:04:03,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:03,992 INFO L85 PathProgramCache]: Analyzing trace with hash -855395989, now seen corresponding path program 1 times [2024-11-09 10:04:03,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:03,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020121219] [2024-11-09 10:04:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:03,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:04,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:04:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:04,652 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-09 10:04:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020121219] [2024-11-09 10:04:04,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020121219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:04,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:04,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 10:04:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440927443] [2024-11-09 10:04:04,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:04,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:04:04,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:04,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:04:04,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:04:04,654 INFO L87 Difference]: Start difference. First operand 1137 states and 1426 transitions. Second operand has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:06,189 INFO L93 Difference]: Finished difference Result 1156 states and 1448 transitions. [2024-11-09 10:04:06,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:04:06,190 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-09 10:04:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:06,193 INFO L225 Difference]: With dead ends: 1156 [2024-11-09 10:04:06,193 INFO L226 Difference]: Without dead ends: 1156 [2024-11-09 10:04:06,193 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-09 10:04:06,194 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 892 mSDsluCounter, 4810 mSDsCounter, 0 mSdLazyCounter, 3341 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 5434 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:06,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 5434 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3341 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:04:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-11-09 10:04:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1152. [2024-11-09 10:04:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 865 states have (on average 1.6346820809248555) internal successors, (1414), 1143 states have internal predecessors, (1414), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:04:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1443 transitions. [2024-11-09 10:04:06,220 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1443 transitions. Word has length 101 [2024-11-09 10:04:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:06,221 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1443 transitions. [2024-11-09 10:04:06,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1443 transitions. [2024-11-09 10:04:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 10:04:06,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:06,222 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-09 10:04:06,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 10:04:06,222 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:04:06,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash -855395988, now seen corresponding path program 1 times [2024-11-09 10:04:06,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:06,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298445059] [2024-11-09 10:04:06,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:07,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:04:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:07,085 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-09 10:04:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298445059] [2024-11-09 10:04:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298445059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:07,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:07,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:04:07,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840800588] [2024-11-09 10:04:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:07,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:04:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:07,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:04:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:04:07,087 INFO L87 Difference]: Start difference. First operand 1152 states and 1443 transitions. Second operand has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 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-09 10:04:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:09,055 INFO L93 Difference]: Finished difference Result 1155 states and 1447 transitions. [2024-11-09 10:04:09,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:04:09,055 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 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-09 10:04:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:09,057 INFO L225 Difference]: With dead ends: 1155 [2024-11-09 10:04:09,057 INFO L226 Difference]: Without dead ends: 1155 [2024-11-09 10:04:09,058 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-09 10:04:09,059 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 888 mSDsluCounter, 4836 mSDsCounter, 0 mSdLazyCounter, 4243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 5464 SdHoareTripleChecker+Invalid, 4260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:09,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 5464 Invalid, 4260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4243 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:04:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-09 10:04:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1152. [2024-11-09 10:04:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 865 states have (on average 1.6335260115606935) internal successors, (1413), 1143 states have internal predecessors, (1413), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:04:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1442 transitions. [2024-11-09 10:04:09,072 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1442 transitions. Word has length 101 [2024-11-09 10:04:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:09,072 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1442 transitions. [2024-11-09 10:04:09,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 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-09 10:04:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1442 transitions. [2024-11-09 10:04:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:04:09,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:09,073 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-09 10:04:09,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 10:04:09,074 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:04:09,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash -329416069, now seen corresponding path program 1 times [2024-11-09 10:04:09,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:09,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752438216] [2024-11-09 10:04:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:09,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:04:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:09,765 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-09 10:04:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:09,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752438216] [2024-11-09 10:04:09,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752438216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:09,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191223783] [2024-11-09 10:04:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:09,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:09,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:04:09,768 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-09 10:04:09,769 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-09 10:04:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:10,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 10:04:10,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:04:10,018 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-09 10:04:10,124 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:04:10,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 10:04:10,154 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-09 10:04:10,238 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-09 10:04:10,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:10,367 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-09 10:04:10,461 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:10,461 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-09 10:04:10,523 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:10,523 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-09 10:04:10,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:10,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:04:10,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:04:10,636 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-09 10:04:10,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:04:10,701 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (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| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2038))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:04:10,705 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (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_2038))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:04:10,715 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 (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~mem56#1.base| v_ArrVal_2037))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2038)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:04:10,789 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 (Array Int Int)) (v_ArrVal_2042 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2042))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2037)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2038)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:04:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191223783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:10,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:04:10,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-09 10:04:10,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387849519] [2024-11-09 10:04:10,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:04:10,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:04:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:10,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:04:10,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=679, Unknown=23, NotChecked=228, Total=1056 [2024-11-09 10:04:10,793 INFO L87 Difference]: Start difference. First operand 1152 states and 1442 transitions. Second operand has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 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) [2024-11-09 10:04:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:13,234 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-09 10:04:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:04:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 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) Word has length 102 [2024-11-09 10:04:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:13,236 INFO L225 Difference]: With dead ends: 1154 [2024-11-09 10:04:13,236 INFO L226 Difference]: Without dead ends: 1154 [2024-11-09 10:04:13,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=894, Unknown=23, NotChecked=260, Total=1332 [2024-11-09 10:04:13,237 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 861 mSDsluCounter, 7803 mSDsCounter, 0 mSdLazyCounter, 5138 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 8426 SdHoareTripleChecker+Invalid, 5156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:13,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 8426 Invalid, 5156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5138 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 10:04:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-09 10:04:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2024-11-09 10:04:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 865 states have (on average 1.6323699421965319) internal successors, (1412), 1142 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:04:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1441 transitions. [2024-11-09 10:04:13,250 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1441 transitions. Word has length 102 [2024-11-09 10:04:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:13,250 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1441 transitions. [2024-11-09 10:04:13,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 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) [2024-11-09 10:04:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1441 transitions. [2024-11-09 10:04:13,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:04:13,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:13,251 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-09 10:04:13,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 10:04:13,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:13,452 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:04:13,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:13,453 INFO L85 PathProgramCache]: Analyzing trace with hash -329416068, now seen corresponding path program 1 times [2024-11-09 10:04:13,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:13,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306521078] [2024-11-09 10:04:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:14,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:04:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:14,488 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-09 10:04:14,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306521078] [2024-11-09 10:04:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306521078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875607002] [2024-11-09 10:04:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:14,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:14,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:04:14,491 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-09 10:04:14,493 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-09 10:04:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:14,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 10:04:14,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:04:14,798 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-09 10:04:14,892 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:04:14,892 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-09 10:04:14,899 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-09 10:04:14,921 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-09 10:04:14,926 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-09 10:04:15,000 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-09 10:04:15,004 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-09 10:04:15,084 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:15,084 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-09 10:04:15,095 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-09 10:04:15,160 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:15,160 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-09 10:04:15,163 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-09 10:04:15,224 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:15,224 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-09 10:04:15,230 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-09 10:04:15,276 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:15,276 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-09 10:04:15,280 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-09 10:04:15,305 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-09 10:04:15,312 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-09 10:04:15,332 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-09 10:04:15,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:04:15,379 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2229 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2228 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2229) |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~mem58#1.base| v_ArrVal_2228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:04:15,386 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_2229 (Array Int Int)) (v_ArrVal_2228 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2229 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-09 10:04:15,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2227))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2226) .cse0 v_ArrVal_2229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2226) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 10:04:15,411 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_2229 (Array Int Int)) (v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2227))) (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_2226) .cse1 v_ArrVal_2229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2226) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-09 10:04:15,433 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2225))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2227))) (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~mem56#1.base| v_ArrVal_2224) .cse0 v_ArrVal_2226) .cse1 v_ArrVal_2229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2225))) (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~mem56#1.base| v_ArrVal_2224) .cse5 v_ArrVal_2226) (select (select (store .cse6 .cse5 v_ArrVal_2227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2229))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-09 10:04:15,573 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2234 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2234))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2225))) (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~mem54#1.base| v_ArrVal_2235) .cse0 v_ArrVal_2224) .cse1 v_ArrVal_2226) (select (select (store .cse2 .cse1 v_ArrVal_2227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2229))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2234 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2234))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2225))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2227))) (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~mem54#1.base| v_ArrVal_2235) .cse5 v_ArrVal_2224) .cse6 v_ArrVal_2226) .cse7 v_ArrVal_2229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-09 10:04:15,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875607002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:15,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:04:15,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-09 10:04:15,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336126575] [2024-11-09 10:04:15,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:04:15,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 10:04:15,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:15,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 10:04:15,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=650, Unknown=16, NotChecked=342, Total=1122 [2024-11-09 10:04:15,577 INFO L87 Difference]: Start difference. First operand 1151 states and 1441 transitions. Second operand has 25 states, 22 states have (on average 7.5) internal successors, (165), 24 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) [2024-11-09 10:04:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:19,165 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-09 10:04:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:04:19,166 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.5) internal successors, (165), 24 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) Word has length 102 [2024-11-09 10:04:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:19,168 INFO L225 Difference]: With dead ends: 1153 [2024-11-09 10:04:19,168 INFO L226 Difference]: Without dead ends: 1153 [2024-11-09 10:04:19,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=1077, Unknown=17, NotChecked=438, Total=1722 [2024-11-09 10:04:19,169 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 876 mSDsluCounter, 7537 mSDsCounter, 0 mSdLazyCounter, 7352 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 8163 SdHoareTripleChecker+Invalid, 7383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 7352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:19,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 8163 Invalid, 7383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 7352 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 10:04:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-09 10:04:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1135. [2024-11-09 10:04:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 851 states have (on average 1.6404230317273796) internal successors, (1396), 1127 states have internal predecessors, (1396), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:04:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1424 transitions. [2024-11-09 10:04:19,182 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1424 transitions. Word has length 102 [2024-11-09 10:04:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:19,182 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1424 transitions. [2024-11-09 10:04:19,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.5) internal successors, (165), 24 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) [2024-11-09 10:04:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1424 transitions. [2024-11-09 10:04:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 10:04:19,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:19,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:19,204 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-09 10:04:19,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:19,384 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:04:19,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:19,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1491035757, now seen corresponding path program 1 times [2024-11-09 10:04:19,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:19,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417499389] [2024-11-09 10:04:19,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:19,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat