./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:16:16,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:16:17,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:16:17,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:16:17,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:16:17,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:16:17,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:16:17,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:16:17,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:16:17,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:16:17,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:16:17,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:16:17,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:16:17,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:16:17,071 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:16:17,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:16:17,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:16:17,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:16:17,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:16:17,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:16:17,073 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:16:17,073 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:16:17,074 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:16:17,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:16:17,075 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:16:17,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:16:17,075 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:16:17,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:16:17,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:16:17,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:16:17,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:16:17,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:16:17,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:16:17,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:16:17,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:16:17,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:16:17,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:16:17,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:16:17,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:16:17,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:16:17,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:16:17,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:16:17,080 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2024-10-14 18:16:17,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:16:17,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:16:17,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:16:17,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:16:17,363 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:16:17,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-10-14 18:16:18,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:16:19,083 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:16:19,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-10-14 18:16:19,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/338a39e54/9003ff8c68ea4c14ae9ab99d3a32d0eb/FLAG8fc8011f1 [2024-10-14 18:16:19,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/338a39e54/9003ff8c68ea4c14ae9ab99d3a32d0eb [2024-10-14 18:16:19,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:16:19,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:16:19,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:16:19,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:16:19,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:16:19,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:19,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0ec775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19, skipping insertion in model container [2024-10-14 18:16:19,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:19,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:16:19,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:16:19,793 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:16:19,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:16:19,917 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:16:19,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19 WrapperNode [2024-10-14 18:16:19,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:16:19,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:16:19,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:16:19,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:16:19,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:19,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:19,971 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 126 [2024-10-14 18:16:19,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:16:19,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:16:19,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:16:19,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:16:19,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:19,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:19,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:20,019 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-10-14 18:16:20,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:20,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:20,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:20,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:20,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:20,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:20,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:16:20,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:16:20,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:16:20,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:16:20,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (1/1) ... [2024-10-14 18:16:20,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:16:20,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:20,087 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-10-14 18:16:20,094 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-10-14 18:16:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 18:16:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 18:16:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 18:16:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 18:16:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 18:16:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 18:16:20,147 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 18:16:20,147 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 18:16:20,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:16:20,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:16:20,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 18:16:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:16:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:16:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 18:16:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:16:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:16:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 18:16:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:16:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 18:16:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 18:16:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 18:16:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 18:16:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 18:16:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 18:16:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:16:20,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:16:20,318 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:16:20,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:16:20,632 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-14 18:16:20,633 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:16:20,688 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:16:20,692 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 18:16:20,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:16:20 BoogieIcfgContainer [2024-10-14 18:16:20,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:16:20,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:16:20,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:16:20,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:16:20,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:16:19" (1/3) ... [2024-10-14 18:16:20,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f27bfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:16:20, skipping insertion in model container [2024-10-14 18:16:20,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:16:19" (2/3) ... [2024-10-14 18:16:20,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f27bfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:16:20, skipping insertion in model container [2024-10-14 18:16:20,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:16:20" (3/3) ... [2024-10-14 18:16:20,705 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2024-10-14 18:16:20,722 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:16:20,723 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-10-14 18:16:20,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:16:20,780 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;@6bd3adba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:16:20,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-10-14 18:16:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 67 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 18:16:20,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:20,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 18:16:20,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:20,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1330367128, now seen corresponding path program 1 times [2024-10-14 18:16:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:20,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260426250] [2024-10-14 18:16:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:20,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:16:21,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260426250] [2024-10-14 18:16:21,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260426250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:21,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:16:21,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116063577] [2024-10-14 18:16:21,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:21,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:16:21,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:21,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:16:21,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:16:21,113 INFO L87 Difference]: Start difference. First operand has 71 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 67 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:16:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:21,213 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-10-14 18:16:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:16:21,218 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 18:16:21,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:21,226 INFO L225 Difference]: With dead ends: 68 [2024-10-14 18:16:21,226 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 18:16:21,228 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-10-14 18:16:21,232 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:21,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 18:16:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 18:16:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 34 states have (on average 2.0) internal successors, (68), 62 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-10-14 18:16:21,348 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 6 [2024-10-14 18:16:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:21,349 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-10-14 18:16:21,349 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:16:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-10-14 18:16:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 18:16:21,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:21,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 18:16:21,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:16:21,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:21,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:21,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1330367129, now seen corresponding path program 1 times [2024-10-14 18:16:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:21,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682201582] [2024-10-14 18:16:21,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:21,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:16:21,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682201582] [2024-10-14 18:16:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682201582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:21,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:21,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:16:21,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508874670] [2024-10-14 18:16:21,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:21,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:16:21,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:21,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:16:21,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:16:21,538 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:16:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:21,623 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-10-14 18:16:21,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:16:21,624 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 18:16:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:21,625 INFO L225 Difference]: With dead ends: 64 [2024-10-14 18:16:21,625 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 18:16:21,626 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-10-14 18:16:21,627 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:21,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 99 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 18:16:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 18:16:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 60 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-10-14 18:16:21,640 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 6 [2024-10-14 18:16:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:21,641 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-10-14 18:16:21,641 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:16:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-10-14 18:16:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:16:21,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:21,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:21,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:16:21,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:21,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash -654861783, now seen corresponding path program 1 times [2024-10-14 18:16:21,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:21,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421866806] [2024-10-14 18:16:21,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:21,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:21,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:16:21,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:21,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421866806] [2024-10-14 18:16:21,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421866806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:21,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:21,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:16:21,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981791722] [2024-10-14 18:16:21,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:21,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:16:21,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:21,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:16:21,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:16:21,925 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-14 18:16:22,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:22,122 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-10-14 18:16:22,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:16:22,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2024-10-14 18:16:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:22,125 INFO L225 Difference]: With dead ends: 63 [2024-10-14 18:16:22,126 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 18:16:22,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:16:22,127 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:22,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 211 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:16:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 18:16:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-14 18:16:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 1.911764705882353) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-10-14 18:16:22,138 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 10 [2024-10-14 18:16:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:22,139 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-10-14 18:16:22,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-14 18:16:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2024-10-14 18:16:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:16:22,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:22,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:22,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:16:22,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:22,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash -654861782, now seen corresponding path program 1 times [2024-10-14 18:16:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117416401] [2024-10-14 18:16:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:22,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:16:22,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:22,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117416401] [2024-10-14 18:16:22,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117416401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:22,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:22,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:16:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473307917] [2024-10-14 18:16:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:22,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:16:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:22,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:16:22,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:16:22,460 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-14 18:16:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:22,623 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2024-10-14 18:16:22,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:16:22,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2024-10-14 18:16:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:22,626 INFO L225 Difference]: With dead ends: 62 [2024-10-14 18:16:22,626 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 18:16:22,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:16:22,627 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:22,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:16:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 18:16:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-14 18:16:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 58 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-10-14 18:16:22,638 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 10 [2024-10-14 18:16:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:22,638 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-10-14 18:16:22,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-14 18:16:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-10-14 18:16:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:16:22,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:22,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:22,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:16:22,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:22,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1004517177, now seen corresponding path program 1 times [2024-10-14 18:16:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:22,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435083560] [2024-10-14 18:16:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:22,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 18:16:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:16:22,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:22,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435083560] [2024-10-14 18:16:22,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435083560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:22,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:22,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:16:22,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579738153] [2024-10-14 18:16:22,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:22,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:16:22,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:22,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:16:22,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:16:22,721 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-14 18:16:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:22,792 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-10-14 18:16:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:16:22,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2024-10-14 18:16:22,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:22,793 INFO L225 Difference]: With dead ends: 66 [2024-10-14 18:16:22,795 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 18:16:22,795 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-10-14 18:16:22,796 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:22,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 134 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 18:16:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-10-14 18:16:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-10-14 18:16:22,810 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 11 [2024-10-14 18:16:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:22,810 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-10-14 18:16:22,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-14 18:16:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2024-10-14 18:16:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:16:22,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:22,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:22,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 18:16:22,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:22,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1019483528, now seen corresponding path program 1 times [2024-10-14 18:16:22,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:22,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134544322] [2024-10-14 18:16:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 18:16:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:16:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:22,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134544322] [2024-10-14 18:16:22,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134544322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:22,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320061265] [2024-10-14 18:16:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:22,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:22,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:22,995 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-10-14 18:16:22,996 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-10-14 18:16:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:23,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:16:23,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:16:23,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:16:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:16:23,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320061265] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:16:23,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:16:23,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-10-14 18:16:23,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188444442] [2024-10-14 18:16:23,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:16:23,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:16:23,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:23,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:16:23,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:16:23,220 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:16:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:23,314 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-10-14 18:16:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:16:23,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-10-14 18:16:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:23,315 INFO L225 Difference]: With dead ends: 67 [2024-10-14 18:16:23,315 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 18:16:23,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:16:23,317 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:23,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 185 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 18:16:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-14 18:16:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 62 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-10-14 18:16:23,330 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 20 [2024-10-14 18:16:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:23,330 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-10-14 18:16:23,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:16:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-10-14 18:16:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:16:23,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:23,332 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:23,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 18:16:23,532 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,SelfDestructingSolverStorable5 [2024-10-14 18:16:23,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:23,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2097418727, now seen corresponding path program 2 times [2024-10-14 18:16:23,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:23,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787395375] [2024-10-14 18:16:23,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:23,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:24,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:16:24,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:24,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787395375] [2024-10-14 18:16:24,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787395375] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:24,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435680510] [2024-10-14 18:16:24,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:16:24,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:24,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:24,163 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-10-14 18:16:24,178 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-10-14 18:16:24,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:16:24,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:16:24,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 18:16:24,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:24,368 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-10-14 18:16:24,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:16:24,475 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:16:24,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 18:16:24,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:16:24,589 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:16:24,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 18:16:24,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:16:24,673 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-10-14 18:16:24,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:24,712 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-10-14 18:16:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 8 not checked. [2024-10-14 18:16:24,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:16:24,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435680510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:24,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:16:24,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-10-14 18:16:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50025825] [2024-10-14 18:16:24,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:16:24,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 18:16:24,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:24,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 18:16:24,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-10-14 18:16:24,799 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 17 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:16:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:25,153 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-10-14 18:16:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:16:25,154 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2024-10-14 18:16:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:25,155 INFO L225 Difference]: With dead ends: 77 [2024-10-14 18:16:25,155 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 18:16:25,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=308, Unknown=1, NotChecked=36, Total=420 [2024-10-14 18:16:25,156 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 210 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:25,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 222 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 306 Invalid, 0 Unknown, 75 Unchecked, 0.3s Time] [2024-10-14 18:16:25,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 18:16:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2024-10-14 18:16:25,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 58 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-10-14 18:16:25,162 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 29 [2024-10-14 18:16:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:25,162 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-10-14 18:16:25,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:16:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-10-14 18:16:25,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:16:25,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:25,163 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:25,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 18:16:25,364 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,SelfDestructingSolverStorable6 [2024-10-14 18:16:25,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:25,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:25,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2097418728, now seen corresponding path program 1 times [2024-10-14 18:16:25,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650629174] [2024-10-14 18:16:25,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:25,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:25,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:26,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:16:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:26,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650629174] [2024-10-14 18:16:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650629174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:26,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785988042] [2024-10-14 18:16:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:26,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:26,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:26,122 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-10-14 18:16:26,124 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-10-14 18:16:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:26,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 18:16:26,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:26,302 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-10-14 18:16:26,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:16:26,350 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-14 18:16:26,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:26,388 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-10-14 18:16:26,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:16:26,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:26,463 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-10-14 18:16:26,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:16:26,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:26,544 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-10-14 18:16:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:16:26,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:16:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785988042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:26,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:16:26,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-14 18:16:26,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814124630] [2024-10-14 18:16:26,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:26,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:16:26,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:26,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:16:26,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-10-14 18:16:26,553 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:26,641 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-10-14 18:16:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:16:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-14 18:16:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:26,642 INFO L225 Difference]: With dead ends: 64 [2024-10-14 18:16:26,642 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 18:16:26,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-10-14 18:16:26,643 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:26,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 136 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2024-10-14 18:16:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 18:16:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-10-14 18:16:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.631578947368421) internal successors, (62), 56 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-10-14 18:16:26,648 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 29 [2024-10-14 18:16:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:26,649 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-10-14 18:16:26,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-10-14 18:16:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 18:16:26,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:26,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:26,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 18:16:26,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:26,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:26,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1279868691, now seen corresponding path program 1 times [2024-10-14 18:16:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:26,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265519585] [2024-10-14 18:16:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:26,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:27,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:16:27,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:27,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265519585] [2024-10-14 18:16:27,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265519585] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:27,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132371320] [2024-10-14 18:16:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:27,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:27,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:27,247 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-10-14 18:16:27,248 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-10-14 18:16:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:27,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 18:16:27,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:27,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:16:27,600 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-14 18:16:27,624 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-14 18:16:27,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-10-14 18:16:27,662 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 17 treesize of output 9 [2024-10-14 18:16:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:16:27,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:16:27,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132371320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:27,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:16:27,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-10-14 18:16:27,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247027258] [2024-10-14 18:16:27,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:27,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:16:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:27,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:16:27,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=205, Unknown=1, NotChecked=28, Total=272 [2024-10-14 18:16:27,669 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-10-14 18:16:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:27,779 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2024-10-14 18:16:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:16:27,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 31 [2024-10-14 18:16:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:27,783 INFO L225 Difference]: With dead ends: 77 [2024-10-14 18:16:27,783 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 18:16:27,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2024-10-14 18:16:27,785 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 37 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:27,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 166 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2024-10-14 18:16:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 18:16:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2024-10-14 18:16:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.65) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-10-14 18:16:27,795 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 31 [2024-10-14 18:16:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:27,796 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-10-14 18:16:27,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-10-14 18:16:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-10-14 18:16:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 18:16:27,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:27,797 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:27,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 18:16:27,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:27,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:27,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:27,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1279868692, now seen corresponding path program 1 times [2024-10-14 18:16:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:27,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800060744] [2024-10-14 18:16:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:28,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:16:28,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800060744] [2024-10-14 18:16:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800060744] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795799438] [2024-10-14 18:16:28,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:28,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:28,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:28,489 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-10-14 18:16:28,490 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-10-14 18:16:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:28,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-14 18:16:28,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:28,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 8 treesize of output 1 [2024-10-14 18:16:28,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:16:28,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:16:28,987 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4| Int)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) 0))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-10-14 18:16:29,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:29,025 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 18 treesize of output 13 [2024-10-14 18:16:29,039 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:16:29,040 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 15 treesize of output 15 [2024-10-14 18:16:29,091 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 17 treesize of output 9 [2024-10-14 18:16:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2024-10-14 18:16:29,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:16:29,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795799438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:29,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:16:29,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-10-14 18:16:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276827334] [2024-10-14 18:16:29,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:16:29,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 18:16:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:29,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 18:16:29,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=538, Unknown=1, NotChecked=46, Total=650 [2024-10-14 18:16:29,322 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 23 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:16:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:30,055 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-14 18:16:30,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 18:16:30,056 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2024-10-14 18:16:30,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:30,056 INFO L225 Difference]: With dead ends: 82 [2024-10-14 18:16:30,056 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 18:16:30,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=1330, Unknown=1, NotChecked=74, Total=1560 [2024-10-14 18:16:30,058 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 122 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:30,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 450 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 520 Invalid, 0 Unknown, 85 Unchecked, 0.4s Time] [2024-10-14 18:16:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 18:16:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2024-10-14 18:16:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2024-10-14 18:16:30,062 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 31 [2024-10-14 18:16:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:30,063 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-10-14 18:16:30,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:16:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2024-10-14 18:16:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:16:30,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:30,064 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:30,081 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-10-14 18:16:30,265 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,SelfDestructingSolverStorable9 [2024-10-14 18:16:30,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:30,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:30,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1021222134, now seen corresponding path program 1 times [2024-10-14 18:16:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:30,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592685043] [2024-10-14 18:16:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:16:30,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:30,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592685043] [2024-10-14 18:16:30,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592685043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:30,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:30,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:16:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310123230] [2024-10-14 18:16:30,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:30,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:16:30,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:30,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:16:30,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:16:30,358 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:30,419 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-10-14 18:16:30,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:16:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-14 18:16:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:30,421 INFO L225 Difference]: With dead ends: 69 [2024-10-14 18:16:30,421 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 18:16:30,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10-14 18:16:30,422 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:30,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 18:16:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-14 18:16:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-10-14 18:16:30,426 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 32 [2024-10-14 18:16:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:30,426 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-10-14 18:16:30,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-10-14 18:16:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 18:16:30,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:30,428 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:30,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 18:16:30,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:30,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1593120071, now seen corresponding path program 1 times [2024-10-14 18:16:30,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:30,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393268021] [2024-10-14 18:16:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:30,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 18:16:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393268021] [2024-10-14 18:16:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393268021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:30,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:30,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:16:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383181023] [2024-10-14 18:16:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:30,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:16:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:30,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:16:30,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:16:30,608 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:30,752 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-10-14 18:16:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:16:30,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 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 33 [2024-10-14 18:16:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:30,754 INFO L225 Difference]: With dead ends: 68 [2024-10-14 18:16:30,754 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 18:16:30,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:16:30,755 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:30,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 181 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 18:16:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-14 18:16:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2024-10-14 18:16:30,760 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 33 [2024-10-14 18:16:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:30,760 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-10-14 18:16:30,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2024-10-14 18:16:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 18:16:30,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:30,761 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:30,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 18:16:30,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:30,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1593120072, now seen corresponding path program 1 times [2024-10-14 18:16:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:30,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842964001] [2024-10-14 18:16:30,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:30,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:30,904 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:16:30,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:30,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842964001] [2024-10-14 18:16:30,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842964001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:30,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:30,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:16:30,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695831928] [2024-10-14 18:16:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:30,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:16:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:30,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:16:30,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:16:30,907 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:30,983 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-10-14 18:16:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:16:30,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-14 18:16:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:30,984 INFO L225 Difference]: With dead ends: 71 [2024-10-14 18:16:30,984 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 18:16:30,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-10-14 18:16:30,985 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 35 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:30,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 139 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 18:16:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-10-14 18:16:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 61 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-10-14 18:16:30,993 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 33 [2024-10-14 18:16:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:30,994 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-10-14 18:16:30,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-10-14 18:16:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 18:16:30,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:30,995 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:30,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 18:16:30,995 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:30,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1593281004, now seen corresponding path program 1 times [2024-10-14 18:16:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:30,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104672817] [2024-10-14 18:16:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:30,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:16:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:31,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104672817] [2024-10-14 18:16:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104672817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:16:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547695185] [2024-10-14 18:16:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:31,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:16:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:31,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:16:31,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:16:31,153 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:31,226 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-10-14 18:16:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:16:31,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-14 18:16:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:31,227 INFO L225 Difference]: With dead ends: 68 [2024-10-14 18:16:31,227 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 18:16:31,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:16:31,228 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:31,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 136 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 18:16:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2024-10-14 18:16:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 58 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2024-10-14 18:16:31,232 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 33 [2024-10-14 18:16:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:31,232 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2024-10-14 18:16:31,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2024-10-14 18:16:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:16:31,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:31,233 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:31,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 18:16:31,233 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:31,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:31,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2147069245, now seen corresponding path program 1 times [2024-10-14 18:16:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:31,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071521482] [2024-10-14 18:16:31,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:16:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071521482] [2024-10-14 18:16:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071521482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:31,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:31,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:16:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140851992] [2024-10-14 18:16:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:31,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:16:31,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:31,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:16:31,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:16:31,328 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:31,399 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2024-10-14 18:16:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:16:31,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-14 18:16:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:31,400 INFO L225 Difference]: With dead ends: 63 [2024-10-14 18:16:31,400 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 18:16:31,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:16:31,401 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:31,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 18:16:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-14 18:16:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.441860465116279) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2024-10-14 18:16:31,404 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 34 [2024-10-14 18:16:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:31,405 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2024-10-14 18:16:31,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2024-10-14 18:16:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:16:31,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:31,405 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:31,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 18:16:31,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:31,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2147069246, now seen corresponding path program 1 times [2024-10-14 18:16:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:31,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817864320] [2024-10-14 18:16:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:16:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817864320] [2024-10-14 18:16:31,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817864320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938602243] [2024-10-14 18:16:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:31,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:31,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:31,699 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-10-14 18:16:31,701 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-10-14 18:16:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:31,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:16:31,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:31,900 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 7 treesize of output 3 [2024-10-14 18:16:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:16:31,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:16:31,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938602243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:31,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:16:31,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2024-10-14 18:16:31,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717765959] [2024-10-14 18:16:31,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:31,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:16:31,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:31,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:16:31,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:16:31,945 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:31,993 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-10-14 18:16:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:16:31,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-14 18:16:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:31,995 INFO L225 Difference]: With dead ends: 62 [2024-10-14 18:16:31,995 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 18:16:31,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:16:31,996 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:31,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:16:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 18:16:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-14 18:16:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 56 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-10-14 18:16:32,001 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 34 [2024-10-14 18:16:32,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:32,002 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-10-14 18:16:32,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-10-14 18:16:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 18:16:32,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:32,002 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:32,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 18:16:32,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 18:16:32,203 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:32,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2134637185, now seen corresponding path program 1 times [2024-10-14 18:16:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:32,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842185647] [2024-10-14 18:16:32,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:32,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:32,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:32,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:32,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 18:16:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842185647] [2024-10-14 18:16:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842185647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:32,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:32,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:16:32,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427371114] [2024-10-14 18:16:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:32,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:16:32,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:16:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:16:32,441 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:32,535 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2024-10-14 18:16:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:16:32,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 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 35 [2024-10-14 18:16:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:32,536 INFO L225 Difference]: With dead ends: 61 [2024-10-14 18:16:32,536 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 18:16:32,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:16:32,537 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:32,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:32,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 18:16:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-14 18:16:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-10-14 18:16:32,540 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 35 [2024-10-14 18:16:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:32,541 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-10-14 18:16:32,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-10-14 18:16:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 18:16:32,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:32,541 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:32,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 18:16:32,542 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:32,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1749246771, now seen corresponding path program 1 times [2024-10-14 18:16:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:32,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716536529] [2024-10-14 18:16:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:32,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:32,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 18:16:32,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:32,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716536529] [2024-10-14 18:16:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716536529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:32,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:32,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:16:32,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928505824] [2024-10-14 18:16:32,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:32,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:16:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:32,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:16:32,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:16:32,763 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:32,834 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-10-14 18:16:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:16:32,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-10-14 18:16:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:32,835 INFO L225 Difference]: With dead ends: 60 [2024-10-14 18:16:32,836 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 18:16:32,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:16:32,836 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 45 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:32,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 110 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 18:16:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-10-14 18:16:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-10-14 18:16:32,839 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 36 [2024-10-14 18:16:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:32,839 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-10-14 18:16:32,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-10-14 18:16:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:16:32,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:32,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:32,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 18:16:32,840 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:32,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:32,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1694035612, now seen corresponding path program 1 times [2024-10-14 18:16:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:32,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206340218] [2024-10-14 18:16:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:32,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:32,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:32,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:33,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:16:33,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:33,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206340218] [2024-10-14 18:16:33,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206340218] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:33,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740783883] [2024-10-14 18:16:33,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:33,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:33,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:33,020 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-10-14 18:16:33,021 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-10-14 18:16:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:33,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 18:16:33,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:33,235 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-10-14 18:16:33,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:16:33,316 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-14 18:16:33,361 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-14 18:16:33,361 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 23 treesize of output 24 [2024-10-14 18:16:33,383 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 17 treesize of output 9 [2024-10-14 18:16:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-10-14 18:16:33,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:16:33,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740783883] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:33,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:16:33,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 13 [2024-10-14 18:16:33,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104670036] [2024-10-14 18:16:33,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:16:33,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 18:16:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:33,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 18:16:33,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=156, Unknown=1, NotChecked=24, Total=210 [2024-10-14 18:16:33,459 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:16:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:33,778 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-10-14 18:16:33,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:16:33,779 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-10-14 18:16:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:33,779 INFO L225 Difference]: With dead ends: 75 [2024-10-14 18:16:33,780 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 18:16:33,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=363, Unknown=1, NotChecked=38, Total=462 [2024-10-14 18:16:33,780 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:33,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 256 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2024-10-14 18:16:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 18:16:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2024-10-14 18:16:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-10-14 18:16:33,783 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 38 [2024-10-14 18:16:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:33,784 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-10-14 18:16:33,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:16:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-10-14 18:16:33,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:16:33,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:33,784 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:33,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 18:16:33,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:33,985 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1694035613, now seen corresponding path program 1 times [2024-10-14 18:16:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:33,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764997899] [2024-10-14 18:16:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:33,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:34,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:16:34,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:34,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764997899] [2024-10-14 18:16:34,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764997899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:34,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958195891] [2024-10-14 18:16:34,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:34,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:34,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:34,431 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-10-14 18:16:34,433 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-10-14 18:16:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:34,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-14 18:16:34,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:34,672 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-10-14 18:16:34,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:16:34,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:16:35,070 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:16:35,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-14 18:16:35,095 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:16:35,095 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 15 treesize of output 15 [2024-10-14 18:16:35,329 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 17 treesize of output 9 [2024-10-14 18:16:35,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:16:35,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 32 [2024-10-14 18:16:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 18:16:35,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:16:35,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958195891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:35,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:16:35,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2024-10-14 18:16:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699977305] [2024-10-14 18:16:35,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:16:35,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 18:16:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:35,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 18:16:35,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2024-10-14 18:16:35,621 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 26 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:16:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:36,636 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2024-10-14 18:16:36,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 18:16:36,637 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-10-14 18:16:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:36,638 INFO L225 Difference]: With dead ends: 76 [2024-10-14 18:16:36,638 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 18:16:36,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=1802, Unknown=0, NotChecked=0, Total=1980 [2024-10-14 18:16:36,639 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 62 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:36,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 567 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 18:16:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 18:16:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2024-10-14 18:16:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-10-14 18:16:36,642 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 38 [2024-10-14 18:16:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:36,642 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-10-14 18:16:36,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:16:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2024-10-14 18:16:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:16:36,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:36,643 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:36,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 18:16:36,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:36,844 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:36,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1841798972, now seen corresponding path program 1 times [2024-10-14 18:16:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110764840] [2024-10-14 18:16:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:37,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:37,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:37,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:16:37,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110764840] [2024-10-14 18:16:37,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110764840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675772099] [2024-10-14 18:16:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:37,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:37,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:37,164 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-10-14 18:16:37,166 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-10-14 18:16:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:37,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 18:16:37,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:37,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:16:37,452 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 17 treesize of output 9 [2024-10-14 18:16:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 18:16:37,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:16:37,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675772099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:37,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:16:37,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-14 18:16:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673047523] [2024-10-14 18:16:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:37,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:16:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:16:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-10-14 18:16:37,472 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:37,559 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-10-14 18:16:37,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:16:37,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-14 18:16:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:37,560 INFO L225 Difference]: With dead ends: 78 [2024-10-14 18:16:37,560 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 18:16:37,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-10-14 18:16:37,561 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:37,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 184 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 18:16:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2024-10-14 18:16:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.34) internal successors, (67), 59 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2024-10-14 18:16:37,564 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 38 [2024-10-14 18:16:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:37,564 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2024-10-14 18:16:37,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-10-14 18:16:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:16:37,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:37,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:37,583 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-10-14 18:16:37,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:37,766 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:37,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:37,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1841798973, now seen corresponding path program 1 times [2024-10-14 18:16:37,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:37,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59361087] [2024-10-14 18:16:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:37,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:38,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:16:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59361087] [2024-10-14 18:16:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59361087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755963449] [2024-10-14 18:16:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:38,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:38,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:38,026 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-10-14 18:16:38,027 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-10-14 18:16:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:38,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 18:16:38,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:38,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:16:38,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:16:38,338 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 23 treesize of output 15 [2024-10-14 18:16:38,341 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 28 treesize of output 16 [2024-10-14 18:16:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 18:16:38,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:16:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755963449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:38,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:16:38,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-14 18:16:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143536483] [2024-10-14 18:16:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:38,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:16:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:38,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:16:38,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-10-14 18:16:38,366 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:38,473 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2024-10-14 18:16:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:16:38,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-14 18:16:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:38,474 INFO L225 Difference]: With dead ends: 78 [2024-10-14 18:16:38,474 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 18:16:38,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-10-14 18:16:38,475 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 20 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:38,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 197 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 18:16:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2024-10-14 18:16:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.32) internal successors, (66), 59 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-10-14 18:16:38,478 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 38 [2024-10-14 18:16:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:38,478 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-10-14 18:16:38,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-10-14 18:16:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 18:16:38,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:38,479 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:38,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 18:16:38,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 18:16:38,684 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:38,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:38,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1261195971, now seen corresponding path program 1 times [2024-10-14 18:16:38,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:38,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068878197] [2024-10-14 18:16:38,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:38,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:38,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:38,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:16:38,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068878197] [2024-10-14 18:16:38,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068878197] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:38,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090304366] [2024-10-14 18:16:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:38,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:38,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:38,971 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:16:38,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 18:16:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:39,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 18:16:39,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:39,328 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 15 treesize of output 1 [2024-10-14 18:16:39,348 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 15 treesize of output 7 [2024-10-14 18:16:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 18:16:39,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:16:39,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090304366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:39,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:16:39,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2024-10-14 18:16:39,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888152350] [2024-10-14 18:16:39,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:39,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:16:39,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:16:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2024-10-14 18:16:39,389 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 10 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:39,511 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2024-10-14 18:16:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:16:39,512 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 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 39 [2024-10-14 18:16:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:39,512 INFO L225 Difference]: With dead ends: 79 [2024-10-14 18:16:39,512 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 18:16:39,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2024-10-14 18:16:39,513 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:39,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 299 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 18:16:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2024-10-14 18:16:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-10-14 18:16:39,516 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 39 [2024-10-14 18:16:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:39,517 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-10-14 18:16:39,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:16:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-10-14 18:16:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 18:16:39,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:39,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:39,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 18:16:39,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-14 18:16:39,719 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:39,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1148038422, now seen corresponding path program 1 times [2024-10-14 18:16:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:39,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108473538] [2024-10-14 18:16:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:39,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:39,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:16:39,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:39,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108473538] [2024-10-14 18:16:39,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108473538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:39,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412207453] [2024-10-14 18:16:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:39,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:39,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:39,903 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:16:39,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 18:16:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:40,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:16:40,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 18:16:40,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:16:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412207453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:40,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:16:40,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-10-14 18:16:40,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903417167] [2024-10-14 18:16:40,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:16:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:40,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:16:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-14 18:16:40,205 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:40,238 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-10-14 18:16:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:16:40,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-10-14 18:16:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:40,240 INFO L225 Difference]: With dead ends: 71 [2024-10-14 18:16:40,240 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 18:16:40,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-14 18:16:40,241 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:40,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 102 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:16:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 18:16:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2024-10-14 18:16:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-10-14 18:16:40,245 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 41 [2024-10-14 18:16:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:40,246 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-10-14 18:16:40,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:16:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-10-14 18:16:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 18:16:40,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:40,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:40,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-14 18:16:40,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-14 18:16:40,447 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:16:40,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1147942992, now seen corresponding path program 1 times [2024-10-14 18:16:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56067968] [2024-10-14 18:16:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:40,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:40,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:16:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:16:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:40,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:16:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:16:40,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:40,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56067968] [2024-10-14 18:16:40,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56067968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:40,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322812916] [2024-10-14 18:16:40,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:40,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:40,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:40,634 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:16:40,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 18:16:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:40,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 18:16:40,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:40,939 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 16 treesize of output 8 [2024-10-14 18:16:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 18:16:40,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:16:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:16:40,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322812916] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:16:40,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:16:40,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2024-10-14 18:16:40,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066627987] [2024-10-14 18:16:40,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:16:40,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:16:40,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:40,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:16:40,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:16:40,992 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:16:44,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:16:49,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:16:53,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:16:57,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:17:01,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:17:05,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:17:09,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:17:13,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:17:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:13,237 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-10-14 18:17:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 18:17:13,238 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-10-14 18:17:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:13,238 INFO L225 Difference]: With dead ends: 93 [2024-10-14 18:17:13,238 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 18:17:13,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-14 18:17:13,239 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:17:13,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 375 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 8 Unknown, 0 Unchecked, 32.2s Time] [2024-10-14 18:17:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 18:17:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2024-10-14 18:17:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.3) internal successors, (65), 59 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:17:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-10-14 18:17:13,246 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 41 [2024-10-14 18:17:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:13,247 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-10-14 18:17:13,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:17:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-10-14 18:17:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 18:17:13,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:13,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:13,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 18:17:13,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-14 18:17:13,452 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:17:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:13,453 INFO L85 PathProgramCache]: Analyzing trace with hash 824722352, now seen corresponding path program 1 times [2024-10-14 18:17:13,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:13,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510154335] [2024-10-14 18:17:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:17:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:17:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:13,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:17:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:17:13,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:13,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510154335] [2024-10-14 18:17:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510154335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630214821] [2024-10-14 18:17:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:13,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:13,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:13,718 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:13,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 18:17:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:13,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 18:17:13,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:14,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:17:14,085 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 16 treesize of output 8 [2024-10-14 18:17:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 18:17:14,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:17:14,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630214821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:14,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:17:14,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2024-10-14 18:17:14,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058034422] [2024-10-14 18:17:14,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:14,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:17:14,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:14,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:17:14,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-10-14 18:17:14,102 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:17:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:14,252 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2024-10-14 18:17:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:17:14,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 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 41 [2024-10-14 18:17:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:14,257 INFO L225 Difference]: With dead ends: 79 [2024-10-14 18:17:14,257 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 18:17:14,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-10-14 18:17:14,258 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:17:14,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 302 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:17:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 18:17:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2024-10-14 18:17:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:17:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-10-14 18:17:14,266 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 41 [2024-10-14 18:17:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:14,266 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-10-14 18:17:14,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:17:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-10-14 18:17:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:17:14,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:14,267 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:14,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-14 18:17:14,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:14,468 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:17:14,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:14,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1345199321, now seen corresponding path program 1 times [2024-10-14 18:17:14,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:14,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586561113] [2024-10-14 18:17:14,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:15,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:17:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:17:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:17:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:17:16,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586561113] [2024-10-14 18:17:16,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586561113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974542987] [2024-10-14 18:17:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:16,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:16,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:16,298 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:16,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 18:17:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:16,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-14 18:17:16,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:16,700 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:17:16,700 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-10-14 18:17:16,789 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-10-14 18:17:16,889 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 14 [2024-10-14 18:17:16,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:17:17,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:17,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-10-14 18:17:17,167 INFO L349 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2024-10-14 18:17:17,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2024-10-14 18:17:17,429 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-10-14 18:17:17,429 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 1 case distinctions, treesize of input 73 treesize of output 60 [2024-10-14 18:17:17,588 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-14 18:17:17,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 98 [2024-10-14 18:17:17,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:17:17,806 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 164 treesize of output 116 [2024-10-14 18:17:17,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:17,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 129 treesize of output 105 [2024-10-14 18:17:17,994 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 93 treesize of output 51 [2024-10-14 18:17:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:17:18,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:17:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974542987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:23,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:17:23,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 47 [2024-10-14 18:17:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875468640] [2024-10-14 18:17:23,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:17:23,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-14 18:17:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:23,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-14 18:17:23,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2791, Unknown=2, NotChecked=0, Total=2970 [2024-10-14 18:17:23,017 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 48 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:17:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:25,392 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-10-14 18:17:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 18:17:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2024-10-14 18:17:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:25,393 INFO L225 Difference]: With dead ends: 89 [2024-10-14 18:17:25,393 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 18:17:25,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=439, Invalid=5721, Unknown=2, NotChecked=0, Total=6162 [2024-10-14 18:17:25,395 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 95 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 18:17:25,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 637 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 18:17:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 18:17:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2024-10-14 18:17:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:17:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-10-14 18:17:25,398 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 42 [2024-10-14 18:17:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:25,398 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-10-14 18:17:25,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:17:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-10-14 18:17:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:17:25,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:25,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:25,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 18:17:25,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 18:17:25,600 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:17:25,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1345199322, now seen corresponding path program 1 times [2024-10-14 18:17:25,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:25,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045752429] [2024-10-14 18:17:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:25,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:17:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:26,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:17:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:26,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 18:17:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:17:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045752429] [2024-10-14 18:17:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045752429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589063871] [2024-10-14 18:17:27,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:27,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:27,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:27,205 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:27,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-14 18:17:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:27,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-14 18:17:27,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:27,491 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-10-14 18:17:27,796 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:17:27,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 18:17:27,819 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 18:17:27,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 18:17:27,962 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-10-14 18:17:27,967 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-10-14 18:17:28,119 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 61 treesize of output 19 [2024-10-14 18:17:28,123 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 17 treesize of output 3 [2024-10-14 18:17:28,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:17:28,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:17:28,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:28,418 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 69 treesize of output 52 [2024-10-14 18:17:28,433 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-10-14 18:17:28,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-10-14 18:17:28,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2024-10-14 18:17:28,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-14 18:17:28,746 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-10-14 18:17:28,747 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 1 case distinctions, treesize of input 73 treesize of output 60 [2024-10-14 18:17:28,766 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2024-10-14 18:17:28,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2024-10-14 18:17:29,000 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-14 18:17:29,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 129 [2024-10-14 18:17:29,018 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-14 18:17:29,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 162 [2024-10-14 18:17:29,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:17:29,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:17:29,532 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 392 treesize of output 296 [2024-10-14 18:17:29,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:29,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 309 treesize of output 253 [2024-10-14 18:17:29,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:29,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 232 treesize of output 166 [2024-10-14 18:17:29,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:29,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 136 treesize of output 136 [2024-10-14 18:17:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:17:31,604 INFO L311 TraceCheckSpWp]: Computing backward predicates...