./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-ext3-properties/dll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:19:17,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:19:17,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:19:17,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:19:17,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:19:17,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:19:17,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:19:17,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:19:17,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:19:17,337 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:19:17,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:19:17,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:19:17,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:19:17,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:19:17,342 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:19:17,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:19:17,343 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:19:17,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:19:17,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:19:17,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:19:17,344 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:19:17,348 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:19:17,348 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:19:17,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:19:17,349 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:19:17,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:19:17,350 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:19:17,350 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:19:17,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:19:17,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:19:17,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:19:17,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:19:17,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:19:17,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:19:17,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:19:17,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:19:17,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:19:17,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:19:17,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:19:17,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:19:17,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:19:17,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:19:17,358 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-clean/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-clean/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 -> 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa [2024-10-11 18:19:17,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:19:17,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:19:17,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:19:17,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:19:17,679 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:19:17,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2024-10-11 18:19:19,223 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:19:19,491 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:19:19,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2024-10-11 18:19:19,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d3dffed3/a67082b0d1084327b6f5d360dbea212e/FLAG88246f595 [2024-10-11 18:19:19,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d3dffed3/a67082b0d1084327b6f5d360dbea212e [2024-10-11 18:19:19,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:19:19,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:19:19,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:19:19,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:19:19,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:19:19,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:19:19" (1/1) ... [2024-10-11 18:19:19,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526e97b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:19, skipping insertion in model container [2024-10-11 18:19:19,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:19:19" (1/1) ... [2024-10-11 18:19:19,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:19:19,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:19:19,950 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:19:20,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:19:20,039 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:19:20,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20 WrapperNode [2024-10-11 18:19:20,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:19:20,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:19:20,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:19:20,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:19:20,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,083 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-10-11 18:19:20,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:19:20,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:19:20,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:19:20,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:19:20,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,116 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-10-11 18:19:20,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:19:20,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:19:20,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:19:20,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:19:20,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (1/1) ... [2024-10-11 18:19:20,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:19:20,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:20,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:19:20,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:19:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 18:19:20,243 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 18:19:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:19:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:19:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:19:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:19:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:19:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:19:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:19:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:19:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:19:20,384 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:19:20,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:19:20,419 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 18:19:20,433 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 18:19:20,716 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2024-10-11 18:19:20,717 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2024-10-11 18:19:20,717 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2024-10-11 18:19:20,717 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2024-10-11 18:19:20,717 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2024-10-11 18:19:20,736 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-11 18:19:20,737 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:19:20,778 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:19:20,779 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 18:19:20,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:19:20 BoogieIcfgContainer [2024-10-11 18:19:20,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:19:20,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:19:20,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:19:20,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:19:20,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:19:19" (1/3) ... [2024-10-11 18:19:20,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3da5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:19:20, skipping insertion in model container [2024-10-11 18:19:20,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:20" (2/3) ... [2024-10-11 18:19:20,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3da5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:19:20, skipping insertion in model container [2024-10-11 18:19:20,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:19:20" (3/3) ... [2024-10-11 18:19:20,797 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2024-10-11 18:19:20,816 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:19:20,816 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2024-10-11 18:19:20,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:19:20,866 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;@5b3ceaa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:19:20,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-10-11 18:19:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 64 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:19:20,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:20,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:19:20,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash 172438, now seen corresponding path program 1 times [2024-10-11 18:19:20,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:20,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975101066] [2024-10-11 18:19:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:21,116 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-11 18:19:21,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:21,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975101066] [2024-10-11 18:19:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975101066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:21,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:19:21,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177101618] [2024-10-11 18:19:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:21,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:21,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:21,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:21,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:21,163 INFO L87 Difference]: Start difference. First operand has 66 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 64 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:21,313 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2024-10-11 18:19:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:21,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 18:19:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:21,323 INFO L225 Difference]: With dead ends: 62 [2024-10-11 18:19:21,323 INFO L226 Difference]: Without dead ends: 57 [2024-10-11 18:19:21,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11 18:19:21,329 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:21,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 67 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:21,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-11 18:19:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-11 18:19:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 2.103448275862069) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-10-11 18:19:21,409 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 3 [2024-10-11 18:19:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:21,410 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-10-11 18:19:21,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-10-11 18:19:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:19:21,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:21,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:19:21,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:19:21,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:21,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash 172439, now seen corresponding path program 1 times [2024-10-11 18:19:21,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:21,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353507826] [2024-10-11 18:19:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:21,616 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-11 18:19:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:21,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353507826] [2024-10-11 18:19:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353507826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:19:21,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367854371] [2024-10-11 18:19:21,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:21,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:21,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:21,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:21,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:21,624 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:21,711 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2024-10-11 18:19:21,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:21,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 18:19:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:21,713 INFO L225 Difference]: With dead ends: 53 [2024-10-11 18:19:21,713 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 18:19:21,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11 18:19:21,715 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:21,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 18:19:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 18:19:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-10-11 18:19:21,723 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 3 [2024-10-11 18:19:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:21,724 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-11 18:19:21,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-10-11 18:19:21,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:19:21,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:21,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:21,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:19:21,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:21,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1828434129, now seen corresponding path program 1 times [2024-10-11 18:19:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:21,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908231859] [2024-10-11 18:19:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:21,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:21,866 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-11 18:19:21,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:21,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908231859] [2024-10-11 18:19:21,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908231859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:21,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:21,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:19:21,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547832758] [2024-10-11 18:19:21,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:21,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:21,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:21,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:21,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:21,869 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:21,943 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-10-11 18:19:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:21,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:19:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:21,944 INFO L225 Difference]: With dead ends: 51 [2024-10-11 18:19:21,944 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 18:19:21,945 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-11 18:19:21,946 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 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-11 18:19:21,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 18:19:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 18:19:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-10-11 18:19:21,955 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 8 [2024-10-11 18:19:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:21,955 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-10-11 18:19:21,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-10-11 18:19:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:19:21,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:21,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:21,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:19:21,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:21,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:21,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1828434130, now seen corresponding path program 1 times [2024-10-11 18:19:21,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:21,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902353828] [2024-10-11 18:19:21,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:22,089 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-11 18:19:22,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:22,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902353828] [2024-10-11 18:19:22,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902353828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:22,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:22,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:19:22,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678053703] [2024-10-11 18:19:22,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:22,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:22,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:22,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:22,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:22,092 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:22,153 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-10-11 18:19:22,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:22,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:19:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:22,157 INFO L225 Difference]: With dead ends: 49 [2024-10-11 18:19:22,157 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 18:19:22,157 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-11 18:19:22,158 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:22,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 18:19:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 18:19:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2024-10-11 18:19:22,167 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 8 [2024-10-11 18:19:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:22,167 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-10-11 18:19:22,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-10-11 18:19:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:19:22,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:22,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:22,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:19:22,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:22,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1828432688, now seen corresponding path program 1 times [2024-10-11 18:19:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067671510] [2024-10-11 18:19:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:22,230 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-11 18:19:22,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:22,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067671510] [2024-10-11 18:19:22,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067671510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:22,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:22,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:19:22,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728965811] [2024-10-11 18:19:22,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:22,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:22,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:22,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:22,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:22,233 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:22,259 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-10-11 18:19:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:19:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:22,261 INFO L225 Difference]: With dead ends: 56 [2024-10-11 18:19:22,261 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 18:19:22,262 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-11 18:19:22,263 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:22,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 86 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:19:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 18:19:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-10-11 18:19:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.8) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-10-11 18:19:22,276 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 8 [2024-10-11 18:19:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:22,276 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-11 18:19:22,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-10-11 18:19:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:19:22,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:22,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:22,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:19:22,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:22,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:22,282 INFO L85 PathProgramCache]: Analyzing trace with hash 483574356, now seen corresponding path program 1 times [2024-10-11 18:19:22,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:22,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209444287] [2024-10-11 18:19:22,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:22,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:22,454 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-11 18:19:22,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:22,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209444287] [2024-10-11 18:19:22,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209444287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:22,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:22,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:19:22,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844603343] [2024-10-11 18:19:22,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:22,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:19:22,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:22,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:19:22,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:19:22,457 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:22,549 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-10-11 18:19:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:19:22,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 18:19:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:22,551 INFO L225 Difference]: With dead ends: 54 [2024-10-11 18:19:22,551 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 18:19:22,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:19:22,552 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:22,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 79 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 18:19:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 18:19:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2024-10-11 18:19:22,564 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 10 [2024-10-11 18:19:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:22,565 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2024-10-11 18:19:22,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-10-11 18:19:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:19:22,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:22,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:22,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:19:22,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:22,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:22,569 INFO L85 PathProgramCache]: Analyzing trace with hash 483574357, now seen corresponding path program 1 times [2024-10-11 18:19:22,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:22,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900173359] [2024-10-11 18:19:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:22,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:22,809 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-11 18:19:22,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:22,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900173359] [2024-10-11 18:19:22,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900173359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:22,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:22,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:19:22,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338109823] [2024-10-11 18:19:22,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:22,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:19:22,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:22,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:19:22,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:19:22,813 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:22,923 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-10-11 18:19:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:19:22,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 18:19:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:22,924 INFO L225 Difference]: With dead ends: 54 [2024-10-11 18:19:22,924 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 18:19:22,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:19:22,925 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:22,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 102 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 18:19:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 18:19:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-11 18:19:22,932 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2024-10-11 18:19:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:22,932 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-11 18:19:22,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-11 18:19:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:19:22,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:22,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:22,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:19:22,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:22,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:22,935 INFO L85 PathProgramCache]: Analyzing trace with hash 846250062, now seen corresponding path program 1 times [2024-10-11 18:19:22,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:22,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517291050] [2024-10-11 18:19:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:23,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:23,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517291050] [2024-10-11 18:19:23,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517291050] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:23,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125086522] [2024-10-11 18:19:23,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:23,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:23,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:23,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:23,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:19:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:23,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:19:23,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:23,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:23,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125086522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:23,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:23,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-11 18:19:23,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265860656] [2024-10-11 18:19:23,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:23,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:19:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:23,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:19:23,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:19:23,222 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:23,265 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-10-11 18:19:23,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:19:23,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:19:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:23,266 INFO L225 Difference]: With dead ends: 69 [2024-10-11 18:19:23,266 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 18:19:23,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:19:23,267 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:23,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 168 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:19:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 18:19:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-10-11 18:19:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2024-10-11 18:19:23,274 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 13 [2024-10-11 18:19:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:23,275 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2024-10-11 18:19:23,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-10-11 18:19:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:19:23,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:23,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:23,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:19:23,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:23,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:23,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:23,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1498875890, now seen corresponding path program 1 times [2024-10-11 18:19:23,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:23,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304126403] [2024-10-11 18:19:23,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:23,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:23,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304126403] [2024-10-11 18:19:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304126403] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:23,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664951779] [2024-10-11 18:19:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:23,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:23,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:23,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:23,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:19:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:23,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:19:23,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:23,795 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-11 18:19:23,825 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:19:23,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:19:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:23,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:23,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664951779] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:23,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:23,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-11 18:19:23,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393525495] [2024-10-11 18:19:23,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:23,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:19:23,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:23,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:19:23,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:19:23,895 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:23,971 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-10-11 18:19:23,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:19:23,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 18:19:23,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:23,972 INFO L225 Difference]: With dead ends: 63 [2024-10-11 18:19:23,972 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 18:19:23,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:19:23,973 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:23,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 104 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:23,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 18:19:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 18:19:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-10-11 18:19:23,981 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 15 [2024-10-11 18:19:23,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:23,981 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-10-11 18:19:23,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:23,981 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2024-10-11 18:19:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:19:23,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:23,982 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:24,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:19:24,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:24,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:24,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1498875891, now seen corresponding path program 1 times [2024-10-11 18:19:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895481959] [2024-10-11 18:19:24,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:24,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:24,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895481959] [2024-10-11 18:19:24,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895481959] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:24,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509641390] [2024-10-11 18:19:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:24,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:24,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:24,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:24,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:19:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:24,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:19:24,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:24,520 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-11 18:19:24,570 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:19:24,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:19:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:24,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:24,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509641390] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:24,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:24,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-10-11 18:19:24,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083460686] [2024-10-11 18:19:24,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:24,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:19:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:24,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:19:24,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:19:24,699 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:24,772 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-11 18:19:24,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:19:24,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 18:19:24,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:24,773 INFO L225 Difference]: With dead ends: 61 [2024-10-11 18:19:24,773 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 18:19:24,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:19:24,774 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:24,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 89 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 18:19:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 18:19:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-10-11 18:19:24,778 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 15 [2024-10-11 18:19:24,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:24,778 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-10-11 18:19:24,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-10-11 18:19:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:19:24,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:24,779 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:24,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:19:24,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:24,980 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:24,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash 311681207, now seen corresponding path program 1 times [2024-10-11 18:19:24,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:24,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678630488] [2024-10-11 18:19:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:24,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 18:19:25,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:25,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678630488] [2024-10-11 18:19:25,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678630488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:25,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:25,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:19:25,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789827679] [2024-10-11 18:19:25,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:25,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:19:25,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:25,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:19:25,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:19:25,173 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:25,269 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-10-11 18:19:25,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:19:25,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 18:19:25,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:25,270 INFO L225 Difference]: With dead ends: 60 [2024-10-11 18:19:25,270 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 18:19:25,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:19:25,271 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:25,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 60 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 18:19:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-11 18:19:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-10-11 18:19:25,277 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 29 [2024-10-11 18:19:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:25,277 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-10-11 18:19:25,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-10-11 18:19:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:19:25,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:25,279 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:25,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:19:25,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash 311681208, now seen corresponding path program 1 times [2024-10-11 18:19:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128217783] [2024-10-11 18:19:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 18:19:25,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:25,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128217783] [2024-10-11 18:19:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128217783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:25,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:25,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:19:25,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853112282] [2024-10-11 18:19:25,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:25,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:19:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:25,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:19:25,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:19:25,547 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:25,639 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-10-11 18:19:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:19:25,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 18:19:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:25,640 INFO L225 Difference]: With dead ends: 64 [2024-10-11 18:19:25,640 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 18:19:25,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:19:25,641 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:25,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 105 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 18:19:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-10-11 18:19:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.346938775510204) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-10-11 18:19:25,644 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 29 [2024-10-11 18:19:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:25,645 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-10-11 18:19:25,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-10-11 18:19:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:19:25,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:25,646 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:25,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:19:25,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:25,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:25,647 INFO L85 PathProgramCache]: Analyzing trace with hash -424413485, now seen corresponding path program 1 times [2024-10-11 18:19:25,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:25,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220064743] [2024-10-11 18:19:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:25,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 18:19:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220064743] [2024-10-11 18:19:26,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220064743] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244545791] [2024-10-11 18:19:26,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:26,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:26,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:26,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:26,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:19:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:26,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 18:19:26,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:26,734 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-11 18:19:26,822 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:19:26,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:19:26,885 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 11 treesize of output 7 [2024-10-11 18:19:26,940 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 16 treesize of output 11 [2024-10-11 18:19:26,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:19:26,985 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 27 treesize of output 11 [2024-10-11 18:19:27,029 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 27 treesize of output 11 [2024-10-11 18:19:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:19:27,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:27,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:27,232 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2024-10-11 18:19:27,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:27,247 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 294 treesize of output 284 [2024-10-11 18:19:27,267 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 154 treesize of output 146 [2024-10-11 18:19:27,372 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 39 treesize of output 33 [2024-10-11 18:19:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:19:27,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244545791] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:27,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:27,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-10-11 18:19:27,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993078446] [2024-10-11 18:19:27,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:27,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 18:19:27,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:27,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 18:19:27,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=567, Unknown=6, NotChecked=0, Total=650 [2024-10-11 18:19:27,666 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:27,993 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-11 18:19:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:19:27,994 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-11 18:19:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:27,994 INFO L225 Difference]: With dead ends: 61 [2024-10-11 18:19:27,994 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 18:19:27,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=776, Unknown=6, NotChecked=0, Total=930 [2024-10-11 18:19:27,995 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:27,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 376 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:19:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 18:19:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 18:19:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-10-11 18:19:28,002 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 32 [2024-10-11 18:19:28,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:28,002 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-10-11 18:19:28,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-10-11 18:19:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:19:28,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:28,003 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:28,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:19:28,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:19:28,204 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:28,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash 160606883, now seen corresponding path program 1 times [2024-10-11 18:19:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:28,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083341339] [2024-10-11 18:19:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 18:19:28,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:28,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083341339] [2024-10-11 18:19:28,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083341339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:28,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:28,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:19:28,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119602858] [2024-10-11 18:19:28,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:28,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:19:28,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:19:28,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:19:28,361 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:28,464 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2024-10-11 18:19:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:19:28,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 18:19:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:28,465 INFO L225 Difference]: With dead ends: 65 [2024-10-11 18:19:28,465 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 18:19:28,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:19:28,466 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:28,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 18:19:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-10-11 18:19:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-11 18:19:28,468 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 34 [2024-10-11 18:19:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:28,469 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-11 18:19:28,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-11 18:19:28,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:19:28,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:28,470 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:28,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:19:28,470 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:28,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash 160606884, now seen corresponding path program 1 times [2024-10-11 18:19:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:28,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278904867] [2024-10-11 18:19:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 18:19:28,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:28,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278904867] [2024-10-11 18:19:28,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278904867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:28,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:28,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:19:28,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027742312] [2024-10-11 18:19:28,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:28,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:19:28,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:28,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:19:28,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:19:28,811 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:28,966 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2024-10-11 18:19:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:19:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 18:19:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:28,967 INFO L225 Difference]: With dead ends: 62 [2024-10-11 18:19:28,967 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 18:19:28,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:19:28,968 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:28,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 96 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:19:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 18:19:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-10-11 18:19:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-10-11 18:19:28,971 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2024-10-11 18:19:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:28,971 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-10-11 18:19:28,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-10-11 18:19:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:19:28,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:28,972 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:28,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:19:28,972 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:28,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash 160606921, now seen corresponding path program 1 times [2024-10-11 18:19:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:28,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492781568] [2024-10-11 18:19:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:19:29,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:29,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492781568] [2024-10-11 18:19:29,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492781568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:29,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555822658] [2024-10-11 18:19:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:29,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:29,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:29,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:29,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:19:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:30,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 18:19:30,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:30,162 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:19:30,163 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-11 18:19:30,214 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-11 18:19:30,215 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 22 [2024-10-11 18:19:30,289 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-11 18:19:30,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 18:19:30,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11 18:19:30,339 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 25 treesize of output 13 [2024-10-11 18:19:30,364 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:19:30,364 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:19:30,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-10-11 18:19:30,417 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 41 treesize of output 19 [2024-10-11 18:19:30,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:30,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 47 treesize of output 32 [2024-10-11 18:19:30,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:30,477 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 41 treesize of output 17 [2024-10-11 18:19:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:30,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:30,533 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1388 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1388) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 1)) is different from false [2024-10-11 18:19:30,549 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2024-10-11 18:19:30,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2024-10-11 18:19:38,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:38,658 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-10-11 18:19:38,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 140 treesize of output 122 [2024-10-11 18:19:38,667 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 17 treesize of output 13 [2024-10-11 18:19:38,672 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 24 treesize of output 16 [2024-10-11 18:19:38,916 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:19:38,916 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 46 treesize of output 45 [2024-10-11 18:19:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 27 refuted. 2 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-11 18:19:38,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555822658] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:38,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:38,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 33 [2024-10-11 18:19:38,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568041274] [2024-10-11 18:19:38,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:38,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 18:19:38,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:38,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 18:19:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=898, Unknown=16, NotChecked=62, Total=1122 [2024-10-11 18:19:38,933 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 34 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:39,499 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-10-11 18:19:39,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:19:39,499 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 18:19:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:39,500 INFO L225 Difference]: With dead ends: 64 [2024-10-11 18:19:39,500 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 18:19:39,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=288, Invalid=1260, Unknown=16, NotChecked=76, Total=1640 [2024-10-11 18:19:39,501 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:39,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 209 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 441 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2024-10-11 18:19:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 18:19:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-10-11 18:19:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-10-11 18:19:39,504 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 34 [2024-10-11 18:19:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:39,504 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-10-11 18:19:39,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-10-11 18:19:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:19:39,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:39,505 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:39,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:19:39,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 18:19:39,706 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:39,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash 160606922, now seen corresponding path program 1 times [2024-10-11 18:19:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037833006] [2024-10-11 18:19:39,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:39,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:19:41,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037833006] [2024-10-11 18:19:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037833006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886700659] [2024-10-11 18:19:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:41,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:41,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:41,109 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:41,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:19:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:41,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-10-11 18:19:41,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:41,382 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-11 18:19:41,390 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-11 18:19:41,492 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:19:41,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:19:41,501 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-11 18:19:41,541 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 11 treesize of output 7 [2024-10-11 18:19:41,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:19:41,593 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 23 treesize of output 11 [2024-10-11 18:19:41,601 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 23 treesize of output 11 [2024-10-11 18:19:41,624 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:19:41,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 18:19:41,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-11 18:19:41,698 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:19:41,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:19:41,721 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 18:19:41,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-10-11 18:19:41,814 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:41,815 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 70 [2024-10-11 18:19:41,825 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-10-11 18:19:41,826 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 1 case distinctions, treesize of input 54 treesize of output 48 [2024-10-11 18:19:42,217 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-10-11 18:19:42,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 191 treesize of output 113 [2024-10-11 18:19:42,232 INFO L349 Elim1Store]: treesize reduction 88, result has 1.1 percent of original size [2024-10-11 18:19:42,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 191 treesize of output 191 [2024-10-11 18:19:42,405 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-10-11 18:19:42,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 183 treesize of output 121 [2024-10-11 18:19:42,458 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-10-11 18:19:42,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 79 treesize of output 95 [2024-10-11 18:19:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:19:43,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:43,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1637 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1637 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_1639 (Array Int Int))) (<= (+ .cse1 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))))) (forall ((v_ArrVal_1639 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1637 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 4) (select |c_#length| .cse2)))))) (forall ((v_ArrVal_1637 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< 0 (+ .cse3 1))))))) is different from false [2024-10-11 18:19:43,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1635 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1635 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1635)) (forall ((v_ArrVal_1637 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< 0 (+ .cse1 1)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse1)))))) (forall ((v_ArrVal_1635 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1635 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1635)) (forall ((v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1636)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1637 (Array Int Int))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (select |c_#length| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_1635 (Array Int Int))) (or (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse5) (forall ((v_ArrVal_1639 (Array Int Int))) (<= (+ 4 .cse5) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1636)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))))) (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1635 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1635)))) (or (forall ((v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1636 Int)) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1636)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1635 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) 1)) (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1635 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1635))))))) is different from false [2024-10-11 18:19:43,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:43,725 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2024-10-11 18:19:43,731 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 89 treesize of output 87 [2024-10-11 18:19:43,738 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 104 treesize of output 86 [2024-10-11 18:19:43,743 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 19 treesize of output 15 [2024-10-11 18:19:43,745 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 27 treesize of output 19 [2024-10-11 18:19:43,766 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:43,769 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 33 treesize of output 31 [2024-10-11 18:19:43,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:43,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-10-11 18:19:43,785 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 25 treesize of output 13 [2024-10-11 18:19:43,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:43,801 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 59 [2024-10-11 18:19:43,806 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:43,809 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 37 treesize of output 35 [2024-10-11 18:19:43,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:43,819 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 37 treesize of output 19 [2024-10-11 18:19:43,833 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:43,835 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 26 treesize of output 24 [2024-10-11 18:19:43,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:43,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-10-11 18:19:43,850 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 18 treesize of output 10 [2024-10-11 18:19:43,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:43,862 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-10-11 18:19:43,866 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:43,868 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 20 treesize of output 8 [2024-10-11 18:19:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2024-10-11 18:19:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886700659] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:44,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:44,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2024-10-11 18:19:44,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864085060] [2024-10-11 18:19:44,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:44,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 18:19:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:44,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 18:19:44,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=718, Unknown=2, NotChecked=110, Total=930 [2024-10-11 18:19:44,053 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 31 states, 30 states have (on average 2.566666666666667) internal successors, (77), 31 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:44,223 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_50| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_50|) 0)))) (.cse7 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (or .cse0 (< 0 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 1))) (or .cse1 (= (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4)) 12)) (forall ((v_ArrVal_1635 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1635 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1635)) (forall ((v_ArrVal_1637 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (< 0 (+ .cse3 1)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse3)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (forall ((v_ArrVal_1635 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1635 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1635)) (forall ((v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1636)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1637 (Array Int Int))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) (select |c_#length| .cse5))) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (<= (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse7) (or .cse0 (< (+ 3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse7)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (forall ((v_ArrVal_1635 (Array Int Int))) (or (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse8) (forall ((v_ArrVal_1639 (Array Int Int))) (<= (+ 4 .cse8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1636)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))))) (not (= (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1635 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1635)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (forall ((v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1636 Int)) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1636)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1635 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) 1)) (not (= (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1635 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1635))))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or .cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4) 0)) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2024-10-11 18:19:44,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1637 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (forall ((v_ArrVal_1639 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1637 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_1639 (Array Int Int))) (<= (+ .cse1 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (forall ((v_ArrVal_1639 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1637 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 4) (select |c_#length| .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (forall ((v_ArrVal_1637 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< 0 (+ .cse3 1))))))) is different from false [2024-10-11 18:19:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:45,159 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-10-11 18:19:45,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:19:45,159 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.566666666666667) internal successors, (77), 31 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 18:19:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:45,160 INFO L225 Difference]: With dead ends: 69 [2024-10-11 18:19:45,160 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 18:19:45,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=248, Invalid=1324, Unknown=4, NotChecked=316, Total=1892 [2024-10-11 18:19:45,161 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 74 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:45,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 205 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 409 Invalid, 0 Unknown, 151 Unchecked, 0.3s Time] [2024-10-11 18:19:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 18:19:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-10-11 18:19:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-10-11 18:19:45,164 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 34 [2024-10-11 18:19:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:45,164 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-10-11 18:19:45,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.566666666666667) internal successors, (77), 31 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2024-10-11 18:19:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:19:45,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:45,165 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:45,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 18:19:45,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 18:19:45,369 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:45,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash -275547327, now seen corresponding path program 1 times [2024-10-11 18:19:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:45,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186434079] [2024-10-11 18:19:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:19:46,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:46,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186434079] [2024-10-11 18:19:46,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186434079] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:46,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361586247] [2024-10-11 18:19:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:46,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:46,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:46,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:46,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:19:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:46,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 18:19:46,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:46,419 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-11 18:19:46,447 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:19:46,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:19:46,464 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 13 treesize of output 9 [2024-10-11 18:19:46,480 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 25 treesize of output 13 [2024-10-11 18:19:46,490 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:19:46,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-10-11 18:19:46,513 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:19:46,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:19:46,516 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 8 treesize of output 4 [2024-10-11 18:19:46,538 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 40 treesize of output 24 [2024-10-11 18:19:46,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 27 [2024-10-11 18:19:46,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:46,658 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 28 treesize of output 10 [2024-10-11 18:19:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:19:46,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:50,811 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:19:50,811 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 12 treesize of output 11 [2024-10-11 18:19:50,882 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1890 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1889) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-10-11 18:19:50,896 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1890 (Array Int Int)) (v_ArrVal_1887 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1887)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1889) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-10-11 18:19:50,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:50,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-10-11 18:19:50,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:19:50,913 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 39 treesize of output 27 [2024-10-11 18:19:50,918 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 8 treesize of output 4 [2024-10-11 18:19:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2024-10-11 18:19:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361586247] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:50,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 33 [2024-10-11 18:19:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693061534] [2024-10-11 18:19:50,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:50,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 18:19:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:50,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 18:19:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=827, Unknown=5, NotChecked=118, Total=1056 [2024-10-11 18:19:50,964 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 33 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:51,600 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-10-11 18:19:51,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:19:51,600 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 33 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-11 18:19:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:51,601 INFO L225 Difference]: With dead ends: 78 [2024-10-11 18:19:51,601 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 18:19:51,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=236, Invalid=1407, Unknown=5, NotChecked=158, Total=1806 [2024-10-11 18:19:51,602 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 96 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:51,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 223 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 541 Invalid, 0 Unknown, 118 Unchecked, 0.3s Time] [2024-10-11 18:19:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 18:19:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2024-10-11 18:19:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-10-11 18:19:51,604 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 36 [2024-10-11 18:19:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:51,604 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-10-11 18:19:51,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 33 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:19:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-10-11 18:19:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:19:51,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:51,605 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:51,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:19:51,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:19:51,806 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-10-11 18:19:51,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash 47258497, now seen corresponding path program 1 times [2024-10-11 18:19:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198507073] [2024-10-11 18:19:51,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:51,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:19:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198507073] [2024-10-11 18:19:54,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198507073] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969881970] [2024-10-11 18:19:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:54,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:54,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:54,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:54,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:19:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:54,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-11 18:19:54,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:54,497 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-11 18:19:54,564 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:19:54,564 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-11 18:19:54,638 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:19:54,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:19:54,760 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-11 18:19:54,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 18:19:54,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11 18:19:54,897 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 16 treesize of output 11 [2024-10-11 18:19:55,046 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:19:55,046 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 16 treesize of output 15 [2024-10-11 18:19:55,055 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 11 treesize of output 7 [2024-10-11 18:19:55,066 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-11 18:19:55,137 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:19:55,137 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 20 treesize of output 19 [2024-10-11 18:19:55,150 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 23 treesize of output 11 [2024-10-11 18:19:55,161 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 23 treesize of output 11 [2024-10-11 18:19:55,178 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2024-10-11 18:19:55,185 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 27 treesize of output 22 [2024-10-11 18:19:55,195 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 47 treesize of output 23 [2024-10-11 18:19:55,308 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 18:19:55,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2024-10-11 18:19:55,335 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-11 18:19:55,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 18:19:55,346 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 20 treesize of output 15 [2024-10-11 18:19:55,512 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:55,513 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 111 [2024-10-11 18:19:55,562 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2024-10-11 18:19:55,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 119 treesize of output 155 [2024-10-11 18:19:55,611 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-10-11 18:19:55,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 82 treesize of output 104 [2024-10-11 18:19:56,196 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:19:56,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 85 [2024-10-11 18:19:56,232 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-10-11 18:19:56,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 91 treesize of output 113 [2024-10-11 18:19:56,246 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2024-10-11 18:19:56,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 115 [2024-10-11 18:19:56,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:56,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 75 [2024-10-11 18:19:56,513 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-10-11 18:19:56,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 79 treesize of output 82 [2024-10-11 18:19:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:19:56,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:57,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2150 Int)) (or (forall ((v_prenex_17 Int) (v_ArrVal_2148 (Array Int Int)) (v_ArrVal_2159 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_2150)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) v_prenex_17) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2148) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2159) .cse2) v_prenex_17)) (= v_prenex_17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< v_prenex_17 0))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2150))) (or (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_2148 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2148) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2159) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))))) is different from false [2024-10-11 18:19:59,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:59,055 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 1408 treesize of output 1403 [2024-10-11 18:19:59,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:59,268 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:19:59,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:59,331 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:19:59,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:59,398 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:19:59,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-11 18:20:00,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,211 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:00,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,251 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:00,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,278 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:00,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,421 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:00,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,506 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:00,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,612 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:00,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,832 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:00,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,866 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:01,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:01,166 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:01,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:01,413 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:01,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:01,576 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:01,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:01,608 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:01,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:01,910 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:02,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:02,080 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:02,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:02,119 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:02,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:02,182 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:02,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:02,219 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:02,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-10-11 18:20:02,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:02,667 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:02,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:02,734 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:03,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:03,174 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:03,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:03,208 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:03,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:03,258 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:03,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-10-11 18:20:03,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:03,496 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:03,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:03,579 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:03,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:03,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:03,744 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:20:03,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:03,763 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:03,836 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:20:03,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:03,855 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:20:04,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:04,266 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:04,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:04,321 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 18:20:04,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:05,059 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:05,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:05,069 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:05,078 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:05,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:05,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:05,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:05,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:05,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:05,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:05,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:05,603 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 869 treesize of output 873 [2024-10-11 18:20:05,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:05,666 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 868 treesize of output 872 [2024-10-11 18:20:05,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:05,731 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 867 treesize of output 871 [2024-10-11 18:20:05,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:05,829 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 866 treesize of output 870 [2024-10-11 18:20:05,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:05,940 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 865 treesize of output 869 [2024-10-11 18:20:06,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:06,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-10-11 18:20:06,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:06,783 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:20:06,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:06,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:06,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:06,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:06,988 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:07,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:07,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:07,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:07,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:07,129 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:07,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:07,137 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:07,138 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:07,141 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:20:07,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:07,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:07,164 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:07,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:07,332 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1377 treesize of output 1376 [2024-10-11 18:20:07,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:07,471 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1367 treesize of output 1366