./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-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_test5-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 c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:03:58,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:03:59,023 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:59,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:03:59,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:03:59,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:03:59,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:03:59,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:03:59,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:03:59,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:03:59,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:03:59,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:03:59,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:03:59,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:03:59,060 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:03:59,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:03:59,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:03:59,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:03:59,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:03:59,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:03:59,061 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:03:59,065 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:03:59,065 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:03:59,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:03:59,066 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:03:59,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:03:59,066 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:03:59,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:03:59,066 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:03:59,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:03:59,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:03:59,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:03:59,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:03:59,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:03:59,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:03:59,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:03:59,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:03:59,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:03:59,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:03:59,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:03:59,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:03:59,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:03:59,071 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 -> c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c [2024-11-09 10:03:59,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:03:59,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:03:59,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:03:59,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:03:59,291 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:03:59,292 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_test5-1.i [2024-11-09 10:04:00,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:04:00,781 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:04:00,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2024-11-09 10:04:00,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45177101c/53f69d8b512d4708b498ce6b1fcd4e6b/FLAGa14af25cd [2024-11-09 10:04:00,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45177101c/53f69d8b512d4708b498ce6b1fcd4e6b [2024-11-09 10:04:00,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:04:00,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:04:00,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:04:00,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:04:00,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:04:00,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:04:00" (1/1) ... [2024-11-09 10:04:00,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e885bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:00, skipping insertion in model container [2024-11-09 10:04:00,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:04:00" (1/1) ... [2024-11-09 10:04:00,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:04:01,281 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:04:01,316 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:04:01,320 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:04:01,327 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:04:01,335 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:04:01,355 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:04:01,357 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:04:01,359 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:04:01,362 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:04:01,378 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:04:01,379 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:04:01,380 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:04:01,381 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:04:01,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:04:01,395 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:04:01,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:04:01,540 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:04:01,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01 WrapperNode [2024-11-09 10:04:01,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:04:01,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:04:01,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:04:01,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:04:01,548 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:04:01" (1/1) ... [2024-11-09 10:04:01,590 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:04:01" (1/1) ... [2024-11-09 10:04:01,642 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2052 [2024-11-09 10:04:01,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:04:01,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:04:01,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:04:01,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:04:01,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (1/1) ... [2024-11-09 10:04:01,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (1/1) ... [2024-11-09 10:04:01,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (1/1) ... [2024-11-09 10:04:01,748 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2024-11-09 10:04:01,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (1/1) ... [2024-11-09 10:04:01,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (1/1) ... [2024-11-09 10:04:01,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (1/1) ... [2024-11-09 10:04:01,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (1/1) ... [2024-11-09 10:04:01,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (1/1) ... [2024-11-09 10:04:01,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (1/1) ... [2024-11-09 10:04:01,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:04:01,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:04:01,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:04:01,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:04:01,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (1/1) ... [2024-11-09 10:04:01,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:04:01,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:04:01,865 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:04:01,873 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:04:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:04:01,921 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:04:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:04:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:04:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:04:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:04:01,922 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:04:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:04:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:04:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:04:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:04:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:04:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:04:01,923 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:04:01,923 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:04:01,923 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:04:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:04:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:04:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:04:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:04:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:04:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:04:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:04:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:04:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:04:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:04:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:04:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:04:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:04:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:04:01,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:04:02,169 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:04:02,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:04:02,192 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:04:02,226 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:04:02,238 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:04:05,010 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-09 10:04:05,010 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:04:05,058 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:04:05,058 INFO L316 CfgBuilder]: Removed 83 assume(true) statements. [2024-11-09 10:04:05,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:04:05 BoogieIcfgContainer [2024-11-09 10:04:05,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:04:05,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:04:05,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:04:05,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:04:05,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:04:00" (1/3) ... [2024-11-09 10:04:05,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c76d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:04:05, skipping insertion in model container [2024-11-09 10:04:05,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:01" (2/3) ... [2024-11-09 10:04:05,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c76d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:04:05, skipping insertion in model container [2024-11-09 10:04:05,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:04:05" (3/3) ... [2024-11-09 10:04:05,068 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-1.i [2024-11-09 10:04:05,080 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:04:05,080 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 712 error locations. [2024-11-09 10:04:05,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:04:05,135 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;@5da3c054, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:04:05,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-09 10:04:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:04:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:04:05,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:05,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:04:05,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:05,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash 63053744, now seen corresponding path program 1 times [2024-11-09 10:04:05,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:05,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387160173] [2024-11-09 10:04:05,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:05,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:05,279 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:05,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:05,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387160173] [2024-11-09 10:04:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387160173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:05,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:04:05,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086013516] [2024-11-09 10:04:05,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:05,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:04:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:05,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:04:05,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:04:05,308 INFO L87 Difference]: Start difference. First operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:05,405 INFO L93 Difference]: Finished difference Result 1718 states and 1978 transitions. [2024-11-09 10:04:05,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:04:05,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 10:04:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:05,441 INFO L225 Difference]: With dead ends: 1718 [2024-11-09 10:04:05,441 INFO L226 Difference]: Without dead ends: 1716 [2024-11-09 10:04:05,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:04:05,445 INFO L432 NwaCegarLoop]: 1978 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:05,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:04:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-11-09 10:04:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1716. [2024-11-09 10:04:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1005 states have (on average 1.9422885572139303) internal successors, (1952), 1706 states have internal predecessors, (1952), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 1976 transitions. [2024-11-09 10:04:05,543 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 1976 transitions. Word has length 5 [2024-11-09 10:04:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:05,544 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 1976 transitions. [2024-11-09 10:04:05,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 1976 transitions. [2024-11-09 10:04:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:04:05,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:05,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:04:05,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:04:05,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 63053806, now seen corresponding path program 1 times [2024-11-09 10:04:05,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:05,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436324560] [2024-11-09 10:04:05,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:05,690 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:05,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:05,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436324560] [2024-11-09 10:04:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436324560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:05,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:04:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449837611] [2024-11-09 10:04:05,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:05,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:04:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:05,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:04:05,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:04:05,695 INFO L87 Difference]: Start difference. First operand 1716 states and 1976 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:06,840 INFO L93 Difference]: Finished difference Result 1945 states and 2293 transitions. [2024-11-09 10:04:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:04:06,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 10:04:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:06,846 INFO L225 Difference]: With dead ends: 1945 [2024-11-09 10:04:06,846 INFO L226 Difference]: Without dead ends: 1945 [2024-11-09 10:04:06,847 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:04:06,848 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 1737 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:06,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 1918 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:04:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2024-11-09 10:04:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1624. [2024-11-09 10:04:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1005 states have (on average 1.8507462686567164) internal successors, (1860), 1614 states have internal predecessors, (1860), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1884 transitions. [2024-11-09 10:04:06,880 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1884 transitions. Word has length 5 [2024-11-09 10:04:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:06,881 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 1884 transitions. [2024-11-09 10:04:06,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1884 transitions. [2024-11-09 10:04:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:04:06,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:06,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:04:06,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:04:06,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:06,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:06,882 INFO L85 PathProgramCache]: Analyzing trace with hash 63053807, now seen corresponding path program 1 times [2024-11-09 10:04:06,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:06,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389871951] [2024-11-09 10:04:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:06,963 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:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:06,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389871951] [2024-11-09 10:04:06,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389871951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:06,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:06,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:04:06,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808738495] [2024-11-09 10:04:06,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:06,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:04:06,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:06,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:04:06,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:04:06,966 INFO L87 Difference]: Start difference. First operand 1624 states and 1884 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:07,991 INFO L93 Difference]: Finished difference Result 2361 states and 2785 transitions. [2024-11-09 10:04:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:04:07,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 10:04:07,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:08,003 INFO L225 Difference]: With dead ends: 2361 [2024-11-09 10:04:08,004 INFO L226 Difference]: Without dead ends: 2361 [2024-11-09 10:04:08,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:04:08,006 INFO L432 NwaCegarLoop]: 1955 mSDtfsCounter, 1217 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:08,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2890 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:04:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-11-09 10:04:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1887. [2024-11-09 10:04:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1278 states have (on average 1.8262910798122065) internal successors, (2334), 1877 states have internal predecessors, (2334), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2358 transitions. [2024-11-09 10:04:08,056 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2358 transitions. Word has length 5 [2024-11-09 10:04:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:08,057 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2358 transitions. [2024-11-09 10:04:08,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2358 transitions. [2024-11-09 10:04:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:04:08,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:08,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:04:08,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:04:08,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:08,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1957056365, now seen corresponding path program 1 times [2024-11-09 10:04:08,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:08,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632728463] [2024-11-09 10:04:08,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:08,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:08,087 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:08,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:08,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632728463] [2024-11-09 10:04:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632728463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:08,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:04:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88712803] [2024-11-09 10:04:08,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:08,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:04:08,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:08,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:04:08,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:04:08,089 INFO L87 Difference]: Start difference. First operand 1887 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:08,149 INFO L93 Difference]: Finished difference Result 3755 states and 4697 transitions. [2024-11-09 10:04:08,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:04:08,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 10:04:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:08,162 INFO L225 Difference]: With dead ends: 3755 [2024-11-09 10:04:08,163 INFO L226 Difference]: Without dead ends: 3755 [2024-11-09 10:04:08,163 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:04:08,164 INFO L432 NwaCegarLoop]: 2150 mSDtfsCounter, 1830 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 4014 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:08,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 4014 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:04:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2024-11-09 10:04:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1889. [2024-11-09 10:04:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1280 states have (on average 1.825) internal successors, (2336), 1879 states have internal predecessors, (2336), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2360 transitions. [2024-11-09 10:04:08,204 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2360 transitions. Word has length 6 [2024-11-09 10:04:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:08,205 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2360 transitions. [2024-11-09 10:04:08,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2360 transitions. [2024-11-09 10:04:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 10:04:08,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:08,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:08,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:04:08,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:08,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash -408167560, now seen corresponding path program 1 times [2024-11-09 10:04:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:08,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031691508] [2024-11-09 10:04:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:04:08,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:08,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031691508] [2024-11-09 10:04:08,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031691508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:08,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:08,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:04:08,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490548306] [2024-11-09 10:04:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:08,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:04:08,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:08,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:04:08,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:04:08,255 INFO L87 Difference]: Start difference. First operand 1889 states and 2360 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:09,365 INFO L93 Difference]: Finished difference Result 1915 states and 2413 transitions. [2024-11-09 10:04:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:04:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 10:04:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:09,371 INFO L225 Difference]: With dead ends: 1915 [2024-11-09 10:04:09,371 INFO L226 Difference]: Without dead ends: 1915 [2024-11-09 10:04:09,372 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:04:09,372 INFO L432 NwaCegarLoop]: 1160 mSDtfsCounter, 2005 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:09,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 2176 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:04:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2024-11-09 10:04:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1866. [2024-11-09 10:04:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1280 states have (on average 1.80703125) internal successors, (2313), 1856 states have internal predecessors, (2313), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2337 transitions. [2024-11-09 10:04:09,405 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2337 transitions. Word has length 11 [2024-11-09 10:04:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:09,405 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2337 transitions. [2024-11-09 10:04:09,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2337 transitions. [2024-11-09 10:04:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 10:04:09,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:09,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:09,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:04:09,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:09,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:09,407 INFO L85 PathProgramCache]: Analyzing trace with hash -408167559, now seen corresponding path program 1 times [2024-11-09 10:04:09,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:09,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381603787] [2024-11-09 10:04:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:09,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:09,473 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:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:09,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381603787] [2024-11-09 10:04:09,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381603787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:09,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:09,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:04:09,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690096198] [2024-11-09 10:04:09,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:09,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:04:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:04:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:04:09,475 INFO L87 Difference]: Start difference. First operand 1866 states and 2337 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:09,528 INFO L93 Difference]: Finished difference Result 1791 states and 2234 transitions. [2024-11-09 10:04:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:04:09,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 10:04:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:09,535 INFO L225 Difference]: With dead ends: 1791 [2024-11-09 10:04:09,535 INFO L226 Difference]: Without dead ends: 1791 [2024-11-09 10:04:09,535 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:04:09,536 INFO L432 NwaCegarLoop]: 1736 mSDtfsCounter, 61 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3419 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:04:09,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3419 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:04:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2024-11-09 10:04:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2024-11-09 10:04:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1217 states have (on average 1.8159408381265407) internal successors, (2210), 1781 states have internal predecessors, (2210), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2234 transitions. [2024-11-09 10:04:09,561 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2234 transitions. Word has length 11 [2024-11-09 10:04:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:09,561 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2234 transitions. [2024-11-09 10:04:09,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2234 transitions. [2024-11-09 10:04:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:04:09,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:09,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:09,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:04:09,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:09,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:09,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1406843659, now seen corresponding path program 1 times [2024-11-09 10:04:09,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:09,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862676504] [2024-11-09 10:04:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:09,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:09,633 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:09,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:09,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862676504] [2024-11-09 10:04:09,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862676504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:09,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:09,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:04:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637955253] [2024-11-09 10:04:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:09,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:04:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:04:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:04:09,635 INFO L87 Difference]: Start difference. First operand 1791 states and 2234 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:09,727 INFO L93 Difference]: Finished difference Result 1776 states and 2212 transitions. [2024-11-09 10:04:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:04:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 10:04:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:09,731 INFO L225 Difference]: With dead ends: 1776 [2024-11-09 10:04:09,732 INFO L226 Difference]: Without dead ends: 1776 [2024-11-09 10:04:09,732 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:04:09,732 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 45 mSDsluCounter, 3373 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:09,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5071 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:04:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-09 10:04:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2024-11-09 10:04:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1209 states have (on average 1.8097601323407775) internal successors, (2188), 1766 states have internal predecessors, (2188), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2212 transitions. [2024-11-09 10:04:09,752 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2212 transitions. Word has length 13 [2024-11-09 10:04:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:09,752 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2212 transitions. [2024-11-09 10:04:09,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2212 transitions. [2024-11-09 10:04:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 10:04:09,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:09,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:09,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:04:09,753 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1340702493, now seen corresponding path program 1 times [2024-11-09 10:04:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054978847] [2024-11-09 10:04:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:09,877 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:09,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:09,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054978847] [2024-11-09 10:04:09,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054978847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:09,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:09,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:04:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017380285] [2024-11-09 10:04:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:09,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:04:09,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:09,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:04:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:04:09,879 INFO L87 Difference]: Start difference. First operand 1776 states and 2212 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:11,295 INFO L93 Difference]: Finished difference Result 2296 states and 2712 transitions. [2024-11-09 10:04:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:04:11,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 10:04:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:11,301 INFO L225 Difference]: With dead ends: 2296 [2024-11-09 10:04:11,301 INFO L226 Difference]: Without dead ends: 2296 [2024-11-09 10:04:11,301 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:04:11,302 INFO L432 NwaCegarLoop]: 1431 mSDtfsCounter, 1222 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:11,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 3385 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:04:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2024-11-09 10:04:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1772. [2024-11-09 10:04:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1209 states have (on average 1.8064516129032258) internal successors, (2184), 1762 states have internal predecessors, (2184), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2208 transitions. [2024-11-09 10:04:11,322 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2208 transitions. Word has length 27 [2024-11-09 10:04:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:11,322 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2208 transitions. [2024-11-09 10:04:11,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2208 transitions. [2024-11-09 10:04:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 10:04:11,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:11,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:11,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:04:11,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:11,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:11,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1878905961, now seen corresponding path program 1 times [2024-11-09 10:04:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:11,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33218493] [2024-11-09 10:04:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:11,387 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:11,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33218493] [2024-11-09 10:04:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33218493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:11,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:11,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:04:11,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588706471] [2024-11-09 10:04:11,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:11,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:04:11,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:04:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:04:11,389 INFO L87 Difference]: Start difference. First operand 1772 states and 2208 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:11,429 INFO L93 Difference]: Finished difference Result 1766 states and 2198 transitions. [2024-11-09 10:04:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:04:11,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-09 10:04:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:11,433 INFO L225 Difference]: With dead ends: 1766 [2024-11-09 10:04:11,434 INFO L226 Difference]: Without dead ends: 1766 [2024-11-09 10:04:11,434 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:04:11,434 INFO L432 NwaCegarLoop]: 1696 mSDtfsCounter, 21 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5057 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:04:11,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5057 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:04:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-11-09 10:04:11,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2024-11-09 10:04:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1203 states have (on average 1.8071487946799667) internal successors, (2174), 1756 states have internal predecessors, (2174), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2198 transitions. [2024-11-09 10:04:11,451 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2198 transitions. Word has length 61 [2024-11-09 10:04:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:11,452 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2198 transitions. [2024-11-09 10:04:11,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2198 transitions. [2024-11-09 10:04:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 10:04:11,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:11,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:11,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:04:11,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1294710755, now seen corresponding path program 1 times [2024-11-09 10:04:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:11,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474703631] [2024-11-09 10:04:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:11,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:11,536 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:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474703631] [2024-11-09 10:04:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474703631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:11,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:04:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136816572] [2024-11-09 10:04:11,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:11,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:04:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:04:11,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:04:11,538 INFO L87 Difference]: Start difference. First operand 1766 states and 2198 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:11,591 INFO L93 Difference]: Finished difference Result 1858 states and 2317 transitions. [2024-11-09 10:04:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:04:11,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-09 10:04:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:11,597 INFO L225 Difference]: With dead ends: 1858 [2024-11-09 10:04:11,598 INFO L226 Difference]: Without dead ends: 1858 [2024-11-09 10:04:11,598 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:04:11,599 INFO L432 NwaCegarLoop]: 1711 mSDtfsCounter, 54 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:11,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3395 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:04:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2024-11-09 10:04:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2024-11-09 10:04:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1295 states have (on average 1.7706563706563707) internal successors, (2293), 1848 states have internal predecessors, (2293), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2317 transitions. [2024-11-09 10:04:11,620 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2317 transitions. Word has length 69 [2024-11-09 10:04:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:11,620 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2317 transitions. [2024-11-09 10:04:11,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2317 transitions. [2024-11-09 10:04:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 10:04:11,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:11,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:11,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:04:11,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:11,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:11,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1814650898, now seen corresponding path program 1 times [2024-11-09 10:04:11,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:11,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378690855] [2024-11-09 10:04:11,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:11,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:12,208 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:12,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:12,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378690855] [2024-11-09 10:04:12,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378690855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:12,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:12,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:04:12,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751865632] [2024-11-09 10:04:12,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:12,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:04:12,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:12,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:04:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:04:12,210 INFO L87 Difference]: Start difference. First operand 1858 states and 2317 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:13,283 INFO L93 Difference]: Finished difference Result 1774 states and 2233 transitions. [2024-11-09 10:04:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:04:13,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-09 10:04:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:13,288 INFO L225 Difference]: With dead ends: 1774 [2024-11-09 10:04:13,288 INFO L226 Difference]: Without dead ends: 1774 [2024-11-09 10:04:13,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:04:13,289 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 1535 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:13,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 1620 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:04:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-09 10:04:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1501. [2024-11-09 10:04:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1022 states have (on average 1.687866927592955) internal successors, (1725), 1491 states have internal predecessors, (1725), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1749 transitions. [2024-11-09 10:04:13,304 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1749 transitions. Word has length 72 [2024-11-09 10:04:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:13,304 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1749 transitions. [2024-11-09 10:04:13,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1749 transitions. [2024-11-09 10:04:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 10:04:13,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:13,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:13,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:04:13,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:13,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash -702590666, now seen corresponding path program 1 times [2024-11-09 10:04:13,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:13,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041826351] [2024-11-09 10:04:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:13,478 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:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:13,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041826351] [2024-11-09 10:04:13,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041826351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:13,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:13,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:04:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943982321] [2024-11-09 10:04:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:13,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:04:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:04:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:04:13,480 INFO L87 Difference]: Start difference. First operand 1501 states and 1749 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:14,295 INFO L93 Difference]: Finished difference Result 1500 states and 1748 transitions. [2024-11-09 10:04:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:04:14,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 10:04:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:14,299 INFO L225 Difference]: With dead ends: 1500 [2024-11-09 10:04:14,299 INFO L226 Difference]: Without dead ends: 1500 [2024-11-09 10:04:14,299 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:04:14,300 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 2 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4778 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:14,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4778 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:04:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2024-11-09 10:04:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1500. [2024-11-09 10:04:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1022 states have (on average 1.6868884540117417) internal successors, (1724), 1490 states have internal predecessors, (1724), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-09 10:04:14,315 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 77 [2024-11-09 10:04:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:14,316 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-09 10:04:14,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-09 10:04:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 10:04:14,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:14,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:14,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:04:14,317 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:14,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:14,317 INFO L85 PathProgramCache]: Analyzing trace with hash -702590665, now seen corresponding path program 1 times [2024-11-09 10:04:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:14,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016505622] [2024-11-09 10:04:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:14,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:14,826 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:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:14,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016505622] [2024-11-09 10:04:14,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016505622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:14,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:14,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:04:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903799819] [2024-11-09 10:04:14,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:14,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:04:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:04:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:04:14,830 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:15,865 INFO L93 Difference]: Finished difference Result 1499 states and 1747 transitions. [2024-11-09 10:04:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:04:15,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 10:04:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:15,870 INFO L225 Difference]: With dead ends: 1499 [2024-11-09 10:04:15,870 INFO L226 Difference]: Without dead ends: 1499 [2024-11-09 10:04:15,871 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:04:15,871 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 1 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:15,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4800 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:04:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2024-11-09 10:04:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2024-11-09 10:04:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1021 states have (on average 1.6875612144955925) internal successors, (1723), 1489 states have internal predecessors, (1723), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1747 transitions. [2024-11-09 10:04:15,890 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1747 transitions. Word has length 77 [2024-11-09 10:04:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:15,890 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1747 transitions. [2024-11-09 10:04:15,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:04:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1747 transitions. [2024-11-09 10:04:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:04:15,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:15,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:15,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:04:15,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:15,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1178833342, now seen corresponding path program 1 times [2024-11-09 10:04:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:15,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587624420] [2024-11-09 10:04:15,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:15,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:16,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:16,403 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:16,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:16,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587624420] [2024-11-09 10:04:16,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587624420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:16,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:16,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:04:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543315846] [2024-11-09 10:04:16,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:16,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:04:16,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:04:16,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:04:16,405 INFO L87 Difference]: Start difference. First operand 1499 states and 1747 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:17,732 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2024-11-09 10:04:17,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:04:17,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-09 10:04:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:17,737 INFO L225 Difference]: With dead ends: 1506 [2024-11-09 10:04:17,737 INFO L226 Difference]: Without dead ends: 1506 [2024-11-09 10:04:17,737 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:04:17,738 INFO L432 NwaCegarLoop]: 1611 mSDtfsCounter, 13 mSDsluCounter, 5816 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7427 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:17,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7427 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:04:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-09 10:04:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1505. [2024-11-09 10:04:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6861598440545809) internal successors, (1730), 1494 states have internal predecessors, (1730), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-09 10:04:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1760 transitions. [2024-11-09 10:04:17,755 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1760 transitions. Word has length 85 [2024-11-09 10:04:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:17,755 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1760 transitions. [2024-11-09 10:04:17,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1760 transitions. [2024-11-09 10:04:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:04:17,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:17,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:17,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:04:17,756 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:17,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1178833341, now seen corresponding path program 1 times [2024-11-09 10:04:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:17,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749293711] [2024-11-09 10:04:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:17,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:17,947 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:17,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:17,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749293711] [2024-11-09 10:04:17,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749293711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:17,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:17,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:04:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703797659] [2024-11-09 10:04:17,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:17,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:04:17,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:17,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:04:17,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:04:17,949 INFO L87 Difference]: Start difference. First operand 1505 states and 1760 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:19,130 INFO L93 Difference]: Finished difference Result 1510 states and 1764 transitions. [2024-11-09 10:04:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:04:19,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-09 10:04:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:19,134 INFO L225 Difference]: With dead ends: 1510 [2024-11-09 10:04:19,134 INFO L226 Difference]: Without dead ends: 1510 [2024-11-09 10:04:19,134 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:04:19,134 INFO L432 NwaCegarLoop]: 1606 mSDtfsCounter, 16 mSDsluCounter, 5776 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7382 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:19,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7382 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:04:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-09 10:04:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1505. [2024-11-09 10:04:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6851851851851851) internal successors, (1729), 1494 states have internal predecessors, (1729), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-09 10:04:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1759 transitions. [2024-11-09 10:04:19,150 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1759 transitions. Word has length 85 [2024-11-09 10:04:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:19,151 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1759 transitions. [2024-11-09 10:04:19,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1759 transitions. [2024-11-09 10:04:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 10:04:19,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:19,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:19,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:04:19,152 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:19,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:19,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1708688822, now seen corresponding path program 1 times [2024-11-09 10:04:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:19,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33051878] [2024-11-09 10:04:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:19,803 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:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33051878] [2024-11-09 10:04:19,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33051878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257693595] [2024-11-09 10:04:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:19,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:19,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:04:19,810 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:04:19,811 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:04:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:20,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 10:04:20,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:04:20,132 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:04:20,144 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:04:20,145 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:20,171 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:20,182 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:20,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 10:04:20,266 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:20,404 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:20,404 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:20,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:04:20,455 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:20,460 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:20,477 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:20,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:04:20,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_547 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:04:20,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257693595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:20,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:04:20,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-09 10:04:20,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386594048] [2024-11-09 10:04:20,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:04:20,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:04:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:04:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-09 10:04:20,582 INFO L87 Difference]: Start difference. First operand 1505 states and 1759 transitions. Second operand has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:26,120 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-09 10:04:26,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:04:26,120 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-09 10:04:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:26,129 INFO L225 Difference]: With dead ends: 1512 [2024-11-09 10:04:26,129 INFO L226 Difference]: Without dead ends: 1512 [2024-11-09 10:04:26,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-09 10:04:26,130 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1575 mSDsluCounter, 11052 mSDsCounter, 0 mSdLazyCounter, 10585 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 12102 SdHoareTripleChecker+Invalid, 10628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:26,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 12102 Invalid, 10628 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 10585 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-09 10:04:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-09 10:04:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1509. [2024-11-09 10:04:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1030 states have (on average 1.6825242718446602) internal successors, (1733), 1497 states have internal predecessors, (1733), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:04:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1758 transitions. [2024-11-09 10:04:26,147 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1758 transitions. Word has length 86 [2024-11-09 10:04:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:26,147 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1758 transitions. [2024-11-09 10:04:26,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1758 transitions. [2024-11-09 10:04:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 10:04:26,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:26,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:26,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:04:26,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 10:04:26,349 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:26,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1708688821, now seen corresponding path program 1 times [2024-11-09 10:04:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:26,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600429267] [2024-11-09 10:04:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:26,746 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:26,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:26,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600429267] [2024-11-09 10:04:26,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600429267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:26,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169493948] [2024-11-09 10:04:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:26,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:26,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:04:26,749 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:04:26,754 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:04:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:26,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 10:04:26,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:04:27,045 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:04:27,046 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:27,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:04:27,125 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:27,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:27,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:04:27,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:04:27,276 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:27,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:04:27,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169493948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:27,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:04:27,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-09 10:04:27,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239698100] [2024-11-09 10:04:27,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:04:27,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:04:27,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:27,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:04:27,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=320, Unknown=6, NotChecked=0, Total=380 [2024-11-09 10:04:27,319 INFO L87 Difference]: Start difference. First operand 1509 states and 1758 transitions. Second operand has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:30,819 INFO L93 Difference]: Finished difference Result 1511 states and 1765 transitions. [2024-11-09 10:04:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:04:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-09 10:04:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:30,824 INFO L225 Difference]: With dead ends: 1511 [2024-11-09 10:04:30,824 INFO L226 Difference]: Without dead ends: 1511 [2024-11-09 10:04:30,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=507, Unknown=6, NotChecked=0, Total=600 [2024-11-09 10:04:30,825 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1546 mSDsluCounter, 13237 mSDsCounter, 0 mSdLazyCounter, 8379 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 14281 SdHoareTripleChecker+Invalid, 8408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 8379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:30,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 14281 Invalid, 8408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 8379 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 10:04:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2024-11-09 10:04:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1502. [2024-11-09 10:04:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1025 states have (on average 1.6839024390243902) internal successors, (1726), 1491 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-09 10:04:30,864 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 86 [2024-11-09 10:04:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:30,864 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-09 10:04:30,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-09 10:04:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 10:04:30,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:30,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:30,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:04:31,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 10:04:31,066 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:31,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1322895015, now seen corresponding path program 1 times [2024-11-09 10:04:31,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:31,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743742722] [2024-11-09 10:04:31,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:31,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:31,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:31,542 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:31,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:31,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743742722] [2024-11-09 10:04:31,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743742722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:31,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:31,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:04:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296571167] [2024-11-09 10:04:31,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:31,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:04:31,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:31,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:04:31,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:04:31,545 INFO L87 Difference]: Start difference. First operand 1502 states and 1750 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:33,561 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-09 10:04:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:04:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-09 10:04:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:33,564 INFO L225 Difference]: With dead ends: 1515 [2024-11-09 10:04:33,564 INFO L226 Difference]: Without dead ends: 1515 [2024-11-09 10:04:33,564 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:04:33,565 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1573 mSDsluCounter, 7152 mSDsCounter, 0 mSdLazyCounter, 4793 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 8196 SdHoareTripleChecker+Invalid, 4819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:33,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 8196 Invalid, 4819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4793 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:04:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-09 10:04:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1511. [2024-11-09 10:04:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6805421103581801) internal successors, (1736), 1499 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:04:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1761 transitions. [2024-11-09 10:04:33,578 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1761 transitions. Word has length 88 [2024-11-09 10:04:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:33,578 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1761 transitions. [2024-11-09 10:04:33,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1761 transitions. [2024-11-09 10:04:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 10:04:33,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:33,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:33,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:04:33,579 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:33,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1322895014, now seen corresponding path program 1 times [2024-11-09 10:04:33,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:33,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252528292] [2024-11-09 10:04:33,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:33,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:34,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:34,265 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:34,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:34,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252528292] [2024-11-09 10:04:34,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252528292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:34,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:34,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:04:34,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948564071] [2024-11-09 10:04:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:34,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:04:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:34,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:04:34,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:04:34,268 INFO L87 Difference]: Start difference. First operand 1511 states and 1761 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:36,875 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-09 10:04:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:04:36,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-09 10:04:36,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:36,879 INFO L225 Difference]: With dead ends: 1514 [2024-11-09 10:04:36,879 INFO L226 Difference]: Without dead ends: 1514 [2024-11-09 10:04:36,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:04:36,880 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 1547 mSDsluCounter, 8064 mSDsCounter, 0 mSdLazyCounter, 7054 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 9115 SdHoareTripleChecker+Invalid, 7078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:36,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 9115 Invalid, 7078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7054 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 10:04:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-09 10:04:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-09 10:04:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6795740561471442) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:04:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-09 10:04:36,913 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 88 [2024-11-09 10:04:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:36,913 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-09 10:04:36,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-09 10:04:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:04:36,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:36,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:36,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:04:36,918 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:36,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash -403103135, now seen corresponding path program 1 times [2024-11-09 10:04:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:36,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091168271] [2024-11-09 10:04:36,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:37,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:37,542 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:37,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091168271] [2024-11-09 10:04:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091168271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570840771] [2024-11-09 10:04:37,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:37,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:37,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:04:37,546 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:04:37,550 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:04:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:37,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 10:04:37,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:04:37,761 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:37,841 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:04:37,841 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:37,863 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:37,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 10:04:38,034 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:38,035 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:38,105 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:38,106 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:38,120 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:38,145 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:38,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:04:38,154 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_943 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_943) |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:04:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570840771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:38,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:04:38,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-09 10:04:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269205047] [2024-11-09 10:04:38,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:04:38,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 10:04:38,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:38,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 10:04:38,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=457, Unknown=20, NotChecked=44, Total=600 [2024-11-09 10:04:38,237 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 22 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 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:04:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:42,810 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-09 10:04:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:04:42,811 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 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 89 [2024-11-09 10:04:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:42,814 INFO L225 Difference]: With dead ends: 1513 [2024-11-09 10:04:42,814 INFO L226 Difference]: Without dead ends: 1513 [2024-11-09 10:04:42,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=633, Unknown=20, NotChecked=52, Total=812 [2024-11-09 10:04:42,816 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1533 mSDsluCounter, 15285 mSDsCounter, 0 mSdLazyCounter, 9590 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 16328 SdHoareTripleChecker+Invalid, 9618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:42,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 16328 Invalid, 9618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9590 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 10:04:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-09 10:04:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1510. [2024-11-09 10:04:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1033 states have (on average 1.6786060019361084) internal successors, (1734), 1498 states have internal predecessors, (1734), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:04:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1759 transitions. [2024-11-09 10:04:42,863 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1759 transitions. Word has length 89 [2024-11-09 10:04:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:42,864 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1759 transitions. [2024-11-09 10:04:42,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 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:04:42,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1759 transitions. [2024-11-09 10:04:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:04:42,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:42,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:42,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:04:43,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:43,070 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:43,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash -403103134, now seen corresponding path program 1 times [2024-11-09 10:04:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014077795] [2024-11-09 10:04:43,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:43,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:43,696 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:43,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:43,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014077795] [2024-11-09 10:04:43,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014077795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:43,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847128855] [2024-11-09 10:04:43,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:43,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:43,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:04:43,698 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:04:43,706 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:04:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:43,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 10:04:43,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:04:43,916 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:44,016 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:04:44,022 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:04:44,022 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:44,043 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:44,046 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:44,101 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:44,105 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:44,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:44,179 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:44,185 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:44,251 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:44,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:04:44,257 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:44,267 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:44,270 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:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:04:44,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:04:44,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1092 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1092 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:04:44,340 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1092 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1092 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:04:44,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1098) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1099))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1098) .cse1 v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-09 10:04:44,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847128855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:44,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:04:44,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-09 10:04:44,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955131388] [2024-11-09 10:04:44,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:04:44,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 10:04:44,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:44,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 10:04:44,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=437, Unknown=3, NotChecked=132, Total=650 [2024-11-09 10:04:44,387 INFO L87 Difference]: Start difference. First operand 1510 states and 1759 transitions. Second operand has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 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:04:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:48,588 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-09 10:04:48,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:04:48,588 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 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 89 [2024-11-09 10:04:48,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:48,590 INFO L225 Difference]: With dead ends: 1512 [2024-11-09 10:04:48,590 INFO L226 Difference]: Without dead ends: 1512 [2024-11-09 10:04:48,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=693, Unknown=3, NotChecked=168, Total=992 [2024-11-09 10:04:48,591 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 1550 mSDsluCounter, 8652 mSDsCounter, 0 mSdLazyCounter, 8103 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 9701 SdHoareTripleChecker+Invalid, 8144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 8103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:48,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 9701 Invalid, 8144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 8103 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 10:04:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-09 10:04:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1500. [2024-11-09 10:04:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1025 states have (on average 1.681951219512195) internal successors, (1724), 1489 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:04:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-09 10:04:48,602 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 89 [2024-11-09 10:04:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:48,602 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-09 10:04:48,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 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:04:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-09 10:04:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 10:04:48,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:48,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:48,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:04:48,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:48,808 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:48,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:48,808 INFO L85 PathProgramCache]: Analyzing trace with hash 255145828, now seen corresponding path program 1 times [2024-11-09 10:04:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:48,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012782954] [2024-11-09 10:04:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:48,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:49,471 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:49,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:49,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012782954] [2024-11-09 10:04:49,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012782954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:49,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:49,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:04:49,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475560806] [2024-11-09 10:04:49,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:49,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:04:49,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:49,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:04:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:04:49,475 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:51,808 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-09 10:04:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:04:51,812 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-09 10:04:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:51,814 INFO L225 Difference]: With dead ends: 1516 [2024-11-09 10:04:51,814 INFO L226 Difference]: Without dead ends: 1516 [2024-11-09 10:04:51,815 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:04:51,815 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1572 mSDsluCounter, 9193 mSDsCounter, 0 mSdLazyCounter, 5985 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 10236 SdHoareTripleChecker+Invalid, 6011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:51,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 10236 Invalid, 6011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5985 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:04:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-09 10:04:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1512. [2024-11-09 10:04:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6766409266409266) internal successors, (1737), 1500 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:04:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1762 transitions. [2024-11-09 10:04:51,826 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1762 transitions. Word has length 91 [2024-11-09 10:04:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:51,826 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1762 transitions. [2024-11-09 10:04:51,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1762 transitions. [2024-11-09 10:04:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 10:04:51,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:51,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:04:51,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 10:04:51,827 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:51,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:51,827 INFO L85 PathProgramCache]: Analyzing trace with hash 255145829, now seen corresponding path program 1 times [2024-11-09 10:04:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593038181] [2024-11-09 10:04:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:52,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:52,529 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:52,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:52,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593038181] [2024-11-09 10:04:52,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593038181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:04:52,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:04:52,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:04:52,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907826718] [2024-11-09 10:04:52,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:04:52,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:04:52,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:52,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:04:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:04:52,532 INFO L87 Difference]: Start difference. First operand 1512 states and 1762 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:04:56,254 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-09 10:04:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:04:56,255 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-09 10:04:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:04:56,258 INFO L225 Difference]: With dead ends: 1515 [2024-11-09 10:04:56,258 INFO L226 Difference]: Without dead ends: 1515 [2024-11-09 10:04:56,258 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:04:56,259 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1566 mSDsluCounter, 7869 mSDsCounter, 0 mSdLazyCounter, 7260 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 8919 SdHoareTripleChecker+Invalid, 7284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:04:56,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 8919 Invalid, 7284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7260 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 10:04:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-09 10:04:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-09 10:04:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6756756756756757) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:04:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-09 10:04:56,276 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 91 [2024-11-09 10:04:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:04:56,277 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-09 10:04:56,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:04:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-09 10:04:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:04:56,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:04:56,278 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:04:56,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 10:04:56,278 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:04:56,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:04:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash -116305572, now seen corresponding path program 1 times [2024-11-09 10:04:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:04:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537528785] [2024-11-09 10:04:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:04:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:56,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:04:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:56,901 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:56,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:04:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537528785] [2024-11-09 10:04:56,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537528785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199437829] [2024-11-09 10:04:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:04:56,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:04:56,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:04:56,904 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:04:56,905 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:04:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:04:57,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 10:04:57,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:04:57,152 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:57,225 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:04:57,225 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:57,253 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:57,317 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:57,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:57,424 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:57,508 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:57,509 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:57,547 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:04:57,547 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:57,561 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:57,583 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:57,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:04:57,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1387 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1387) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 10:04:57,620 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1386 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1386))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1387)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:04:57,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1386 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1386))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1387)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:04:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199437829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:04:57,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:04:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-09 10:04:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6135868] [2024-11-09 10:04:57,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:04:57,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:04:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:04:57,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:04:57,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=545, Unknown=20, NotChecked=150, Total=812 [2024-11-09 10:04:57,680 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:05:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:01,910 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-09 10:05:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:05:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 92 [2024-11-09 10:05:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:01,913 INFO L225 Difference]: With dead ends: 1514 [2024-11-09 10:05:01,914 INFO L226 Difference]: Without dead ends: 1514 [2024-11-09 10:05:01,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=634, Unknown=21, NotChecked=162, Total=930 [2024-11-09 10:05:01,918 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1532 mSDsluCounter, 15257 mSDsCounter, 0 mSdLazyCounter, 9530 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 16305 SdHoareTripleChecker+Invalid, 9567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 9530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:01,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 16305 Invalid, 9567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 9530 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 10:05:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-09 10:05:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-09 10:05:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1036 states have (on average 1.6747104247104247) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:05:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-09 10:05:01,934 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 92 [2024-11-09 10:05:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:01,934 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-09 10:05:01,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:05:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-09 10:05:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:05:01,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:01,936 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:05:01,952 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:05:02,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 10:05:02,137 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:05:02,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash -116305571, now seen corresponding path program 1 times [2024-11-09 10:05:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:02,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301333744] [2024-11-09 10:05:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:02,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:05:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:02,964 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:05:02,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:02,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301333744] [2024-11-09 10:05:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301333744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:02,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321676077] [2024-11-09 10:05:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:02,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:05:02,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:05:02,967 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:05:02,969 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:05:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:03,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 10:05:03,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:05:03,183 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:05:03,255 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:05:03,256 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:05:03,260 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:05:03,266 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:05:03,272 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:05:03,304 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:05:03,306 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:05:03,373 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:03,374 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:05:03,379 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:05:03,426 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:03,427 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:05:03,433 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:05:03,488 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:03,488 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:05:03,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:05:03,509 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:05:03,512 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:05:03,515 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:05:03,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:05:03,580 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1551 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:05:03,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1551 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:05:03,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1549))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1548) .cse0 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1548) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-09 10:05:03,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1556))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1557) .cse0 v_ArrVal_1548) (select (select (store .cse1 .cse0 v_ArrVal_1549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1551))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1556))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1549))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1548) .cse4 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-09 10:05:03,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321676077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:03,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:05:03,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-09 10:05:03,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462448320] [2024-11-09 10:05:03,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:05:03,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:05:03,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:03,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:05:03,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=393, Unknown=7, NotChecked=172, Total=650 [2024-11-09 10:05:03,743 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:05:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:09,247 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-09 10:05:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:05:09,248 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-09 10:05:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:09,251 INFO L225 Difference]: With dead ends: 1513 [2024-11-09 10:05:09,251 INFO L226 Difference]: Without dead ends: 1513 [2024-11-09 10:05:09,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=793, Unknown=7, NotChecked=244, Total=1190 [2024-11-09 10:05:09,252 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 1540 mSDsluCounter, 9192 mSDsCounter, 0 mSdLazyCounter, 9211 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 10233 SdHoareTripleChecker+Invalid, 9239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:09,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 10233 Invalid, 9239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9211 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-09 10:05:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-09 10:05:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1498. [2024-11-09 10:05:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1025 states have (on average 1.68) internal successors, (1722), 1487 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:05:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1746 transitions. [2024-11-09 10:05:09,267 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1746 transitions. Word has length 92 [2024-11-09 10:05:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:09,267 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1746 transitions. [2024-11-09 10:05:09,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:05:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1746 transitions. [2024-11-09 10:05:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:05:09,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:09,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:05:09,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 10:05:09,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:05:09,473 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:05:09,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:09,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1042115424, now seen corresponding path program 1 times [2024-11-09 10:05:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:09,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667431483] [2024-11-09 10:05:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:10,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:05:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:10,131 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:05:10,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:10,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667431483] [2024-11-09 10:05:10,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667431483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:10,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:10,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 10:05:10,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44264500] [2024-11-09 10:05:10,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:10,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:05:10,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:10,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:05:10,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:05:10,135 INFO L87 Difference]: Start difference. First operand 1498 states and 1746 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:05:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:12,590 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-09 10:05:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:05:12,591 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-09 10:05:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:12,593 INFO L225 Difference]: With dead ends: 1517 [2024-11-09 10:05:12,593 INFO L226 Difference]: Without dead ends: 1517 [2024-11-09 10:05:12,594 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:05:12,594 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 1575 mSDsluCounter, 8137 mSDsCounter, 0 mSdLazyCounter, 5378 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 9179 SdHoareTripleChecker+Invalid, 5404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:12,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 9179 Invalid, 5404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5378 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 10:05:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-09 10:05:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1513. [2024-11-09 10:05:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1039 states have (on average 1.672762271414822) internal successors, (1738), 1501 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:05:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1763 transitions. [2024-11-09 10:05:12,606 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1763 transitions. Word has length 94 [2024-11-09 10:05:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:12,606 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1763 transitions. [2024-11-09 10:05:12,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:05:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1763 transitions. [2024-11-09 10:05:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:05:12,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:12,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:05:12,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 10:05:12,607 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:05:12,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1042115423, now seen corresponding path program 1 times [2024-11-09 10:05:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186597766] [2024-11-09 10:05:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:13,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:05:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:13,283 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:05:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186597766] [2024-11-09 10:05:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186597766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:13,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:13,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:05:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207585740] [2024-11-09 10:05:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:13,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:05:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:13,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:05:13,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:05:13,285 INFO L87 Difference]: Start difference. First operand 1513 states and 1763 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:05:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:16,682 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-09 10:05:16,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:05:16,683 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-09 10:05:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:16,685 INFO L225 Difference]: With dead ends: 1516 [2024-11-09 10:05:16,685 INFO L226 Difference]: Without dead ends: 1516 [2024-11-09 10:05:16,685 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:05:16,686 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 1567 mSDsluCounter, 9655 mSDsCounter, 0 mSdLazyCounter, 8635 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 10704 SdHoareTripleChecker+Invalid, 8659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:16,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1582 Valid, 10704 Invalid, 8659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 8635 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 10:05:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-09 10:05:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1513. [2024-11-09 10:05:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1039 states have (on average 1.6717998075072185) internal successors, (1737), 1501 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:05:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1762 transitions. [2024-11-09 10:05:16,716 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1762 transitions. Word has length 94 [2024-11-09 10:05:16,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:16,717 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1762 transitions. [2024-11-09 10:05:16,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:05:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1762 transitions. [2024-11-09 10:05:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:05:16,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:16,717 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:05:16,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 10:05:16,718 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:05:16,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1179948968, now seen corresponding path program 1 times [2024-11-09 10:05:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:16,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130106125] [2024-11-09 10:05:16,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:16,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:17,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:05:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:17,353 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:05:17,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130106125] [2024-11-09 10:05:17,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130106125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666973341] [2024-11-09 10:05:17,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:17,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:05:17,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:05:17,356 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:05:17,361 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:05:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:17,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 10:05:17,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:05:17,626 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:05:17,701 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:05:17,702 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:05:17,726 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:05:17,782 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:05:17,870 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:17,870 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:05:17,934 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:17,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:05:17,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:17,977 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:05:18,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:18,043 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:05:18,055 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:05:18,079 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:05:18,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:05:18,118 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1870 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-09 10:05:18,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:05:18,160 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (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$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1868))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1869)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:05:18,165 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1868))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1869)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:05:18,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666973341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:18,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:05:18,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-09 10:05:18,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574453443] [2024-11-09 10:05:18,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:05:18,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:05:18,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:18,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:05:18,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=666, Unknown=41, NotChecked=228, Total=1056 [2024-11-09 10:05:18,223 INFO L87 Difference]: Start difference. First operand 1513 states and 1762 transitions. Second operand has 26 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 25 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:05:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:20,503 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-09 10:05:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:05:20,503 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 25 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 95 [2024-11-09 10:05:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:20,512 INFO L225 Difference]: With dead ends: 1515 [2024-11-09 10:05:20,512 INFO L226 Difference]: Without dead ends: 1515 [2024-11-09 10:05:20,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=766, Unknown=42, NotChecked=244, Total=1190 [2024-11-09 10:05:20,513 INFO L432 NwaCegarLoop]: 1047 mSDtfsCounter, 1539 mSDsluCounter, 8187 mSDsCounter, 0 mSdLazyCounter, 5382 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 9234 SdHoareTripleChecker+Invalid, 5432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 5382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:20,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 9234 Invalid, 5432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 5382 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:05:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-09 10:05:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-09 10:05:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1039 states have (on average 1.670837343599615) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:05:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-09 10:05:20,542 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 95 [2024-11-09 10:05:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:20,542 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-09 10:05:20,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 25 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:05:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-09 10:05:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:05:20,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:20,543 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:05:20,557 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:05:20,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:05:20,743 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:05:20,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:20,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1179948969, now seen corresponding path program 1 times [2024-11-09 10:05:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:20,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162813364] [2024-11-09 10:05:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:20,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:05:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:21,790 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:05:21,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162813364] [2024-11-09 10:05:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162813364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31800438] [2024-11-09 10:05:21,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:21,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:05:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:05:21,792 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:05:21,798 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:05:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:22,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 10:05:22,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:05:22,047 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:05:22,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:05:22,132 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:05:22,132 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:05:22,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:05:22,156 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:05:22,218 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:05:22,220 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:05:22,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:22,296 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:05:22,303 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:05:22,361 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:22,361 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:05:22,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-09 10:05:22,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:22,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:05:22,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-09 10:05:22,509 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:22,510 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:05:22,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-09 10:05:22,529 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:05:22,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-09 10:05:22,554 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:05:22,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:05:22,604 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2048 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-09 10:05:22,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2045) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int)) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2046))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2045) .cse1 v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-09 10:05:22,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2045) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int)) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2046))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2045) .cse2 v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-09 10:05:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31800438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:23,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:05:23,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-09 10:05:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501030168] [2024-11-09 10:05:23,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:05:23,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:05:23,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:23,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:05:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=850, Unknown=20, NotChecked=186, Total=1190 [2024-11-09 10:05:23,007 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 26 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 25 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)