./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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:17:03,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:17:03,475 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:17:03,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:17:03,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:17:03,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:17:03,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:17:03,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:17:03,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:17:03,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:17:03,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:17:03,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:17:03,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:17:03,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:17:03,513 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:17:03,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:17:03,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:17:03,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:17:03,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:17:03,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:17:03,516 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:17:03,516 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:17:03,520 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:17:03,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:17:03,520 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:17:03,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:17:03,521 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:17:03,521 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:17:03,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:17:03,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:17:03,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:17:03,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:17:03,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:17:03,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:17:03,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:17:03,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:17:03,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:17:03,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:17:03,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:17:03,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:17:03,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:17:03,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:17:03,525 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa [2024-10-14 18:17:03,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:17:03,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:17:03,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:17:03,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:17:03,820 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:17:03,821 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-14 18:17:05,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:17:05,571 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:17:05,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2024-10-14 18:17:05,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8819915/2789f3fe2dfa46399091b327c0978a7d/FLAG03c87d613 [2024-10-14 18:17:05,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8819915/2789f3fe2dfa46399091b327c0978a7d [2024-10-14 18:17:05,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:17:05,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:17:05,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:17:05,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:17:05,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:17:05,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:17:05" (1/1) ... [2024-10-14 18:17:05,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f4301f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:05, skipping insertion in model container [2024-10-14 18:17:05,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:17:05" (1/1) ... [2024-10-14 18:17:05,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:17:05,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:17:05,934 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:17:05,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:17:06,028 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:17:06,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06 WrapperNode [2024-10-14 18:17:06,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:17:06,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:17:06,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:17:06,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:17:06,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,075 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-10-14 18:17:06,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:17:06,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:17:06,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:17:06,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:17:06,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,108 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-14 18:17:06,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:17:06,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:17:06,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:17:06,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:17:06,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (1/1) ... [2024-10-14 18:17:06,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:17:06,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:06,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 18:17:06,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 18:17:06,211 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-14 18:17:06,211 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-14 18:17:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 18:17:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 18:17:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 18:17:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 18:17:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:17:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:17:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:17:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:17:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:17:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:17:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:17:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 18:17:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 18:17:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:17:06,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:17:06,323 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:17:06,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:17:06,348 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-14 18:17:06,355 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 18:17:06,575 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2024-10-14 18:17:06,576 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2024-10-14 18:17:06,576 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2024-10-14 18:17:06,576 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2024-10-14 18:17:06,576 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-14 18:17:06,602 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-14 18:17:06,602 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:17:06,644 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:17:06,645 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 18:17:06,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:17:06 BoogieIcfgContainer [2024-10-14 18:17:06,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:17:06,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:17:06,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:17:06,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:17:06,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:17:05" (1/3) ... [2024-10-14 18:17:06,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b2750e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:17:06, skipping insertion in model container [2024-10-14 18:17:06,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:17:06" (2/3) ... [2024-10-14 18:17:06,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b2750e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:17:06, skipping insertion in model container [2024-10-14 18:17:06,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:17:06" (3/3) ... [2024-10-14 18:17:06,656 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2024-10-14 18:17:06,675 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:17:06,676 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2024-10-14 18:17:06,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:17:06,739 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;@29a6acf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:17:06,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-10-14 18:17:06,743 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-14 18:17:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 18:17:06,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:06,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 18:17:06,750 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-14 18:17:06,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash 172438, now seen corresponding path program 1 times [2024-10-14 18:17:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:06,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818064211] [2024-10-14 18:17:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:17:07,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818064211] [2024-10-14 18:17:07,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818064211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:07,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:07,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 18:17:07,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953914432] [2024-10-14 18:17:07,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:07,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:17:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:07,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:17:07,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:17:07,066 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-14 18:17:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:07,170 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2024-10-14 18:17:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:17:07,174 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-14 18:17:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:07,180 INFO L225 Difference]: With dead ends: 62 [2024-10-14 18:17:07,180 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 18:17:07,182 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-14 18:17:07,185 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-14 18:17:07,186 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-14 18:17:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 18:17:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-14 18:17:07,218 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-14 18:17:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-10-14 18:17:07,221 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 3 [2024-10-14 18:17:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:07,222 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-10-14 18:17:07,222 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-14 18:17:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-10-14 18:17:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 18:17:07,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:07,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 18:17:07,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:17:07,225 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-14 18:17:07,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:07,226 INFO L85 PathProgramCache]: Analyzing trace with hash 172439, now seen corresponding path program 1 times [2024-10-14 18:17:07,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:07,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684407714] [2024-10-14 18:17:07,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:07,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:17:07,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684407714] [2024-10-14 18:17:07,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684407714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:07,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:07,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 18:17:07,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346435333] [2024-10-14 18:17:07,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:07,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:17:07,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:07,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:17:07,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:17:07,367 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-14 18:17:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:07,444 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2024-10-14 18:17:07,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:17:07,446 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-14 18:17:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:07,446 INFO L225 Difference]: With dead ends: 53 [2024-10-14 18:17:07,446 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 18:17:07,447 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-14 18:17:07,448 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-14 18:17:07,448 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-14 18:17:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 18:17:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-14 18:17:07,455 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-14 18:17:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-10-14 18:17:07,457 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 3 [2024-10-14 18:17:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:07,457 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-14 18:17:07,457 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-14 18:17:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-10-14 18:17:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 18:17:07,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:07,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:07,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:17:07,459 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-14 18:17:07,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1828434129, now seen corresponding path program 1 times [2024-10-14 18:17:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926139796] [2024-10-14 18:17:07,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:07,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:17:07,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:07,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926139796] [2024-10-14 18:17:07,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926139796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:07,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:07,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:17:07,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517655323] [2024-10-14 18:17:07,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:07,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:17:07,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:07,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:17:07,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:17:07,581 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-14 18:17:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:07,651 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-10-14 18:17:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:17:07,653 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-14 18:17:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:07,654 INFO L225 Difference]: With dead ends: 51 [2024-10-14 18:17:07,655 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 18:17:07,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:17:07,656 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-14 18:17:07,657 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-14 18:17:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 18:17:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 18:17:07,663 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-14 18:17:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-10-14 18:17:07,665 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 8 [2024-10-14 18:17:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:07,666 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-10-14 18:17:07,667 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-14 18:17:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-10-14 18:17:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 18:17:07,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:07,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:07,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:17:07,668 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-14 18:17:07,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1828434130, now seen corresponding path program 1 times [2024-10-14 18:17:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:07,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496556325] [2024-10-14 18:17:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:17:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496556325] [2024-10-14 18:17:07,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496556325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:07,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:07,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:17:07,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495917087] [2024-10-14 18:17:07,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:07,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:17:07,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:07,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:17:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:17:07,811 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-14 18:17:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:07,891 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-10-14 18:17:07,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:17:07,892 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-14 18:17:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:07,893 INFO L225 Difference]: With dead ends: 49 [2024-10-14 18:17:07,895 INFO L226 Difference]: Without dead ends: 49 [2024-10-14 18:17:07,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:17:07,896 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 18:17:07,897 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-14 18:17:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-14 18:17:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-14 18:17:07,903 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-14 18:17:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2024-10-14 18:17:07,905 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 8 [2024-10-14 18:17:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:07,905 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-10-14 18:17:07,906 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-14 18:17:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-10-14 18:17:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 18:17:07,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:07,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:07,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:17:07,908 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-14 18:17:07,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:07,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1828432688, now seen corresponding path program 1 times [2024-10-14 18:17:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:07,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876081567] [2024-10-14 18:17:07,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:17:07,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:07,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876081567] [2024-10-14 18:17:07,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876081567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:07,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:07,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:17:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444951290] [2024-10-14 18:17:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:07,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:17:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:17:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:17:07,955 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-14 18:17:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:07,977 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-10-14 18:17:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:17:07,978 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-14 18:17:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:07,979 INFO L225 Difference]: With dead ends: 56 [2024-10-14 18:17:07,979 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 18:17:07,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:17:07,980 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-14 18:17:07,981 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-14 18:17:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 18:17:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-10-14 18:17:07,985 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-14 18:17:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-10-14 18:17:07,986 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 8 [2024-10-14 18:17:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:07,986 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-14 18:17:07,987 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-14 18:17:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-10-14 18:17:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:17:07,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:07,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:07,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 18:17:07,988 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-14 18:17:07,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:07,989 INFO L85 PathProgramCache]: Analyzing trace with hash 483574356, now seen corresponding path program 1 times [2024-10-14 18:17:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:07,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495644153] [2024-10-14 18:17:07,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:17:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:08,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495644153] [2024-10-14 18:17:08,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495644153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:08,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:08,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:17:08,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873377876] [2024-10-14 18:17:08,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:08,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:17:08,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:08,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:17:08,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:17:08,172 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-14 18:17:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:08,262 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-10-14 18:17:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:17:08,262 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-14 18:17:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:08,263 INFO L225 Difference]: With dead ends: 54 [2024-10-14 18:17:08,263 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 18:17:08,264 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-14 18:17:08,265 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-14 18:17:08,268 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-14 18:17:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 18:17:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-14 18:17:08,271 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-14 18:17:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2024-10-14 18:17:08,272 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 10 [2024-10-14 18:17:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:08,276 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2024-10-14 18:17:08,277 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-14 18:17:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-10-14 18:17:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:17:08,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:08,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:08,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 18:17:08,279 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-14 18:17:08,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:08,279 INFO L85 PathProgramCache]: Analyzing trace with hash 483574357, now seen corresponding path program 1 times [2024-10-14 18:17:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111950897] [2024-10-14 18:17:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:17:08,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:08,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111950897] [2024-10-14 18:17:08,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111950897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:08,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:08,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:17:08,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35711689] [2024-10-14 18:17:08,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:08,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:17:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:08,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:17:08,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:17:08,519 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-14 18:17:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:08,653 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-10-14 18:17:08,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:17:08,654 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-14 18:17:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:08,654 INFO L225 Difference]: With dead ends: 54 [2024-10-14 18:17:08,654 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 18:17:08,655 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-14 18:17:08,655 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-14 18:17:08,656 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-14 18:17:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 18:17:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-14 18:17:08,663 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-14 18:17:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-14 18:17:08,664 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2024-10-14 18:17:08,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:08,666 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-14 18:17:08,666 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-14 18:17:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-14 18:17:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 18:17:08,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:08,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:08,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 18:17:08,667 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-14 18:17:08,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash 846250062, now seen corresponding path program 1 times [2024-10-14 18:17:08,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:08,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647052157] [2024-10-14 18:17:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:08,743 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-14 18:17:08,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:08,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647052157] [2024-10-14 18:17:08,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647052157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:08,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71992977] [2024-10-14 18:17:08,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:08,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:08,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:08,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:08,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 18:17:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:08,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:17:08,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:08,915 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-14 18:17:08,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:17:08,951 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-14 18:17:08,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71992977] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:17:08,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:17:08,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-14 18:17:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721134354] [2024-10-14 18:17:08,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:17:08,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:17:08,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:08,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:17:08,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:17:08,955 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-14 18:17:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:08,995 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-10-14 18:17:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:17:08,995 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-14 18:17:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:08,996 INFO L225 Difference]: With dead ends: 69 [2024-10-14 18:17:08,996 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 18:17:08,997 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-14 18:17:08,997 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-14 18:17:08,998 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-14 18:17:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 18:17:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-10-14 18:17:09,001 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-14 18:17:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2024-10-14 18:17:09,002 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 13 [2024-10-14 18:17:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:09,002 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2024-10-14 18:17:09,002 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-14 18:17:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-10-14 18:17:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 18:17:09,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:09,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:09,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 18:17:09,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:09,205 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-14 18:17:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1498875890, now seen corresponding path program 1 times [2024-10-14 18:17:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956898718] [2024-10-14 18:17:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:09,343 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-14 18:17:09,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:09,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956898718] [2024-10-14 18:17:09,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956898718] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:09,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293315473] [2024-10-14 18:17:09,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:09,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:09,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:09,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:09,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 18:17:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:09,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:17:09,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:09,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:17:09,535 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:17:09,536 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-14 18:17:09,566 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-14 18:17:09,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:17:09,609 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-14 18:17:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293315473] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:17:09,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:17:09,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-14 18:17:09,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852275256] [2024-10-14 18:17:09,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:17:09,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:17:09,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:17:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:17:09,615 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-14 18:17:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:09,695 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-10-14 18:17:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:17:09,696 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-14 18:17:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:09,696 INFO L225 Difference]: With dead ends: 63 [2024-10-14 18:17:09,696 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 18:17:09,696 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-14 18:17:09,697 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-14 18:17:09,697 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-14 18:17:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 18:17:09,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-14 18:17:09,700 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-14 18:17:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-10-14 18:17:09,703 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 15 [2024-10-14 18:17:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:09,703 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-10-14 18:17:09,703 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-14 18:17:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2024-10-14 18:17:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 18:17:09,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:09,704 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:09,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 18:17:09,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-14 18:17:09,905 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-14 18:17:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:09,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1498875891, now seen corresponding path program 1 times [2024-10-14 18:17:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:09,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051287597] [2024-10-14 18:17:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:09,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:10,122 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-14 18:17:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:10,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051287597] [2024-10-14 18:17:10,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051287597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:10,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511644365] [2024-10-14 18:17:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:10,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:10,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:10,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:10,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 18:17:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:10,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 18:17:10,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:10,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:17:10,300 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:17:10,301 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-14 18:17:10,330 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-14 18:17:10,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:17:10,464 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-14 18:17:10,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511644365] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:17:10,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:17:10,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-10-14 18:17:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164938267] [2024-10-14 18:17:10,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:17:10,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:17:10,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:10,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:17:10,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:17:10,466 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-14 18:17:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:10,541 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-14 18:17:10,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:17:10,541 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-14 18:17:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:10,542 INFO L225 Difference]: With dead ends: 61 [2024-10-14 18:17:10,542 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 18:17:10,542 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-14 18:17:10,543 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-14 18:17:10,543 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-14 18:17:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 18:17:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-14 18:17:10,554 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-14 18:17:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-10-14 18:17:10,555 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 15 [2024-10-14 18:17:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-10-14 18:17:10,555 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-14 18:17:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-10-14 18:17:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:17:10,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:10,556 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:10,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 18:17:10,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:10,758 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-14 18:17:10,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash 311681207, now seen corresponding path program 1 times [2024-10-14 18:17:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:10,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833868373] [2024-10-14 18:17:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:10,914 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-14 18:17:10,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:10,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833868373] [2024-10-14 18:17:10,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833868373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:10,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:10,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:17:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103162343] [2024-10-14 18:17:10,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:17:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:17:10,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:17:10,917 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-14 18:17:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:11,021 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-10-14 18:17:11,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:17:11,021 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-14 18:17:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:11,022 INFO L225 Difference]: With dead ends: 60 [2024-10-14 18:17:11,022 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 18:17:11,023 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-14 18:17:11,023 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-14 18:17:11,024 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-14 18:17:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 18:17:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-14 18:17:11,026 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-14 18:17:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-10-14 18:17:11,027 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 29 [2024-10-14 18:17:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:11,027 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-10-14 18:17:11,027 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-14 18:17:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-10-14 18:17:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:17:11,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:11,028 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:11,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 18:17:11,028 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-14 18:17:11,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:11,029 INFO L85 PathProgramCache]: Analyzing trace with hash 311681208, now seen corresponding path program 1 times [2024-10-14 18:17:11,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:11,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363479597] [2024-10-14 18:17:11,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:11,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:11,296 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-14 18:17:11,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:11,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363479597] [2024-10-14 18:17:11,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363479597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:11,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:11,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:17:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996093060] [2024-10-14 18:17:11,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:11,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:17:11,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:11,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:17:11,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:17:11,299 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-14 18:17:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:11,378 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-10-14 18:17:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:17:11,379 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-14 18:17:11,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:11,381 INFO L225 Difference]: With dead ends: 64 [2024-10-14 18:17:11,381 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 18:17:11,382 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-14 18:17:11,382 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-14 18:17:11,383 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-14 18:17:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 18:17:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-10-14 18:17:11,389 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-14 18:17:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-10-14 18:17:11,390 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 29 [2024-10-14 18:17:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:11,390 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-10-14 18:17:11,390 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-14 18:17:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-10-14 18:17:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:17:11,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:11,391 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:17:11,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 18:17:11,391 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-14 18:17:11,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash -424413485, now seen corresponding path program 1 times [2024-10-14 18:17:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:11,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211426615] [2024-10-14 18:17:11,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:12,205 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-14 18:17:12,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211426615] [2024-10-14 18:17:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211426615] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280142954] [2024-10-14 18:17:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:12,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:12,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:12,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:12,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 18:17:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:12,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 18:17:12,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:12,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:17:12,594 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:17:12,594 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-14 18:17:12,654 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-14 18:17:12,713 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-14 18:17:12,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:12,759 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-14 18:17:12,800 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-14 18:17:12,850 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-14 18:17:12,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:17:13,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:13,008 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-14 18:17:13,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:13,027 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-14 18:17:13,044 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-14 18:17:13,153 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-14 18:17:13,423 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-14 18:17:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280142954] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:17:13,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:17:13,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-10-14 18:17:13,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416757434] [2024-10-14 18:17:13,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:17:13,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 18:17:13,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:13,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 18:17:13,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=567, Unknown=6, NotChecked=0, Total=650 [2024-10-14 18:17:13,426 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-14 18:17:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:13,738 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-14 18:17:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:17:13,739 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-14 18:17:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:13,739 INFO L225 Difference]: With dead ends: 61 [2024-10-14 18:17:13,739 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 18:17:13,740 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-14 18:17:13,741 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-14 18:17:13,741 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-14 18:17:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 18:17:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-14 18:17:13,745 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-14 18:17:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-10-14 18:17:13,746 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 32 [2024-10-14 18:17:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:13,746 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-10-14 18:17:13,747 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-14 18:17:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-10-14 18:17:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:17:13,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:13,748 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-14 18:17:13,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 18:17:13,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:13,950 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-14 18:17:13,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:13,950 INFO L85 PathProgramCache]: Analyzing trace with hash 160606883, now seen corresponding path program 1 times [2024-10-14 18:17:13,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:13,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589783729] [2024-10-14 18:17:13,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:13,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:14,150 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-14 18:17:14,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:14,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589783729] [2024-10-14 18:17:14,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589783729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:14,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:14,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:17:14,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315819139] [2024-10-14 18:17:14,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:14,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:17:14,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:14,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:17:14,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:17:14,152 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-14 18:17:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:14,254 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2024-10-14 18:17:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:17:14,255 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-14 18:17:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:14,256 INFO L225 Difference]: With dead ends: 65 [2024-10-14 18:17:14,256 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 18:17:14,256 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-14 18:17:14,257 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-14 18:17:14,257 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-14 18:17:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 18:17:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-10-14 18:17:14,259 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-14 18:17:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-14 18:17:14,260 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 34 [2024-10-14 18:17:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:14,260 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-14 18:17:14,260 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-14 18:17:14,260 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-14 18:17:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:17:14,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:14,261 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-14 18:17:14,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 18:17:14,261 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-14 18:17:14,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash 160606884, now seen corresponding path program 1 times [2024-10-14 18:17:14,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:14,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160500281] [2024-10-14 18:17:14,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:14,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:14,543 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-14 18:17:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160500281] [2024-10-14 18:17:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160500281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:17:14,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:17:14,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:17:14,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000662393] [2024-10-14 18:17:14,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:17:14,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:17:14,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:14,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:17:14,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:17:14,547 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-14 18:17:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:14,675 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2024-10-14 18:17:14,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:17:14,676 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-14 18:17:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:14,676 INFO L225 Difference]: With dead ends: 62 [2024-10-14 18:17:14,676 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 18:17:14,677 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-14 18:17:14,677 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-14 18:17:14,677 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-14 18:17:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 18:17:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-10-14 18:17:14,679 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-14 18:17:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-10-14 18:17:14,681 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2024-10-14 18:17:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:14,681 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-10-14 18:17:14,682 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-14 18:17:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-10-14 18:17:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:17:14,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:14,684 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-14 18:17:14,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 18:17:14,684 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-14 18:17:14,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash 160606921, now seen corresponding path program 1 times [2024-10-14 18:17:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:14,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579053228] [2024-10-14 18:17:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:15,686 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-14 18:17:15,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579053228] [2024-10-14 18:17:15,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579053228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619006344] [2024-10-14 18:17:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:15,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:15,690 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:15,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 18:17:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:15,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-14 18:17:15,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:15,958 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:17:15,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 18:17:16,013 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 18:17:16,013 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-14 18:17:16,094 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-14 18:17:16,094 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-14 18:17:16,118 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-14 18:17:16,145 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-14 18:17:16,163 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:17:16,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-14 18:17:16,196 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-14 18:17:16,211 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-14 18:17:16,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:16,257 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-14 18:17:16,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:16,269 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-14 18:17:16,273 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-14 18:17:16,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:17:16,320 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-14 18:17:16,334 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2024-10-14 18:17:16,334 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-14 18:17:20,382 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1386 Int) (v_ArrVal_1388 (Array Int Int)) (v_ArrVal_1387 (Array Int Int))) (= (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_1386)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1387) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1388) |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_~head~0#1.base|)) is different from false [2024-10-14 18:17:20,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:20,396 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-14 18:17:20,399 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-14 18:17:20,405 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-14 18:17:20,413 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-14 18:17:20,667 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-14 18:17:20,667 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-14 18:17:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 25 refuted. 1 times theorem prover too weak. 0 trivial. 7 not checked. [2024-10-14 18:17:20,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619006344] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:17:20,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:17:20,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 33 [2024-10-14 18:17:20,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640488579] [2024-10-14 18:17:20,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:17:20,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 18:17:20,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 18:17:20,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=850, Unknown=7, NotChecked=122, Total=1122 [2024-10-14 18:17:20,687 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-14 18:17:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:21,247 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-10-14 18:17:21,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:17:21,248 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-14 18:17:21,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:21,249 INFO L225 Difference]: With dead ends: 64 [2024-10-14 18:17:21,249 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 18:17:21,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=283, Invalid=1200, Unknown=7, NotChecked=150, Total=1640 [2024-10-14 18:17:21,250 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:17:21,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 206 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 413 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2024-10-14 18:17:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 18:17:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-10-14 18:17:21,253 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-14 18:17:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-10-14 18:17:21,253 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 34 [2024-10-14 18:17:21,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:21,254 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-10-14 18:17:21,254 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-14 18:17:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-10-14 18:17:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:17:21,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:21,254 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-14 18:17:21,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 18:17:21,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 18:17:21,456 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-14 18:17:21,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:21,456 INFO L85 PathProgramCache]: Analyzing trace with hash 160606922, now seen corresponding path program 1 times [2024-10-14 18:17:21,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:21,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327911069] [2024-10-14 18:17:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:22,792 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-14 18:17:22,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:22,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327911069] [2024-10-14 18:17:22,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327911069] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:22,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912415431] [2024-10-14 18:17:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:22,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:22,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:22,795 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:22,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 18:17:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:22,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-10-14 18:17:22,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:23,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:17:23,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:17:23,117 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:17:23,117 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-14 18:17:23,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:17:23,171 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-14 18:17:23,188 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-14 18:17:23,232 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-14 18:17:23,241 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-14 18:17:23,307 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:17:23,307 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-14 18:17:23,314 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-14 18:17:23,370 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-14 18:17:23,371 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-14 18:17:23,393 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-14 18:17:23,394 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-14 18:17:23,489 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:17:23,490 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-14 18:17:23,502 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-10-14 18:17:23,503 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-14 18:17:23,820 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-10-14 18:17:23,821 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-14 18:17:23,833 INFO L349 Elim1Store]: treesize reduction 88, result has 1.1 percent of original size [2024-10-14 18:17:23,833 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-14 18:17:23,978 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-10-14 18:17:23,978 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-14 18:17:24,030 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-10-14 18:17:24,031 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-14 18:17:24,830 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-14 18:17:24,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:17:25,199 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-14 18:17:25,296 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-14 18:17:25,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:25,337 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-14 18:17:25,345 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-14 18:17:25,353 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-14 18:17:25,361 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-14 18:17:25,367 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-14 18:17:25,385 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:25,387 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-14 18:17:25,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:25,395 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-14 18:17:25,400 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-14 18:17:25,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:25,416 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-14 18:17:25,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:25,425 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-14 18:17:25,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:25,435 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-14 18:17:25,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:25,451 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-14 18:17:25,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:25,461 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-14 18:17:25,465 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-14 18:17:25,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:25,478 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-14 18:17:25,482 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:25,485 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-14 18:17:25,657 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-14 18:17:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912415431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:17:25,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:17:25,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2024-10-14 18:17:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073629447] [2024-10-14 18:17:25,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:17:25,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 18:17:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:25,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 18:17:25,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=718, Unknown=2, NotChecked=110, Total=930 [2024-10-14 18:17:25,659 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-14 18:17:25,872 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-14 18:17:25,880 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-14 18:17:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:26,759 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-10-14 18:17:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 18:17:26,760 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-14 18:17:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:26,760 INFO L225 Difference]: With dead ends: 69 [2024-10-14 18:17:26,760 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 18:17:26,761 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-14 18:17:26,762 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 77 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:17:26,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 194 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 401 Invalid, 0 Unknown, 151 Unchecked, 0.3s Time] [2024-10-14 18:17:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 18:17:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-10-14 18:17:26,764 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-14 18:17:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-10-14 18:17:26,764 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 34 [2024-10-14 18:17:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:26,764 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-10-14 18:17:26,765 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-14 18:17:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2024-10-14 18:17:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 18:17:26,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:26,765 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-14 18:17:26,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 18:17:26,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 18:17:26,970 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-14 18:17:26,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:26,970 INFO L85 PathProgramCache]: Analyzing trace with hash -275547327, now seen corresponding path program 1 times [2024-10-14 18:17:26,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:26,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573975237] [2024-10-14 18:17:26,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:26,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:27,746 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-14 18:17:27,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573975237] [2024-10-14 18:17:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573975237] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050541836] [2024-10-14 18:17:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:27,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:27,749 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:27,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 18:17:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:27,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-14 18:17:27,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:27,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:17:28,000 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:17:28,001 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-14 18:17:28,015 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-14 18:17:28,034 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-14 18:17:28,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:17:28,047 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-14 18:17:28,075 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:17:28,076 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-14 18:17:28,078 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-14 18:17:28,104 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-14 18:17:28,164 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-14 18:17:28,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:28,232 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-14 18:17:28,252 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-14 18:17:28,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:17:32,385 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-14 18:17:32,385 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-14 18:17:32,504 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-14 18:17:32,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:32,513 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-14 18:17:32,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:32,519 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-14 18:17:32,523 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-14 18:17:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 1 not checked. [2024-10-14 18:17:32,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050541836] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:17:32,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:17:32,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 33 [2024-10-14 18:17:32,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819562028] [2024-10-14 18:17:32,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:17:32,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-14 18:17:32,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:17:32,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-14 18:17:32,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=878, Unknown=9, NotChecked=60, Total=1056 [2024-10-14 18:17:32,584 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-14 18:17:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:17:33,311 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-10-14 18:17:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 18:17:33,312 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-14 18:17:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:17:33,312 INFO L225 Difference]: With dead ends: 78 [2024-10-14 18:17:33,312 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 18:17:33,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=241, Invalid=1476, Unknown=9, NotChecked=80, Total=1806 [2024-10-14 18:17:33,314 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 81 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:17:33,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 261 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 688 Invalid, 0 Unknown, 59 Unchecked, 0.4s Time] [2024-10-14 18:17:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 18:17:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2024-10-14 18:17:33,320 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-14 18:17:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-10-14 18:17:33,320 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 36 [2024-10-14 18:17:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:17:33,320 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-10-14 18:17:33,320 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-14 18:17:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-10-14 18:17:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 18:17:33,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:17:33,321 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-14 18:17:33,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 18:17:33,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:33,522 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-14 18:17:33,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:17:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash 47258497, now seen corresponding path program 1 times [2024-10-14 18:17:33,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:17:33,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602528250] [2024-10-14 18:17:33,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:17:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:36,001 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-14 18:17:36,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:17:36,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602528250] [2024-10-14 18:17:36,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602528250] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:17:36,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544345754] [2024-10-14 18:17:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:17:36,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:17:36,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:17:36,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:17:36,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 18:17:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:17:36,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-14 18:17:36,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:17:36,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:17:36,286 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:17:36,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 18:17:36,354 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:17:36,355 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-14 18:17:36,460 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-14 18:17:36,461 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-14 18:17:36,520 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-14 18:17:36,561 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-14 18:17:36,653 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:17:36,654 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-14 18:17:36,663 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-14 18:17:36,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:17:36,750 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:17:36,751 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-14 18:17:36,760 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-14 18:17:36,769 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-14 18:17:36,786 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-14 18:17:36,793 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-14 18:17:36,803 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-14 18:17:36,945 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-14 18:17:36,945 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-14 18:17:36,968 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-14 18:17:36,969 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-14 18:17:36,977 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-14 18:17:37,131 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:17:37,132 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-14 18:17:37,187 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2024-10-14 18:17:37,188 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-14 18:17:37,220 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-10-14 18:17:37,221 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-14 18:17:37,784 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:17:37,785 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-14 18:17:37,820 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-10-14 18:17:37,820 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-14 18:17:37,835 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2024-10-14 18:17:37,836 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-14 18:17:38,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:38,056 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-14 18:17:38,084 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-10-14 18:17:38,084 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-14 18:17:38,293 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-14 18:17:38,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:17:38,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2))) (and (forall ((v_prenex_17 Int) (v_ArrVal_2159 (Array Int Int))) (or (< .cse0 v_prenex_17) (= v_prenex_17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< v_prenex_17 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2159) .cse1) v_prenex_17)))) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((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) (< .cse0 |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2159) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|))))))) is different from false [2024-10-14 18:17:38,770 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-14 18:17:41,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:41,298 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-14 18:17:41,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:41,516 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-14 18:17:41,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:41,577 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-14 18:17:41,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:41,643 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-14 18:17:41,815 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-14 18:17:42,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:42,418 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-14 18:17:42,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:42,468 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-14 18:17:42,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:42,495 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-14 18:17:42,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:42,654 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-14 18:17:42,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:42,747 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-14 18:17:42,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:42,862 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-14 18:17:43,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:43,069 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-14 18:17:43,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:43,105 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-14 18:17:43,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:43,383 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-14 18:17:43,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:43,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 43 treesize of output 41 [2024-10-14 18:17:43,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:43,844 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-14 18:17:43,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:43,899 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-14 18:17:44,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:44,293 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-14 18:17:44,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:44,461 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-14 18:17:44,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:44,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-14 18:17:44,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:44,557 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-14 18:17:44,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:44,596 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-14 18:17:44,709 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-14 18:17:44,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:44,953 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-14 18:17:45,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:45,010 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-14 18:17:45,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:45,361 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-14 18:17:45,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:45,386 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-14 18:17:45,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:45,434 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-14 18:17:45,594 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-14 18:17:45,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:45,706 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-14 18:17:45,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:45,801 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-14 18:17:45,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:45,976 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-14 18:17:46,003 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:17:46,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:46,024 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-14 18:17:46,081 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:17:46,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:46,098 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-14 18:17:46,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:46,536 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-14 18:17:46,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:46,601 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-14 18:17:46,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:47,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:47,309 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:47,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:47,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:47,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:47,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:47,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:47,582 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:47,583 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:47,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:47,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:47,897 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-14 18:17:47,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:47,958 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-14 18:17:48,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:48,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 867 treesize of output 871 [2024-10-14 18:17:48,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:48,090 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-14 18:17:48,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:48,171 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-14 18:17:48,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:48,970 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-14 18:17:48,980 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:48,982 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:17:49,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:49,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:49,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:49,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:49,185 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:49,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:49,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:49,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:49,354 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:49,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:49,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:49,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:49,368 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:49,371 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:17:49,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:17:49,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:49,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:17:49,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:49,593 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-14 18:17:49,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:17:49,723 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 [2024-10-14 18:18:20,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:20,928 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 52 treesize of output 48 [2024-10-14 18:18:20,931 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 48 treesize of output 44 [2024-10-14 18:18:20,934 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 22 treesize of output 20 [2024-10-14 18:18:20,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:20,990 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-10-14 18:18:20,990 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 2 case distinctions, treesize of input 1139 treesize of output 1077 [2024-10-14 18:18:21,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:18:21,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 229 [2024-10-14 18:18:21,017 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,020 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 184 treesize of output 176 [2024-10-14 18:18:21,032 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 262 treesize of output 246 [2024-10-14 18:18:21,043 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 116 treesize of output 106 [2024-10-14 18:18:21,066 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 6 treesize of output 4 [2024-10-14 18:18:21,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:18:21,286 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 98 treesize of output 96 [2024-10-14 18:18:21,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:18:21,387 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-14 18:18:21,388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1277 treesize of output 1 [2024-10-14 18:18:21,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,391 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,391 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,395 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:18:21,396 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 1 case distinctions, treesize of input 23 treesize of output 1 [2024-10-14 18:18:21,398 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,404 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:18:21,404 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 1 case distinctions, treesize of input 23 treesize of output 1 [2024-10-14 18:18:21,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,412 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:18:21,412 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 1 case distinctions, treesize of input 23 treesize of output 1 [2024-10-14 18:18:21,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,420 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:18:21,421 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 1 case distinctions, treesize of input 23 treesize of output 1 [2024-10-14 18:18:21,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,430 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:18:21,430 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 1 case distinctions, treesize of input 23 treesize of output 1 [2024-10-14 18:18:21,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:18:21,443 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-14 18:18:21,443 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 2 case distinctions, treesize of input 4461 treesize of output 1 [2024-10-14 18:18:21,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:18:21,460 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-14 18:18:21,460 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 2 case distinctions, treesize of input 4461 treesize of output 1 [2024-10-14 18:18:21,463 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,464 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,464 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:18:21,476 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-14 18:18:21,477 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 2 case distinctions, treesize of input 1125 treesize of output 1 [2024-10-14 18:18:21,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:18:21,500 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-14 18:18:21,501 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 329 treesize of output 1 [2024-10-14 18:18:21,505 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,506 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,506 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,508 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:18:21,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,515 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,515 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:18:21,529 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-14 18:18:21,529 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 329 treesize of output 1 [2024-10-14 18:18:21,537 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,539 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:18:21,549 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-14 18:18:21,550 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 2 case distinctions, treesize of input 2237 treesize of output 1 [2024-10-14 18:18:21,555 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,557 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:18:21,565 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-14 18:18:21,565 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 329 treesize of output 1 [2024-10-14 18:18:21,568 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,568 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,573 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:18:21,574 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 1 case distinctions, treesize of input 23 treesize of output 1 [2024-10-14 18:18:21,576 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,577 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,577 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,579 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:18:21,584 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,584 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,589 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:18:21,590 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 1 case distinctions, treesize of input 23 treesize of output 1 [2024-10-14 18:18:21,596 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,596 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,597 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,598 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:18:21,601 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,601 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,606 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:18:21,606 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 1 case distinctions, treesize of input 23 treesize of output 1 [2024-10-14 18:18:21,609 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,609 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:18:21,619 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-10-14 18:18:21,620 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 2 case distinctions, treesize of input 2237 treesize of output 1 [2024-10-14 18:18:21,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,626 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 18:18:21,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,629 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,629 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:18:21,634 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:18:21,634 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 1 case distinctions, treesize of input 23 treesize of output 1