./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:26:37,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:26:37,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:26:37,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:26:37,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:26:37,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:26:37,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:26:37,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:26:37,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:26:37,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:26:37,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:26:37,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:26:37,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:26:37,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:26:37,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:26:37,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:26:37,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:26:37,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:26:37,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:26:37,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:26:37,915 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:26:37,916 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:26:37,916 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:26:37,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:26:37,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:26:37,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:26:37,917 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:26:37,917 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:26:37,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:26:37,917 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:26:37,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:26:37,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:26:37,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:26:37,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:26:37,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:26:37,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:26:37,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:26:37,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:26:37,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:26:37,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:26:37,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:26:37,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:26:37,920 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-10 17:26:38,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:26:38,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:26:38,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:26:38,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:26:38,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:26:38,133 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_nondet_test4-1.i [2024-11-10 17:26:39,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:26:39,543 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:26:39,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i [2024-11-10 17:26:39,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb09a524/e7588204b1654af784ac4542f55f30de/FLAGd56a3bf95 [2024-11-10 17:26:39,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb09a524/e7588204b1654af784ac4542f55f30de [2024-11-10 17:26:39,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:26:39,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:26:39,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:26:39,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:26:39,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:26:39,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:26:39" (1/1) ... [2024-11-10 17:26:39,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68cec55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:39, skipping insertion in model container [2024-11-10 17:26:39,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:26:39" (1/1) ... [2024-11-10 17:26:39,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:26:40,227 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:26:40,255 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:26:40,261 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:26:40,264 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:26:40,273 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:26:40,310 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:26:40,315 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:26:40,320 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:26:40,323 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:26:40,337 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:26:40,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:26:40,356 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:26:40,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:26:40,514 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:26:40,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40 WrapperNode [2024-11-10 17:26:40,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:26:40,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:26:40,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:26:40,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:26:40,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,601 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1529 [2024-11-10 17:26:40,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:26:40,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:26:40,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:26:40,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:26:40,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,688 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [307, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 82 writes are split as follows [82, 0]. [2024-11-10 17:26:40,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:26:40,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:26:40,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:26:40,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:26:40,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (1/1) ... [2024-11-10 17:26:40,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:26:40,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:26:40,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:26:40,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:26:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 17:26:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 17:26:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 17:26:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 17:26:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:26:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:26:40,834 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:26:40,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:26:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:26:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:26:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:26:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:26:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:26:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:26:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:26:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:26:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 17:26:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:26:40,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:26:40,999 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:26:41,004 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:26:42,758 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2024-11-10 17:26:42,758 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:26:42,820 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:26:42,820 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 17:26:42,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:26:42 BoogieIcfgContainer [2024-11-10 17:26:42,821 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:26:42,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:26:42,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:26:42,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:26:42,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:26:39" (1/3) ... [2024-11-10 17:26:42,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e150e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:26:42, skipping insertion in model container [2024-11-10 17:26:42,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:40" (2/3) ... [2024-11-10 17:26:42,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e150e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:26:42, skipping insertion in model container [2024-11-10 17:26:42,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:26:42" (3/3) ... [2024-11-10 17:26:42,828 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test4-1.i [2024-11-10 17:26:42,840 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:26:42,840 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-10 17:26:42,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:26:42,899 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;@320d24c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:26:42,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-10 17:26:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 1456 states, 826 states have (on average 2.046004842615012) internal successors, (1690), 1448 states have internal predecessors, (1690), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:26:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 17:26:42,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:42,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 17:26:42,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:42,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1697619408, now seen corresponding path program 1 times [2024-11-10 17:26:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:42,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640640091] [2024-11-10 17:26:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:43,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640640091] [2024-11-10 17:26:43,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640640091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:43,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:26:43,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362813979] [2024-11-10 17:26:43,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:43,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:43,073 INFO L87 Difference]: Start difference. First operand has 1456 states, 826 states have (on average 2.046004842615012) internal successors, (1690), 1448 states have internal predecessors, (1690), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-10 17:26:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:43,762 INFO L93 Difference]: Finished difference Result 1462 states and 1642 transitions. [2024-11-10 17:26:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:43,764 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-10 17:26:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:43,781 INFO L225 Difference]: With dead ends: 1462 [2024-11-10 17:26:43,782 INFO L226 Difference]: Without dead ends: 1456 [2024-11-10 17:26:43,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:43,786 INFO L432 NwaCegarLoop]: 1559 mSDtfsCounter, 29 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:43,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2502 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:26:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2024-11-10 17:26:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1447. [2024-11-10 17:26:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 828 states have (on average 1.9565217391304348) internal successors, (1620), 1439 states have internal predecessors, (1620), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:26:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1632 transitions. [2024-11-10 17:26:43,855 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1632 transitions. Word has length 5 [2024-11-10 17:26:43,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:43,855 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1632 transitions. [2024-11-10 17:26:43,856 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-10 17:26:43,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1632 transitions. [2024-11-10 17:26:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 17:26:43,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:43,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:43,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:26:43,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:43,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:43,857 INFO L85 PathProgramCache]: Analyzing trace with hash -620279345, now seen corresponding path program 1 times [2024-11-10 17:26:43,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:43,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409631781] [2024-11-10 17:26:43,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:43,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:43,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409631781] [2024-11-10 17:26:43,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409631781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:43,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:43,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:26:43,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533216021] [2024-11-10 17:26:43,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:43,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:43,931 INFO L87 Difference]: Start difference. First operand 1447 states and 1632 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:44,629 INFO L93 Difference]: Finished difference Result 1353 states and 1536 transitions. [2024-11-10 17:26:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:44,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 17:26:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:44,634 INFO L225 Difference]: With dead ends: 1353 [2024-11-10 17:26:44,634 INFO L226 Difference]: Without dead ends: 1353 [2024-11-10 17:26:44,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:44,635 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 1372 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:44,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 868 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 17:26:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-10 17:26:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-11-10 17:26:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 828 states have (on average 1.8405797101449275) internal successors, (1524), 1345 states have internal predecessors, (1524), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:26:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1536 transitions. [2024-11-10 17:26:44,659 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1536 transitions. Word has length 7 [2024-11-10 17:26:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:44,659 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1536 transitions. [2024-11-10 17:26:44,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1536 transitions. [2024-11-10 17:26:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 17:26:44,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:44,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:44,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:26:44,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr627REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:44,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:44,662 INFO L85 PathProgramCache]: Analyzing trace with hash -620279344, now seen corresponding path program 1 times [2024-11-10 17:26:44,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:44,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281615486] [2024-11-10 17:26:44,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:44,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281615486] [2024-11-10 17:26:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281615486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:44,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:26:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140443961] [2024-11-10 17:26:44,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:44,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:44,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:44,784 INFO L87 Difference]: Start difference. First operand 1353 states and 1536 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:45,573 INFO L93 Difference]: Finished difference Result 1777 states and 2038 transitions. [2024-11-10 17:26:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:45,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 17:26:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:45,578 INFO L225 Difference]: With dead ends: 1777 [2024-11-10 17:26:45,579 INFO L226 Difference]: Without dead ends: 1777 [2024-11-10 17:26:45,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:45,583 INFO L432 NwaCegarLoop]: 1226 mSDtfsCounter, 831 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:45,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1841 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 17:26:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2024-11-10 17:26:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1623. [2024-11-10 17:26:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1108 states have (on average 1.80956678700361) internal successors, (2005), 1615 states have internal predecessors, (2005), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:26:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2017 transitions. [2024-11-10 17:26:45,607 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2017 transitions. Word has length 7 [2024-11-10 17:26:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:45,608 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 2017 transitions. [2024-11-10 17:26:45,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2017 transitions. [2024-11-10 17:26:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:26:45,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:45,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:45,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:26:45,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:45,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash 858095659, now seen corresponding path program 1 times [2024-11-10 17:26:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:45,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372314753] [2024-11-10 17:26:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:45,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372314753] [2024-11-10 17:26:45,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372314753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:45,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:45,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:26:45,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381387749] [2024-11-10 17:26:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:45,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:45,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:45,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:45,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:45,674 INFO L87 Difference]: Start difference. First operand 1623 states and 2017 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:46,002 INFO L93 Difference]: Finished difference Result 2691 states and 3382 transitions. [2024-11-10 17:26:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:26:46,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 17:26:46,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:46,010 INFO L225 Difference]: With dead ends: 2691 [2024-11-10 17:26:46,010 INFO L226 Difference]: Without dead ends: 2688 [2024-11-10 17:26:46,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:46,011 INFO L432 NwaCegarLoop]: 1458 mSDtfsCounter, 1008 mSDsluCounter, 2681 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:46,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 4139 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 17:26:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2024-11-10 17:26:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2389. [2024-11-10 17:26:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 1874 states have (on average 1.7934898612593384) internal successors, (3361), 2378 states have internal predecessors, (3361), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3379 transitions. [2024-11-10 17:26:46,042 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3379 transitions. Word has length 9 [2024-11-10 17:26:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:46,043 INFO L471 AbstractCegarLoop]: Abstraction has 2389 states and 3379 transitions. [2024-11-10 17:26:46,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3379 transitions. [2024-11-10 17:26:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 17:26:46,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:46,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:46,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:26:46,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:46,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:46,044 INFO L85 PathProgramCache]: Analyzing trace with hash -131339220, now seen corresponding path program 1 times [2024-11-10 17:26:46,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:46,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806820443] [2024-11-10 17:26:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:46,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:46,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:46,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806820443] [2024-11-10 17:26:46,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806820443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:46,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:46,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:46,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896396845] [2024-11-10 17:26:46,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:46,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:46,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:46,093 INFO L87 Difference]: Start difference. First operand 2389 states and 3379 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:46,944 INFO L93 Difference]: Finished difference Result 2464 states and 3485 transitions. [2024-11-10 17:26:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:26:46,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-10 17:26:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:46,951 INFO L225 Difference]: With dead ends: 2464 [2024-11-10 17:26:46,951 INFO L226 Difference]: Without dead ends: 2464 [2024-11-10 17:26:46,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:26:46,952 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 1640 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:46,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 1535 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 17:26:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2024-11-10 17:26:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2366. [2024-11-10 17:26:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 1874 states have (on average 1.7689434364994663) internal successors, (3315), 2355 states have internal predecessors, (3315), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3333 transitions. [2024-11-10 17:26:46,982 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3333 transitions. Word has length 14 [2024-11-10 17:26:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:46,982 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3333 transitions. [2024-11-10 17:26:46,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3333 transitions. [2024-11-10 17:26:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 17:26:46,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:46,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:46,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:26:46,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr623REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:46,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash -131339219, now seen corresponding path program 1 times [2024-11-10 17:26:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:46,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060342441] [2024-11-10 17:26:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:46,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060342441] [2024-11-10 17:26:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060342441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384150340] [2024-11-10 17:26:47,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:47,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:47,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:47,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:47,098 INFO L87 Difference]: Start difference. First operand 2366 states and 3333 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:48,166 INFO L93 Difference]: Finished difference Result 2836 states and 3804 transitions. [2024-11-10 17:26:48,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:26:48,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-10 17:26:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:48,173 INFO L225 Difference]: With dead ends: 2836 [2024-11-10 17:26:48,173 INFO L226 Difference]: Without dead ends: 2836 [2024-11-10 17:26:48,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:26:48,174 INFO L432 NwaCegarLoop]: 1294 mSDtfsCounter, 1245 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:48,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 2791 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:26:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2836 states. [2024-11-10 17:26:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2836 to 2484. [2024-11-10 17:26:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 1992 states have (on average 1.7354417670682731) internal successors, (3457), 2473 states have internal predecessors, (3457), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3475 transitions. [2024-11-10 17:26:48,202 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3475 transitions. Word has length 14 [2024-11-10 17:26:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:48,203 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 3475 transitions. [2024-11-10 17:26:48,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3475 transitions. [2024-11-10 17:26:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 17:26:48,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:48,204 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:48,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:26:48,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr623REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:48,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:48,205 INFO L85 PathProgramCache]: Analyzing trace with hash 549338573, now seen corresponding path program 1 times [2024-11-10 17:26:48,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:48,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640094170] [2024-11-10 17:26:48,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:48,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 17:26:48,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:48,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640094170] [2024-11-10 17:26:48,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640094170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:48,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:48,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:48,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348911588] [2024-11-10 17:26:48,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:48,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:48,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:48,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:48,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:48,363 INFO L87 Difference]: Start difference. First operand 2484 states and 3475 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:48,419 INFO L93 Difference]: Finished difference Result 2217 states and 3105 transitions. [2024-11-10 17:26:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:48,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2024-11-10 17:26:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:48,425 INFO L225 Difference]: With dead ends: 2217 [2024-11-10 17:26:48,425 INFO L226 Difference]: Without dead ends: 2217 [2024-11-10 17:26:48,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:48,426 INFO L432 NwaCegarLoop]: 1320 mSDtfsCounter, 51 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:48,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 2596 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:26:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2024-11-10 17:26:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2024-11-10 17:26:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1748 states have (on average 1.7660183066361557) internal successors, (3087), 2206 states have internal predecessors, (3087), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3105 transitions. [2024-11-10 17:26:48,448 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3105 transitions. Word has length 52 [2024-11-10 17:26:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:48,448 INFO L471 AbstractCegarLoop]: Abstraction has 2217 states and 3105 transitions. [2024-11-10 17:26:48,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3105 transitions. [2024-11-10 17:26:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 17:26:48,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:48,450 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] [2024-11-10 17:26:48,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:26:48,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr570REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:48,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1452084582, now seen corresponding path program 1 times [2024-11-10 17:26:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:48,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625275726] [2024-11-10 17:26:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:48,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:48,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625275726] [2024-11-10 17:26:48,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625275726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:48,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:48,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:26:48,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522086488] [2024-11-10 17:26:48,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:48,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:48,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:48,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:48,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:48,516 INFO L87 Difference]: Start difference. First operand 2217 states and 3105 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:48,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:48,641 INFO L93 Difference]: Finished difference Result 2243 states and 3123 transitions. [2024-11-10 17:26:48,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:26:48,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-11-10 17:26:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:48,647 INFO L225 Difference]: With dead ends: 2243 [2024-11-10 17:26:48,647 INFO L226 Difference]: Without dead ends: 2243 [2024-11-10 17:26:48,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:26:48,648 INFO L432 NwaCegarLoop]: 1312 mSDtfsCounter, 56 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:48,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3862 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:26:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2024-11-10 17:26:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2241. [2024-11-10 17:26:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1772 states have (on average 1.7511286681715577) internal successors, (3103), 2230 states have internal predecessors, (3103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3121 transitions. [2024-11-10 17:26:48,679 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3121 transitions. Word has length 65 [2024-11-10 17:26:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:48,680 INFO L471 AbstractCegarLoop]: Abstraction has 2241 states and 3121 transitions. [2024-11-10 17:26:48,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3121 transitions. [2024-11-10 17:26:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 17:26:48,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:48,681 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] [2024-11-10 17:26:48,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:26:48,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr570REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:48,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2117113826, now seen corresponding path program 1 times [2024-11-10 17:26:48,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:48,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470076531] [2024-11-10 17:26:48,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:48,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:48,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:48,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470076531] [2024-11-10 17:26:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470076531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:48,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013655644] [2024-11-10 17:26:48,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:48,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:48,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:48,789 INFO L87 Difference]: Start difference. First operand 2241 states and 3121 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:48,868 INFO L93 Difference]: Finished difference Result 2005 states and 2713 transitions. [2024-11-10 17:26:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:48,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2024-11-10 17:26:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:48,873 INFO L225 Difference]: With dead ends: 2005 [2024-11-10 17:26:48,873 INFO L226 Difference]: Without dead ends: 2005 [2024-11-10 17:26:48,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:48,874 INFO L432 NwaCegarLoop]: 1327 mSDtfsCounter, 75 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:48,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2626 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:26:48,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2024-11-10 17:26:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 2005. [2024-11-10 17:26:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1536 states have (on average 1.7545572916666667) internal successors, (2695), 1994 states have internal predecessors, (2695), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2713 transitions. [2024-11-10 17:26:48,892 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2713 transitions. Word has length 73 [2024-11-10 17:26:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:48,893 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2713 transitions. [2024-11-10 17:26:48,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2713 transitions. [2024-11-10 17:26:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 17:26:48,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:48,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:48,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:26:48,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr541REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:48,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash 655748320, now seen corresponding path program 1 times [2024-11-10 17:26:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:48,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584820611] [2024-11-10 17:26:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584820611] [2024-11-10 17:26:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584820611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:49,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:49,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:26:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957745785] [2024-11-10 17:26:49,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:49,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:26:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:49,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:26:49,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:26:49,273 INFO L87 Difference]: Start difference. First operand 2005 states and 2713 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:50,347 INFO L93 Difference]: Finished difference Result 1921 states and 2588 transitions. [2024-11-10 17:26:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:26:50,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-10 17:26:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:50,352 INFO L225 Difference]: With dead ends: 1921 [2024-11-10 17:26:50,352 INFO L226 Difference]: Without dead ends: 1921 [2024-11-10 17:26:50,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:26:50,353 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 2310 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:50,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 1577 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2164 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:26:50,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2024-11-10 17:26:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1641. [2024-11-10 17:26:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1256 states have (on average 1.6552547770700636) internal successors, (2079), 1630 states have internal predecessors, (2079), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2097 transitions. [2024-11-10 17:26:50,369 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2097 transitions. Word has length 76 [2024-11-10 17:26:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:50,370 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2097 transitions. [2024-11-10 17:26:50,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2097 transitions. [2024-11-10 17:26:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 17:26:50,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:50,371 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] [2024-11-10 17:26:50,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:26:50,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:50,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2106872745, now seen corresponding path program 1 times [2024-11-10 17:26:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:50,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752015192] [2024-11-10 17:26:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:50,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:50,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752015192] [2024-11-10 17:26:50,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752015192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:26:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807124736] [2024-11-10 17:26:50,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:50,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:26:50,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:50,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:26:50,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:26:50,563 INFO L87 Difference]: Start difference. First operand 1641 states and 2097 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:51,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:51,221 INFO L93 Difference]: Finished difference Result 1640 states and 2095 transitions. [2024-11-10 17:26:51,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:26:51,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-10 17:26:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:51,225 INFO L225 Difference]: With dead ends: 1640 [2024-11-10 17:26:51,225 INFO L226 Difference]: Without dead ends: 1640 [2024-11-10 17:26:51,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:26:51,225 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 2 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:51,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3469 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:26:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-10 17:26:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2024-11-10 17:26:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1256 states have (on average 1.6536624203821657) internal successors, (2077), 1629 states have internal predecessors, (2077), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2095 transitions. [2024-11-10 17:26:51,241 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2095 transitions. Word has length 81 [2024-11-10 17:26:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:51,241 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2095 transitions. [2024-11-10 17:26:51,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2095 transitions. [2024-11-10 17:26:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 17:26:51,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:51,242 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] [2024-11-10 17:26:51,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:26:51,242 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr535REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:51,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2106872746, now seen corresponding path program 1 times [2024-11-10 17:26:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96408076] [2024-11-10 17:26:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96408076] [2024-11-10 17:26:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96408076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:26:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701130960] [2024-11-10 17:26:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:51,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:26:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:26:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:26:51,576 INFO L87 Difference]: Start difference. First operand 1640 states and 2095 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:52,477 INFO L93 Difference]: Finished difference Result 1639 states and 2093 transitions. [2024-11-10 17:26:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:26:52,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-10 17:26:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:52,482 INFO L225 Difference]: With dead ends: 1639 [2024-11-10 17:26:52,483 INFO L226 Difference]: Without dead ends: 1639 [2024-11-10 17:26:52,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:26:52,483 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 1 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3490 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:52,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3490 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 17:26:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-10 17:26:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2024-11-10 17:26:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1254 states have (on average 1.6547049441786283) internal successors, (2075), 1628 states have internal predecessors, (2075), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2093 transitions. [2024-11-10 17:26:52,505 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2093 transitions. Word has length 81 [2024-11-10 17:26:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:52,506 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2093 transitions. [2024-11-10 17:26:52,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2093 transitions. [2024-11-10 17:26:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:26:52,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:52,509 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-10 17:26:52,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 17:26:52,510 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:52,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:52,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1765357606, now seen corresponding path program 1 times [2024-11-10 17:26:52,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:52,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353475684] [2024-11-10 17:26:52,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:52,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:26:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353475684] [2024-11-10 17:26:52,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353475684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:52,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:52,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:26:52,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698912720] [2024-11-10 17:26:52,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:26:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:52,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:26:52,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:26:52,714 INFO L87 Difference]: Start difference. First operand 1639 states and 2093 transitions. Second operand has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:26:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:53,809 INFO L93 Difference]: Finished difference Result 1657 states and 2123 transitions. [2024-11-10 17:26:53,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:26:53,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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 89 [2024-11-10 17:26:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:53,819 INFO L225 Difference]: With dead ends: 1657 [2024-11-10 17:26:53,819 INFO L226 Difference]: Without dead ends: 1657 [2024-11-10 17:26:53,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 17:26:53,820 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 10 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:53,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5390 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:26:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-11-10 17:26:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1648. [2024-11-10 17:26:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1262 states have (on average 1.6529318541996831) internal successors, (2086), 1635 states have internal predecessors, (2086), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-10 17:26:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2113 transitions. [2024-11-10 17:26:53,838 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2113 transitions. Word has length 89 [2024-11-10 17:26:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:53,838 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2113 transitions. [2024-11-10 17:26:53,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:26:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2113 transitions. [2024-11-10 17:26:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:26:53,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:53,839 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-10 17:26:53,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 17:26:53,840 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr531REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:53,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1765357607, now seen corresponding path program 1 times [2024-11-10 17:26:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:53,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335971182] [2024-11-10 17:26:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:54,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:26:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:54,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:54,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335971182] [2024-11-10 17:26:54,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335971182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:54,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:54,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:26:54,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524249619] [2024-11-10 17:26:54,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:54,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:26:54,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:54,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:26:54,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:26:54,242 INFO L87 Difference]: Start difference. First operand 1648 states and 2113 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:26:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:55,260 INFO L93 Difference]: Finished difference Result 1648 states and 2111 transitions. [2024-11-10 17:26:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:26:55,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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 89 [2024-11-10 17:26:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:55,264 INFO L225 Difference]: With dead ends: 1648 [2024-11-10 17:26:55,264 INFO L226 Difference]: Without dead ends: 1648 [2024-11-10 17:26:55,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:26:55,266 INFO L432 NwaCegarLoop]: 1235 mSDtfsCounter, 5 mSDsluCounter, 3277 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4512 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:55,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4512 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:26:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-10 17:26:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2024-11-10 17:26:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1262 states have (on average 1.6513470681458002) internal successors, (2084), 1635 states have internal predecessors, (2084), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-10 17:26:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2111 transitions. [2024-11-10 17:26:55,289 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2111 transitions. Word has length 89 [2024-11-10 17:26:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:55,289 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2111 transitions. [2024-11-10 17:26:55,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:26:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2111 transitions. [2024-11-10 17:26:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 17:26:55,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:55,291 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] [2024-11-10 17:26:55,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 17:26:55,291 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:55,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash 606641499, now seen corresponding path program 1 times [2024-11-10 17:26:55,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:55,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124977224] [2024-11-10 17:26:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:55,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:55,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:26:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:55,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124977224] [2024-11-10 17:26:55,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124977224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:26:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452724739] [2024-11-10 17:26:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:55,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:26:55,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:26:55,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:26:55,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 17:26:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:55,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 17:26:55,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:55,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:26:55,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:26:55,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:26:55,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:26:56,005 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:26:56,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:26:56,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:26:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:56,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:26:56,069 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 17:26:56,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 17:26:56,078 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-10 17:26:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452724739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:26:56,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:26:56,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-10 17:26:56,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097269951] [2024-11-10 17:26:56,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:26:56,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:26:56,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:56,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:26:56,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-10 17:26:56,084 INFO L87 Difference]: Start difference. First operand 1648 states and 2111 transitions. Second operand has 15 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:26:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:57,941 INFO L93 Difference]: Finished difference Result 1647 states and 2109 transitions. [2024-11-10 17:26:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:26:57,941 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-11-10 17:26:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:57,945 INFO L225 Difference]: With dead ends: 1647 [2024-11-10 17:26:57,945 INFO L226 Difference]: Without dead ends: 1647 [2024-11-10 17:26:57,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-10 17:26:57,945 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1194 mSDsluCounter, 5764 mSDsCounter, 0 mSdLazyCounter, 4896 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 6511 SdHoareTripleChecker+Invalid, 4922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:57,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 6511 Invalid, 4922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4896 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:26:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-11-10 17:26:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2024-11-10 17:26:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1262 states have (on average 1.6497622820919176) internal successors, (2082), 1634 states have internal predecessors, (2082), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-10 17:26:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2109 transitions. [2024-11-10 17:26:57,966 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2109 transitions. Word has length 90 [2024-11-10 17:26:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:57,966 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2109 transitions. [2024-11-10 17:26:57,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:26:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2109 transitions. [2024-11-10 17:26:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 17:26:57,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:57,968 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] [2024-11-10 17:26:57,981 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-10 17:26:58,168 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,SelfDestructingSolverStorable14 [2024-11-10 17:26:58,169 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr531REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:26:58,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 606641500, now seen corresponding path program 1 times [2024-11-10 17:26:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:58,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259574480] [2024-11-10 17:26:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:58,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:26:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:58,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259574480] [2024-11-10 17:26:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259574480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:26:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851902666] [2024-11-10 17:26:58,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:58,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:26:58,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:26:58,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:26:58,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 17:26:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:58,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 17:26:58,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:58,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:26:58,953 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:26:58,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:26:58,974 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-10 17:26:58,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:26:59,118 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:26:59,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-10 17:26:59,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-10 17:26:59,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-10 17:26:59,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-10 17:26:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:59,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:26:59,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 17:26:59,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-10 17:26:59,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_628 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem50#1.base|)) (forall ((v_ArrVal_627 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem50#1.offset| 25))))) is different from false [2024-11-10 17:26:59,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851902666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:26:59,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:26:59,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-11-10 17:26:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400439284] [2024-11-10 17:26:59,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:26:59,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 17:26:59,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:59,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 17:26:59,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=399, Unknown=1, NotChecked=40, Total=506 [2024-11-10 17:26:59,298 INFO L87 Difference]: Start difference. First operand 1647 states and 2109 transitions. Second operand has 20 states, 17 states have (on average 8.235294117647058) internal successors, (140), 19 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:27:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:01,436 INFO L93 Difference]: Finished difference Result 1646 states and 2107 transitions. [2024-11-10 17:27:01,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 17:27:01,436 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.235294117647058) internal successors, (140), 19 states have internal predecessors, (140), 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 90 [2024-11-10 17:27:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:01,439 INFO L225 Difference]: With dead ends: 1646 [2024-11-10 17:27:01,439 INFO L226 Difference]: Without dead ends: 1646 [2024-11-10 17:27:01,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=596, Unknown=1, NotChecked=50, Total=756 [2024-11-10 17:27:01,440 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1229 mSDsluCounter, 5268 mSDsCounter, 0 mSdLazyCounter, 5438 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 6014 SdHoareTripleChecker+Invalid, 5468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:01,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 6014 Invalid, 5468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5438 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:27:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2024-11-10 17:27:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1637. [2024-11-10 17:27:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1254 states have (on average 1.6515151515151516) internal successors, (2071), 1626 states have internal predecessors, (2071), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:27:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2089 transitions. [2024-11-10 17:27:01,454 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2089 transitions. Word has length 90 [2024-11-10 17:27:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:01,454 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2089 transitions. [2024-11-10 17:27:01,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.235294117647058) internal successors, (140), 19 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:27:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2089 transitions. [2024-11-10 17:27:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:27:01,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:01,456 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-10 17:27:01,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 17:27:01,659 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,SelfDestructingSolverStorable15 [2024-11-10 17:27:01,660 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:01,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:01,661 INFO L85 PathProgramCache]: Analyzing trace with hash -104802415, now seen corresponding path program 1 times [2024-11-10 17:27:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:01,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257683224] [2024-11-10 17:27:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:02,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:02,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:02,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257683224] [2024-11-10 17:27:02,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257683224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:02,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:02,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:27:02,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403269151] [2024-11-10 17:27:02,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:02,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:27:02,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:02,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:27:02,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:27:02,030 INFO L87 Difference]: Start difference. First operand 1637 states and 2089 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:03,715 INFO L93 Difference]: Finished difference Result 1653 states and 2115 transitions. [2024-11-10 17:27:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:27:03,715 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-10 17:27:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:03,718 INFO L225 Difference]: With dead ends: 1653 [2024-11-10 17:27:03,718 INFO L226 Difference]: Without dead ends: 1653 [2024-11-10 17:27:03,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-10 17:27:03,719 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1222 mSDsluCounter, 5806 mSDsCounter, 0 mSdLazyCounter, 4920 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 6552 SdHoareTripleChecker+Invalid, 4941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:03,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 6552 Invalid, 4941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4920 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:27:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-11-10 17:27:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1652. [2024-11-10 17:27:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1268 states have (on average 1.6466876971608833) internal successors, (2088), 1639 states have internal predecessors, (2088), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-10 17:27:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2115 transitions. [2024-11-10 17:27:03,752 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2115 transitions. Word has length 92 [2024-11-10 17:27:03,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:03,753 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 2115 transitions. [2024-11-10 17:27:03,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2115 transitions. [2024-11-10 17:27:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:27:03,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:03,754 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-10 17:27:03,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 17:27:03,754 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:03,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:03,755 INFO L85 PathProgramCache]: Analyzing trace with hash -104802414, now seen corresponding path program 1 times [2024-11-10 17:27:03,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:03,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023173518] [2024-11-10 17:27:03,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:04,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:04,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:04,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023173518] [2024-11-10 17:27:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023173518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:04,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:04,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 17:27:04,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729701121] [2024-11-10 17:27:04,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:04,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 17:27:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 17:27:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 17:27:04,264 INFO L87 Difference]: Start difference. First operand 1652 states and 2115 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:06,444 INFO L93 Difference]: Finished difference Result 1652 states and 2113 transitions. [2024-11-10 17:27:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:27:06,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-10 17:27:06,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:06,447 INFO L225 Difference]: With dead ends: 1652 [2024-11-10 17:27:06,447 INFO L226 Difference]: Without dead ends: 1652 [2024-11-10 17:27:06,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:27:06,448 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 1216 mSDsluCounter, 4926 mSDsCounter, 0 mSdLazyCounter, 5767 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 5679 SdHoareTripleChecker+Invalid, 5786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:06,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 5679 Invalid, 5786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5767 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 17:27:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2024-11-10 17:27:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1652. [2024-11-10 17:27:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1268 states have (on average 1.6451104100946372) internal successors, (2086), 1639 states have internal predecessors, (2086), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-10 17:27:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2113 transitions. [2024-11-10 17:27:06,462 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2113 transitions. Word has length 92 [2024-11-10 17:27:06,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:06,462 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 2113 transitions. [2024-11-10 17:27:06,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:06,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2113 transitions. [2024-11-10 17:27:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 17:27:06,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:06,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:06,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 17:27:06,464 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:06,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:06,464 INFO L85 PathProgramCache]: Analyzing trace with hash -764188100, now seen corresponding path program 1 times [2024-11-10 17:27:06,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:06,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409681120] [2024-11-10 17:27:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:06,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:06,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:06,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:06,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409681120] [2024-11-10 17:27:06,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409681120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:06,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071018854] [2024-11-10 17:27:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:06,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:27:06,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:27:06,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 17:27:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:06,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 17:27:07,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:07,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:27:07,084 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:27:07,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:27:07,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:27:07,146 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:07,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:07,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:07,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:07,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:27:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:07,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:07,205 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_883) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:27:07,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:27:07,241 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-10 17:27:07,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-10 17:27:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071018854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:07,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:07,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-10 17:27:07,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43435729] [2024-11-10 17:27:07,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:07,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 17:27:07,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:07,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 17:27:07,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=253, Unknown=10, NotChecked=66, Total=380 [2024-11-10 17:27:07,272 INFO L87 Difference]: Start difference. First operand 1652 states and 2113 transitions. Second operand has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:09,689 INFO L93 Difference]: Finished difference Result 1651 states and 2111 transitions. [2024-11-10 17:27:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:27:09,689 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-10 17:27:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:09,692 INFO L225 Difference]: With dead ends: 1651 [2024-11-10 17:27:09,692 INFO L226 Difference]: Without dead ends: 1651 [2024-11-10 17:27:09,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=539, Unknown=10, NotChecked=98, Total=756 [2024-11-10 17:27:09,692 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1205 mSDsluCounter, 9386 mSDsCounter, 0 mSdLazyCounter, 7580 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 10132 SdHoareTripleChecker+Invalid, 7600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:09,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 10132 Invalid, 7600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 7580 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:27:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2024-11-10 17:27:09,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2024-11-10 17:27:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1268 states have (on average 1.6435331230283912) internal successors, (2084), 1638 states have internal predecessors, (2084), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-10 17:27:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2111 transitions. [2024-11-10 17:27:09,706 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2111 transitions. Word has length 93 [2024-11-10 17:27:09,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:09,706 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2111 transitions. [2024-11-10 17:27:09,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:09,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2111 transitions. [2024-11-10 17:27:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 17:27:09,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:09,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:09,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 17:27:09,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:09,907 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:09,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash -764188099, now seen corresponding path program 1 times [2024-11-10 17:27:09,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:09,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061712519] [2024-11-10 17:27:09,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:09,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:10,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:10,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:10,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061712519] [2024-11-10 17:27:10,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061712519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:10,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388794108] [2024-11-10 17:27:10,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:10,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:10,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:27:10,448 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:27:10,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 17:27:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:10,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 17:27:10,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:10,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:27:10,704 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:27:10,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:27:10,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:27:10,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:27:10,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:27:10,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:27:10,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:27:10,836 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:10,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:27:10,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:10,902 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:10,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:27:10,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:10,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:27:10,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:27:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:10,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:10,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1029 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:27:10,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1029 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-10 17:27:11,021 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1036) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1036) .cse1 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-10 17:27:11,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388794108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:11,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:11,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-10 17:27:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687092735] [2024-11-10 17:27:11,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:11,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 17:27:11,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:11,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 17:27:11,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=293, Unknown=3, NotChecked=108, Total=462 [2024-11-10 17:27:11,024 INFO L87 Difference]: Start difference. First operand 1651 states and 2111 transitions. Second operand has 17 states, 15 states have (on average 9.2) internal successors, (138), 16 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-10 17:27:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:14,321 INFO L93 Difference]: Finished difference Result 1658 states and 2117 transitions. [2024-11-10 17:27:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:27:14,321 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.2) internal successors, (138), 16 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 93 [2024-11-10 17:27:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:14,323 INFO L225 Difference]: With dead ends: 1658 [2024-11-10 17:27:14,323 INFO L226 Difference]: Without dead ends: 1658 [2024-11-10 17:27:14,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2024-11-10 17:27:14,324 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1211 mSDsluCounter, 6364 mSDsCounter, 0 mSdLazyCounter, 8149 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 7108 SdHoareTripleChecker+Invalid, 8172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:14,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 7108 Invalid, 8172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 8149 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-10 17:27:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2024-11-10 17:27:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1640. [2024-11-10 17:27:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1258 states have (on average 1.6470588235294117) internal successors, (2072), 1628 states have internal predecessors, (2072), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:27:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2090 transitions. [2024-11-10 17:27:14,351 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2090 transitions. Word has length 93 [2024-11-10 17:27:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:14,351 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2090 transitions. [2024-11-10 17:27:14,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.2) internal successors, (138), 16 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-10 17:27:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2090 transitions. [2024-11-10 17:27:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:27:14,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:14,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:14,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 17:27:14,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:14,553 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:14,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:14,553 INFO L85 PathProgramCache]: Analyzing trace with hash 273768735, now seen corresponding path program 1 times [2024-11-10 17:27:14,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:14,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836290362] [2024-11-10 17:27:14,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:14,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:14,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:14,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836290362] [2024-11-10 17:27:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836290362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:14,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 17:27:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746878999] [2024-11-10 17:27:14,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:27:14,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:14,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:27:14,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 17:27:14,945 INFO L87 Difference]: Start difference. First operand 1640 states and 2090 transitions. Second operand has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:16,523 INFO L93 Difference]: Finished difference Result 1665 states and 2125 transitions. [2024-11-10 17:27:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:27:16,523 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-10 17:27:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:16,525 INFO L225 Difference]: With dead ends: 1665 [2024-11-10 17:27:16,525 INFO L226 Difference]: Without dead ends: 1665 [2024-11-10 17:27:16,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-10 17:27:16,526 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1204 mSDsluCounter, 5760 mSDsCounter, 0 mSdLazyCounter, 4913 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 6505 SdHoareTripleChecker+Invalid, 4934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:16,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 6505 Invalid, 4934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4913 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:27:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2024-11-10 17:27:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1661. [2024-11-10 17:27:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1278 states have (on average 1.6392801251956182) internal successors, (2095), 1647 states have internal predecessors, (2095), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:27:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2115 transitions. [2024-11-10 17:27:16,538 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2115 transitions. Word has length 95 [2024-11-10 17:27:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:16,538 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2115 transitions. [2024-11-10 17:27:16,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2115 transitions. [2024-11-10 17:27:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:27:16,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:16,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:16,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 17:27:16,539 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:16,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash 273768736, now seen corresponding path program 1 times [2024-11-10 17:27:16,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:16,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570490912] [2024-11-10 17:27:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:17,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:17,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:17,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570490912] [2024-11-10 17:27:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570490912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:17,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:17,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 17:27:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220416976] [2024-11-10 17:27:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:17,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 17:27:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 17:27:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 17:27:17,084 INFO L87 Difference]: Start difference. First operand 1661 states and 2115 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:19,003 INFO L93 Difference]: Finished difference Result 1664 states and 2123 transitions. [2024-11-10 17:27:19,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:27:19,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-10 17:27:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:19,006 INFO L225 Difference]: With dead ends: 1664 [2024-11-10 17:27:19,006 INFO L226 Difference]: Without dead ends: 1664 [2024-11-10 17:27:19,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-10 17:27:19,006 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1196 mSDsluCounter, 5066 mSDsCounter, 0 mSdLazyCounter, 5584 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 5818 SdHoareTripleChecker+Invalid, 5603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:19,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 5818 Invalid, 5603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5584 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:27:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2024-11-10 17:27:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1661. [2024-11-10 17:27:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1278 states have (on average 1.637715179968701) internal successors, (2093), 1647 states have internal predecessors, (2093), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:27:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2113 transitions. [2024-11-10 17:27:19,017 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2113 transitions. Word has length 95 [2024-11-10 17:27:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:19,018 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2113 transitions. [2024-11-10 17:27:19,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2113 transitions. [2024-11-10 17:27:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 17:27:19,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:19,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:19,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 17:27:19,019 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:19,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:19,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1695238804, now seen corresponding path program 1 times [2024-11-10 17:27:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:19,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861878079] [2024-11-10 17:27:19,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:19,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:19,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861878079] [2024-11-10 17:27:19,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861878079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761137755] [2024-11-10 17:27:19,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:19,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:19,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:27:19,392 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:27:19,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 17:27:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:19,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 17:27:19,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:19,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:27:19,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:27:19,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:27:19,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:27:19,752 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:19,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:19,781 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:19,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:19,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:19,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:19,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:27:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:19,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:19,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1316) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:27:19,837 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:27:19,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1315 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-10 17:27:19,892 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-10 17:27:19,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-10 17:27:19,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761137755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:19,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:19,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-10 17:27:19,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567964438] [2024-11-10 17:27:19,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:19,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 17:27:19,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:19,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 17:27:19,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=386, Unknown=15, NotChecked=126, Total=600 [2024-11-10 17:27:19,927 INFO L87 Difference]: Start difference. First operand 1661 states and 2113 transitions. Second operand has 20 states, 18 states have (on average 8.0) internal successors, (144), 19 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:21,872 INFO L93 Difference]: Finished difference Result 1663 states and 2121 transitions. [2024-11-10 17:27:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:27:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 19 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-10 17:27:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:21,875 INFO L225 Difference]: With dead ends: 1663 [2024-11-10 17:27:21,875 INFO L226 Difference]: Without dead ends: 1663 [2024-11-10 17:27:21,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=780, Unknown=15, NotChecked=180, Total=1122 [2024-11-10 17:27:21,876 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1182 mSDsluCounter, 7205 mSDsCounter, 0 mSdLazyCounter, 5995 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 7950 SdHoareTripleChecker+Invalid, 6016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:21,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 7950 Invalid, 6016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5995 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:27:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-10 17:27:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1660. [2024-11-10 17:27:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1278 states have (on average 1.636150234741784) internal successors, (2091), 1646 states have internal predecessors, (2091), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:27:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2111 transitions. [2024-11-10 17:27:21,888 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2111 transitions. Word has length 96 [2024-11-10 17:27:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:21,888 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2111 transitions. [2024-11-10 17:27:21,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 19 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2111 transitions. [2024-11-10 17:27:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 17:27:21,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:21,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:21,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 17:27:22,090 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,SelfDestructingSolverStorable22 [2024-11-10 17:27:22,090 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:22,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:22,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1695238805, now seen corresponding path program 1 times [2024-11-10 17:27:22,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:22,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960141188] [2024-11-10 17:27:22,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:22,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:22,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960141188] [2024-11-10 17:27:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960141188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:22,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792130970] [2024-11-10 17:27:22,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:22,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:22,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:27:22,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:27:22,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 17:27:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:22,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 17:27:22,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:22,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:27:22,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:27:22,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:27:22,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:27:22,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:27:22,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:27:23,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:27:23,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:27:23,071 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:23,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:27:23,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:23,114 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:23,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:27:23,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:23,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:23,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:27:23,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:23,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:27:23,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:27:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:23,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:23,216 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1477 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:27:23,226 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1477 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:27:23,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1474))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1475) .cse0 v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1475) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1474) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-10 17:27:23,327 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1483))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1474))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1482) .cse0 v_ArrVal_1475) .cse1 v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1483))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1482) .cse5 v_ArrVal_1475) (select (select (store .cse6 .cse5 v_ArrVal_1474) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1477))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2024-11-10 17:27:23,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792130970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:23,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:23,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-10 17:27:23,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190687066] [2024-11-10 17:27:23,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:23,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 17:27:23,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 17:27:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=390, Unknown=10, NotChecked=172, Total=650 [2024-11-10 17:27:23,330 INFO L87 Difference]: Start difference. First operand 1660 states and 2111 transitions. Second operand has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 18 states have internal predecessors, (143), 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-10 17:27:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:26,581 INFO L93 Difference]: Finished difference Result 1662 states and 2119 transitions. [2024-11-10 17:27:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:27:26,581 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 18 states have internal predecessors, (143), 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 96 [2024-11-10 17:27:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:26,584 INFO L225 Difference]: With dead ends: 1662 [2024-11-10 17:27:26,585 INFO L226 Difference]: Without dead ends: 1662 [2024-11-10 17:27:26,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=790, Unknown=10, NotChecked=244, Total=1190 [2024-11-10 17:27:26,586 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 1230 mSDsluCounter, 6355 mSDsCounter, 0 mSdLazyCounter, 8141 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 7098 SdHoareTripleChecker+Invalid, 8165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:26,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 7098 Invalid, 8165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 8141 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-10 17:27:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-11-10 17:27:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1638. [2024-11-10 17:27:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1258 states have (on average 1.643879173290938) internal successors, (2068), 1626 states have internal predecessors, (2068), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:27:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2086 transitions. [2024-11-10 17:27:26,597 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2086 transitions. Word has length 96 [2024-11-10 17:27:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:26,597 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2086 transitions. [2024-11-10 17:27:26,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 18 states have internal predecessors, (143), 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-10 17:27:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2086 transitions. [2024-11-10 17:27:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:27:26,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:26,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:26,612 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-10 17:27:26,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:26,803 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:26,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash -297227862, now seen corresponding path program 1 times [2024-11-10 17:27:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:26,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832547835] [2024-11-10 17:27:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:26,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:27,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:27,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832547835] [2024-11-10 17:27:27,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832547835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:27,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:27,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 17:27:27,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354167921] [2024-11-10 17:27:27,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:27,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:27:27,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:27,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:27:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:27:27,265 INFO L87 Difference]: Start difference. First operand 1638 states and 2086 transitions. Second operand has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:28,804 INFO L93 Difference]: Finished difference Result 1669 states and 2127 transitions. [2024-11-10 17:27:28,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:27:28,804 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-10 17:27:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:28,806 INFO L225 Difference]: With dead ends: 1669 [2024-11-10 17:27:28,806 INFO L226 Difference]: Without dead ends: 1669 [2024-11-10 17:27:28,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:27:28,807 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1264 mSDsluCounter, 5082 mSDsCounter, 0 mSdLazyCounter, 4384 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 5826 SdHoareTripleChecker+Invalid, 4405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:28,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 5826 Invalid, 4405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4384 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:27:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-11-10 17:27:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1665. [2024-11-10 17:27:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1284 states have (on average 1.6331775700934579) internal successors, (2097), 1651 states have internal predecessors, (2097), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:27:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2117 transitions. [2024-11-10 17:27:28,818 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2117 transitions. Word has length 98 [2024-11-10 17:27:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:28,819 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2117 transitions. [2024-11-10 17:27:28,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2117 transitions. [2024-11-10 17:27:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:27:28,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:28,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:28,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 17:27:28,820 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:28,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash -297227861, now seen corresponding path program 1 times [2024-11-10 17:27:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:28,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705322420] [2024-11-10 17:27:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:29,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:29,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705322420] [2024-11-10 17:27:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705322420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:29,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:29,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:27:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349035759] [2024-11-10 17:27:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:29,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:27:29,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:29,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:27:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:27:29,378 INFO L87 Difference]: Start difference. First operand 1665 states and 2117 transitions. Second operand has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:31,828 INFO L93 Difference]: Finished difference Result 1668 states and 2125 transitions. [2024-11-10 17:27:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 17:27:31,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-10 17:27:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:31,831 INFO L225 Difference]: With dead ends: 1668 [2024-11-10 17:27:31,831 INFO L226 Difference]: Without dead ends: 1668 [2024-11-10 17:27:31,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-10 17:27:31,831 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 1238 mSDsluCounter, 6143 mSDsCounter, 0 mSdLazyCounter, 6983 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 6894 SdHoareTripleChecker+Invalid, 7002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 6983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:31,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 6894 Invalid, 7002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 6983 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:27:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2024-11-10 17:27:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1665. [2024-11-10 17:27:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1284 states have (on average 1.631619937694704) internal successors, (2095), 1651 states have internal predecessors, (2095), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:27:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2115 transitions. [2024-11-10 17:27:31,844 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2115 transitions. Word has length 98 [2024-11-10 17:27:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:31,844 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2115 transitions. [2024-11-10 17:27:31,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2115 transitions. [2024-11-10 17:27:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:27:31,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:31,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:31,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 17:27:31,845 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:31,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1659940843, now seen corresponding path program 1 times [2024-11-10 17:27:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876954311] [2024-11-10 17:27:31,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:32,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:32,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:32,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876954311] [2024-11-10 17:27:32,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876954311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:32,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597150372] [2024-11-10 17:27:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:32,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:32,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:27:32,275 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:27:32,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 17:27:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:32,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 17:27:32,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:32,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:27:32,550 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:27:32,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:27:32,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:27:32,598 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:32,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:32,632 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:32,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:32,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:32,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:32,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:32,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:32,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:27:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:32,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:32,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1788) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:27:32,738 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-10 17:27:32,766 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-10 17:27:32,818 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-10 17:27:32,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-10 17:27:32,828 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1791))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1786)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-10 17:27:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597150372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:32,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:32,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2024-11-10 17:27:32,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961487744] [2024-11-10 17:27:32,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:32,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 17:27:32,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:32,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 17:27:32,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=496, Unknown=24, NotChecked=196, Total=812 [2024-11-10 17:27:32,830 INFO L87 Difference]: Start difference. First operand 1665 states and 2115 transitions. Second operand has 22 states, 20 states have (on average 7.45) internal successors, (149), 21 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:34,639 INFO L93 Difference]: Finished difference Result 1667 states and 2123 transitions. [2024-11-10 17:27:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 17:27:34,640 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.45) internal successors, (149), 21 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-11-10 17:27:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:34,643 INFO L225 Difference]: With dead ends: 1667 [2024-11-10 17:27:34,643 INFO L226 Difference]: Without dead ends: 1667 [2024-11-10 17:27:34,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=990, Unknown=30, NotChecked=276, Total=1482 [2024-11-10 17:27:34,643 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1182 mSDsluCounter, 6470 mSDsCounter, 0 mSdLazyCounter, 5446 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 7214 SdHoareTripleChecker+Invalid, 5472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:34,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 7214 Invalid, 5472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5446 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:27:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-10 17:27:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1664. [2024-11-10 17:27:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1284 states have (on average 1.6300623052959502) internal successors, (2093), 1650 states have internal predecessors, (2093), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:27:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2113 transitions. [2024-11-10 17:27:34,655 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2113 transitions. Word has length 99 [2024-11-10 17:27:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:34,655 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2113 transitions. [2024-11-10 17:27:34,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.45) internal successors, (149), 21 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2113 transitions. [2024-11-10 17:27:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:27:34,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:34,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:34,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 17:27:34,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:34,857 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:34,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1659940842, now seen corresponding path program 1 times [2024-11-10 17:27:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535537343] [2024-11-10 17:27:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:34,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:35,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:35,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:35,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535537343] [2024-11-10 17:27:35,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535537343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:35,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191905903] [2024-11-10 17:27:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:35,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:35,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:27:35,482 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:27:35,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 17:27:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:35,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 17:27:35,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:35,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:27:35,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:27:35,756 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:27:35,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:27:35,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:27:35,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:27:35,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:27:35,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:27:35,862 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:35,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:27:35,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:35,909 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:35,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:27:35,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:35,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:35,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:27:35,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:35,999 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:35,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:27:36,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:36,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:27:36,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:27:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:36,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:36,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1961) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1960))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1961) .cse1 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-10 17:27:36,163 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1960))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1961) .cse1 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1961) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-10 17:27:36,180 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1958))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1960))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1959) .cse0 v_ArrVal_1961) .cse1 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1958))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1959) .cse5 v_ArrVal_1961) (select (select (store .cse6 .cse5 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1962))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-10 17:27:36,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1958))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1959) .cse1 v_ArrVal_1961) (select (select (store .cse2 .cse1 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1962))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1958))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1960))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1959) .cse4 v_ArrVal_1961) .cse5 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-10 17:27:36,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1968 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1968))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1958))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1960))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1969) .cse0 v_ArrVal_1959) .cse1 v_ArrVal_1961) .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1968 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1968))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1958))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1969) .cse7 v_ArrVal_1959) .cse8 v_ArrVal_1961) (select (select (store .cse9 .cse8 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1962))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-10 17:27:36,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191905903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:36,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:36,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 20 [2024-11-10 17:27:36,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229572710] [2024-11-10 17:27:36,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:36,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 17:27:36,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:36,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 17:27:36,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=496, Unknown=27, NotChecked=250, Total=870 [2024-11-10 17:27:36,254 INFO L87 Difference]: Start difference. First operand 1664 states and 2113 transitions. Second operand has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 20 states have internal predecessors, (148), 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-10 17:27:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:38,656 INFO L93 Difference]: Finished difference Result 1666 states and 2121 transitions. [2024-11-10 17:27:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 17:27:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 20 states have internal predecessors, (148), 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 99 [2024-11-10 17:27:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:38,658 INFO L225 Difference]: With dead ends: 1666 [2024-11-10 17:27:38,658 INFO L226 Difference]: Without dead ends: 1666 [2024-11-10 17:27:38,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1003, Unknown=31, NotChecked=350, Total=1560 [2024-11-10 17:27:38,659 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 1208 mSDsluCounter, 4862 mSDsCounter, 0 mSdLazyCounter, 5782 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 5604 SdHoareTripleChecker+Invalid, 5806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:38,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 5604 Invalid, 5806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5782 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:27:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-10 17:27:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1636. [2024-11-10 17:27:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1258 states have (on average 1.6406995230524641) internal successors, (2064), 1624 states have internal predecessors, (2064), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:27:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2082 transitions. [2024-11-10 17:27:38,671 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2082 transitions. Word has length 99 [2024-11-10 17:27:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:38,672 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2082 transitions. [2024-11-10 17:27:38,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 20 states have internal predecessors, (148), 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-10 17:27:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2082 transitions. [2024-11-10 17:27:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 17:27:38,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:38,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:38,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 17:27:38,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-10 17:27:38,876 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash -477933020, now seen corresponding path program 1 times [2024-11-10 17:27:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:38,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984603800] [2024-11-10 17:27:38,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:39,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984603800] [2024-11-10 17:27:39,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984603800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:39,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:39,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 17:27:39,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868608163] [2024-11-10 17:27:39,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:39,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 17:27:39,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:39,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 17:27:39,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-10 17:27:39,391 INFO L87 Difference]: Start difference. First operand 1636 states and 2082 transitions. Second operand has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:41,172 INFO L93 Difference]: Finished difference Result 1675 states and 2131 transitions. [2024-11-10 17:27:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 17:27:41,172 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 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 102 [2024-11-10 17:27:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:41,174 INFO L225 Difference]: With dead ends: 1675 [2024-11-10 17:27:41,174 INFO L226 Difference]: Without dead ends: 1675 [2024-11-10 17:27:41,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-10 17:27:41,175 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 1202 mSDsluCounter, 6480 mSDsCounter, 0 mSdLazyCounter, 5462 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 7223 SdHoareTripleChecker+Invalid, 5485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:41,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 7223 Invalid, 5485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5462 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:27:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2024-11-10 17:27:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1671. [2024-11-10 17:27:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1292 states have (on average 1.6261609907120742) internal successors, (2101), 1657 states have internal predecessors, (2101), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:27:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2121 transitions. [2024-11-10 17:27:41,198 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2121 transitions. Word has length 102 [2024-11-10 17:27:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:41,198 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2121 transitions. [2024-11-10 17:27:41,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2121 transitions. [2024-11-10 17:27:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 17:27:41,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:41,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:41,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 17:27:41,199 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr515REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:41,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash -477933019, now seen corresponding path program 1 times [2024-11-10 17:27:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:41,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352357330] [2024-11-10 17:27:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:42,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:42,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352357330] [2024-11-10 17:27:42,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352357330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:42,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:42,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 17:27:42,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215908984] [2024-11-10 17:27:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:42,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 17:27:42,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:42,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 17:27:42,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-10 17:27:42,107 INFO L87 Difference]: Start difference. First operand 1671 states and 2121 transitions. Second operand has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:45,057 INFO L93 Difference]: Finished difference Result 1674 states and 2129 transitions. [2024-11-10 17:27:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 17:27:45,058 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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 102 [2024-11-10 17:27:45,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:45,059 INFO L225 Difference]: With dead ends: 1674 [2024-11-10 17:27:45,059 INFO L226 Difference]: Without dead ends: 1674 [2024-11-10 17:27:45,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-10 17:27:45,060 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 1260 mSDsluCounter, 5791 mSDsCounter, 0 mSdLazyCounter, 7440 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 6534 SdHoareTripleChecker+Invalid, 7464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:45,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 6534 Invalid, 7464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7440 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 17:27:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2024-11-10 17:27:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1671. [2024-11-10 17:27:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1292 states have (on average 1.6246130030959753) internal successors, (2099), 1657 states have internal predecessors, (2099), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:27:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2119 transitions. [2024-11-10 17:27:45,071 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2119 transitions. Word has length 102 [2024-11-10 17:27:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:45,072 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2119 transitions. [2024-11-10 17:27:45,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:27:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2119 transitions. [2024-11-10 17:27:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 17:27:45,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:45,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:45,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 17:27:45,072 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:45,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash -395654385, now seen corresponding path program 1 times [2024-11-10 17:27:45,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181840202] [2024-11-10 17:27:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:45,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:45,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:45,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181840202] [2024-11-10 17:27:45,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181840202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018601902] [2024-11-10 17:27:45,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:45,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:45,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:27:45,569 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:27:45,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 17:27:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:45,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 17:27:45,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:45,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:27:45,829 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:27:45,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:27:45,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:27:45,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:45,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:45,922 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:45,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:45,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:45,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:45,990 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:45,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:46,026 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:46,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:27:46,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:27:46,046 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 17:27:46,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 19 treesize of output 16 [2024-11-10 17:27:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:46,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:46,482 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-10 17:27:46,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-10 17:27:46,494 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2307 (Array Int Int)) (v_ArrVal_2306 (Array Int Int)) (v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2311))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2304)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2305)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2306)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2307)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-10 17:27:46,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018601902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:46,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:46,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 23 [2024-11-10 17:27:46,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81224016] [2024-11-10 17:27:46,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:46,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 17:27:46,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:46,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 17:27:46,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=932, Unknown=44, NotChecked=64, Total=1190 [2024-11-10 17:27:46,496 INFO L87 Difference]: Start difference. First operand 1671 states and 2119 transitions. Second operand has 24 states, 22 states have (on average 7.045454545454546) internal successors, (155), 23 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:48,666 INFO L93 Difference]: Finished difference Result 1673 states and 2127 transitions. [2024-11-10 17:27:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 17:27:48,666 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 7.045454545454546) internal successors, (155), 23 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-11-10 17:27:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:48,668 INFO L225 Difference]: With dead ends: 1673 [2024-11-10 17:27:48,668 INFO L226 Difference]: Without dead ends: 1673 [2024-11-10 17:27:48,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1663, Unknown=44, NotChecked=86, Total=2070 [2024-11-10 17:27:48,669 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 1225 mSDsluCounter, 7981 mSDsCounter, 0 mSdLazyCounter, 6524 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 8724 SdHoareTripleChecker+Invalid, 6546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:48,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 8724 Invalid, 6546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 6524 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:27:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2024-11-10 17:27:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1670. [2024-11-10 17:27:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1292 states have (on average 1.6230650154798762) internal successors, (2097), 1656 states have internal predecessors, (2097), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:27:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2117 transitions. [2024-11-10 17:27:48,682 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2117 transitions. Word has length 103 [2024-11-10 17:27:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:48,682 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2117 transitions. [2024-11-10 17:27:48,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 7.045454545454546) internal successors, (155), 23 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2117 transitions. [2024-11-10 17:27:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 17:27:48,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:48,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:48,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 17:27:48,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:48,884 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr515REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:27:48,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash -395654384, now seen corresponding path program 1 times [2024-11-10 17:27:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:27:48,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414446790] [2024-11-10 17:27:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:27:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:49,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:27:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:27:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414446790] [2024-11-10 17:27:49,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414446790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505354484] [2024-11-10 17:27:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:49,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:27:49,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:27:49,715 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:27:49,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 17:27:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:49,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-10 17:27:49,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:49,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:27:49,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:27:49,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:27:49,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:27:50,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:27:50,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:27:50,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:27:50,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:27:50,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:50,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-10 17:27:50,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:50,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:50,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-10 17:27:50,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:50,248 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:50,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-10 17:27:50,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:50,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:50,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-10 17:27:50,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:27:50,359 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:50,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-10 17:27:50,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 30 treesize of output 13 [2024-11-10 17:27:50,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-10 17:27:50,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:27:50,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:27:50,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-10 17:27:50,398 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:27:50,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:27:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:50,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:50,989 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2496))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2497) .cse1 v_ArrVal_2498) (select (select (store .cse2 .cse1 v_ArrVal_2499) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2500))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (or (forall ((v_ArrVal_2502 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2496))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2499))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2497) .cse4 v_ArrVal_2498) .cse5 v_ArrVal_2500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2502) (select (select (store .cse6 .cse5 v_ArrVal_2501) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))))))) is different from false [2024-11-10 17:27:51,015 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2494))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2496))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2495) .cse0 v_ArrVal_2497) .cse1 v_ArrVal_2498) (select (select (store .cse2 .cse1 v_ArrVal_2499) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2500))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2502 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2494))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2496))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2499))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2495) .cse5 v_ArrVal_2497) .cse6 v_ArrVal_2498) .cse7 v_ArrVal_2500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2502) (select (select (store .cse8 .cse7 v_ArrVal_2501) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-10 17:27:57,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 17:27:57,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-10 17:27:58,435 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_25))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_24))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_22))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_26) .cse0 v_prenex_23) .cse1 v_prenex_21) .cse2 v_prenex_19) (select (select (store .cse3 .cse2 v_prenex_18) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_17))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2502 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|) (let ((.cse14 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2508))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2494))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2496))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2499))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2507) .cse7 v_ArrVal_2495) .cse8 v_ArrVal_2497) .cse9 v_ArrVal_2498) .cse10 v_ArrVal_2500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2502) (select (select (store .cse11 .cse10 v_ArrVal_2501) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-10 17:27:58,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505354484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:58,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:58,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2024-11-10 17:27:58,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866865704] [2024-11-10 17:27:58,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:58,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:27:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:27:58,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:27:58,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1014, Unknown=37, NotChecked=204, Total=1406 [2024-11-10 17:27:58,446 INFO L87 Difference]: Start difference. First operand 1670 states and 2117 transitions. Second operand has 26 states, 24 states have (on average 6.416666666666667) internal successors, (154), 24 states have internal predecessors, (154), 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)