./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.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 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:56:37,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:56:37,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:56:37,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:56:37,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:56:37,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:56:37,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:56:37,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:56:37,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:56:37,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:56:37,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:56:37,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:56:37,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:56:37,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:56:37,764 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:56:37,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:56:37,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:56:37,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:56:37,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:56:37,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:56:37,766 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:56:37,769 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:56:37,770 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:56:37,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:56:37,770 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:56:37,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:56:37,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:56:37,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:56:37,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:56:37,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:56:37,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:56:37,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:56:37,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:56:37,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:56:37,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:56:37,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:56:37,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:56:37,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:56:37,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:56:37,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:56:37,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:56:37,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:56:37,776 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2024-11-20 14:56:38,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:56:38,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:56:38,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:56:38,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:56:38,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:56:38,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-20 14:56:39,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:56:39,686 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:56:39,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-20 14:56:39,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8dc59547/873d337a253341c786357f0ca5a6c8ca/FLAGc035ae94e [2024-11-20 14:56:39,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8dc59547/873d337a253341c786357f0ca5a6c8ca [2024-11-20 14:56:39,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:56:39,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:56:39,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:56:39,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:56:39,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:56:39,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:39" (1/1) ... [2024-11-20 14:56:39,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d4ab92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:39, skipping insertion in model container [2024-11-20 14:56:39,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:39" (1/1) ... [2024-11-20 14:56:39,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:56:40,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:56:40,154 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:56:40,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:56:40,238 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:56:40,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40 WrapperNode [2024-11-20 14:56:40,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:56:40,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:56:40,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:56:40,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:56:40,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,284 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 173 [2024-11-20 14:56:40,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:56:40,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:56:40,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:56:40,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:56:40,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,322 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 8, 21]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2024-11-20 14:56:40,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:56:40,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:56:40,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:56:40,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:56:40,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (1/1) ... [2024-11-20 14:56:40,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:56:40,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:40,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 14:56:40,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 14:56:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-20 14:56:40,456 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-20 14:56:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 14:56:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 14:56:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 14:56:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 14:56:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 14:56:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 14:56:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:56:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:56:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 14:56:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:56:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:56:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 14:56:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:56:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:56:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 14:56:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:56:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 14:56:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 14:56:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-20 14:56:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 14:56:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 14:56:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 14:56:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:56:40,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:56:40,605 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:56:40,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:56:40,631 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-20 14:56:41,010 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-20 14:56:41,010 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:56:41,031 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:56:41,031 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-20 14:56:41,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:41 BoogieIcfgContainer [2024-11-20 14:56:41,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:56:41,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:56:41,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:56:41,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:56:41,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:56:39" (1/3) ... [2024-11-20 14:56:41,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7d55d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:41, skipping insertion in model container [2024-11-20 14:56:41,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:40" (2/3) ... [2024-11-20 14:56:41,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7d55d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:41, skipping insertion in model container [2024-11-20 14:56:41,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:41" (3/3) ... [2024-11-20 14:56:41,041 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2024-11-20 14:56:41,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:56:41,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2024-11-20 14:56:41,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:56:41,114 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;@643f839d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:56:41,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-20 14:56:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 73 states have (on average 2.1232876712328768) internal successors, (155), 135 states have internal predecessors, (155), 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-11-20 14:56:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 14:56:41,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:41,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 14:56:41,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:41,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2024-11-20 14:56:41,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:41,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71951279] [2024-11-20 14:56:41,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:41,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71951279] [2024-11-20 14:56:41,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71951279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:41,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:56:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663607503] [2024-11-20 14:56:41,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:41,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:56:41,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:56:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:41,456 INFO L87 Difference]: Start difference. First operand has 137 states, 73 states have (on average 2.1232876712328768) internal successors, (155), 135 states have internal predecessors, (155), 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:41,619 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2024-11-20 14:56:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:56:41,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 14:56:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:41,630 INFO L225 Difference]: With dead ends: 133 [2024-11-20 14:56:41,630 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 14:56:41,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:41,635 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:41,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 209 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 14:56:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-20 14:56:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 69 states have (on average 2.0) internal successors, (138), 126 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2024-11-20 14:56:41,678 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 5 [2024-11-20 14:56:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:41,679 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2024-11-20 14:56:41,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2024-11-20 14:56:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 14:56:41,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:41,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 14:56:41,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:56:41,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:41,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2024-11-20 14:56:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:41,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17385965] [2024-11-20 14:56:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:41,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:41,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:41,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17385965] [2024-11-20 14:56:41,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17385965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:41,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:41,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:56:41,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424698501] [2024-11-20 14:56:41,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:41,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:56:41,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:56:41,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:41,818 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:41,930 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2024-11-20 14:56:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:56:41,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 14:56:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:41,932 INFO L225 Difference]: With dead ends: 124 [2024-11-20 14:56:41,932 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 14:56:41,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:41,934 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:41,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 201 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 14:56:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-20 14:56:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 123 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2024-11-20 14:56:41,944 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 5 [2024-11-20 14:56:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:41,944 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2024-11-20 14:56:41,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2024-11-20 14:56:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:56:41,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:41,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:41,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:56:41,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:41,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:41,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113040, now seen corresponding path program 1 times [2024-11-20 14:56:41,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:41,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666850280] [2024-11-20 14:56:41,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:41,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:42,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:42,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666850280] [2024-11-20 14:56:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666850280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:42,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:56:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742769723] [2024-11-20 14:56:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:42,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:56:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:42,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:56:42,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:42,051 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:42,066 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2024-11-20 14:56:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:56:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 14:56:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:42,067 INFO L225 Difference]: With dead ends: 134 [2024-11-20 14:56:42,067 INFO L226 Difference]: Without dead ends: 134 [2024-11-20 14:56:42,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:42,068 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:42,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 263 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:56:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-20 14:56:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2024-11-20 14:56:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 70 states have (on average 1.9428571428571428) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2024-11-20 14:56:42,082 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 7 [2024-11-20 14:56:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:42,083 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2024-11-20 14:56:42,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2024-11-20 14:56:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:56:42,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:42,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:42,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:56:42,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:42,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2024-11-20 14:56:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017171262] [2024-11-20 14:56:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:42,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:42,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017171262] [2024-11-20 14:56:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017171262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:42,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:42,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:56:42,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834823430] [2024-11-20 14:56:42,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:42,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:56:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:42,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:56:42,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:42,227 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:42,254 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2024-11-20 14:56:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:56:42,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:56:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:42,256 INFO L225 Difference]: With dead ends: 130 [2024-11-20 14:56:42,256 INFO L226 Difference]: Without dead ends: 130 [2024-11-20 14:56:42,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:42,257 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:42,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:56:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-20 14:56:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-20 14:56:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 75 states have (on average 1.88) internal successors, (141), 129 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2024-11-20 14:56:42,266 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 9 [2024-11-20 14:56:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:42,266 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2024-11-20 14:56:42,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2024-11-20 14:56:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:56:42,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:42,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:42,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:56:42,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:42,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash -763066913, now seen corresponding path program 1 times [2024-11-20 14:56:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:42,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855994451] [2024-11-20 14:56:42,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:42,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855994451] [2024-11-20 14:56:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855994451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189311712] [2024-11-20 14:56:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:42,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:42,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:42,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:42,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 14:56:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:42,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:56:42,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:42,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189311712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:56:42,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:56:42,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-20 14:56:42,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999496530] [2024-11-20 14:56:42,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:42,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:56:42,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:42,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:56:42,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:42,609 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-11-20 14:56:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:42,630 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2024-11-20 14:56:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:56:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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 14 [2024-11-20 14:56:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:42,632 INFO L225 Difference]: With dead ends: 132 [2024-11-20 14:56:42,633 INFO L226 Difference]: Without dead ends: 132 [2024-11-20 14:56:42,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:42,635 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:42,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 384 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:56:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-20 14:56:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-20 14:56:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.8571428571428572) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-11-20 14:56:42,642 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 14 [2024-11-20 14:56:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:42,643 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-11-20 14:56:42,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-11-20 14:56:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-11-20 14:56:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:56:42,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:42,644 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:42,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 14:56:42,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:42,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:42,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2024-11-20 14:56:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905599270] [2024-11-20 14:56:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:43,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:43,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905599270] [2024-11-20 14:56:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905599270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:43,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348633975] [2024-11-20 14:56:43,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:43,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:43,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:43,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:43,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 14:56:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:43,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:56:43,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:43,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:56:43,243 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:56:43,244 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-11-20 14:56:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:43,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348633975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:56:43,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:56:43,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-20 14:56:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106961119] [2024-11-20 14:56:43,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:43,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:56:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:43,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:56:43,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:43,305 INFO L87 Difference]: Start difference. First operand 132 states and 143 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-11-20 14:56:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:43,473 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2024-11-20 14:56:43,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:56:43,473 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 16 [2024-11-20 14:56:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:43,474 INFO L225 Difference]: With dead ends: 131 [2024-11-20 14:56:43,474 INFO L226 Difference]: Without dead ends: 131 [2024-11-20 14:56:43,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 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-11-20 14:56:43,475 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:43,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 260 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:56:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-20 14:56:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-20 14:56:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.844155844155844) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2024-11-20 14:56:43,488 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 16 [2024-11-20 14:56:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:43,489 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2024-11-20 14:56:43,489 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-11-20 14:56:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2024-11-20 14:56:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:56:43,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:43,490 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:43,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 14:56:43,690 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,SelfDestructingSolverStorable5 [2024-11-20 14:56:43,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:43,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2024-11-20 14:56:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:43,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759221925] [2024-11-20 14:56:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:43,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:43,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:43,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759221925] [2024-11-20 14:56:43,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759221925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:43,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994952821] [2024-11-20 14:56:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:43,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:43,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:43,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 14:56:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:44,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 14:56:44,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:44,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:56:44,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-20 14:56:44,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:44,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:56:44,131 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:56:44,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 14:56:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:44,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:44,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994952821] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:56:44,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:56:44,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-20 14:56:44,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534176697] [2024-11-20 14:56:44,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:44,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:56:44,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:44,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:56:44,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:56:44,425 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:44,806 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2024-11-20 14:56:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:56:44,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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 16 [2024-11-20 14:56:44,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:44,807 INFO L225 Difference]: With dead ends: 130 [2024-11-20 14:56:44,807 INFO L226 Difference]: Without dead ends: 130 [2024-11-20 14:56:44,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:56:44,809 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 19 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:44,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 543 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:56:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-20 14:56:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-20 14:56:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 77 states have (on average 1.8311688311688312) internal successors, (141), 129 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2024-11-20 14:56:44,821 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 16 [2024-11-20 14:56:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:44,822 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2024-11-20 14:56:44,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2024-11-20 14:56:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 14:56:44,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:44,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:44,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 14:56:45,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:45,023 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:45,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:45,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957328, now seen corresponding path program 2 times [2024-11-20 14:56:45,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:45,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340005445] [2024-11-20 14:56:45,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:45,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:45,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340005445] [2024-11-20 14:56:45,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340005445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:45,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703840709] [2024-11-20 14:56:45,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:56:45,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:45,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:45,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:45,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 14:56:45,185 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 14:56:45,185 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:56:45,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:56:45,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:45,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:56:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:56:45,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:56:45,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703840709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:45,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:56:45,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-20 14:56:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747116286] [2024-11-20 14:56:45,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:45,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:56:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:56:45,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:45,202 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:45,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:45,283 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2024-11-20 14:56:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:56:45,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 14:56:45,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:45,285 INFO L225 Difference]: With dead ends: 127 [2024-11-20 14:56:45,285 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 14:56:45,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:45,285 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:45,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 189 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 14:56:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-20 14:56:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 126 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2024-11-20 14:56:45,293 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 21 [2024-11-20 14:56:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:45,293 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2024-11-20 14:56:45,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2024-11-20 14:56:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 14:56:45,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:45,294 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:45,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 14:56:45,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:45,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:45,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:45,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957327, now seen corresponding path program 1 times [2024-11-20 14:56:45,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:45,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192604485] [2024-11-20 14:56:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:45,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192604485] [2024-11-20 14:56:45,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192604485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358389674] [2024-11-20 14:56:45,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:45,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:45,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:45,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:45,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 14:56:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:45,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:56:45,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:45,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:45,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358389674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:56:45,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:56:45,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-20 14:56:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586300660] [2024-11-20 14:56:45,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:45,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:56:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:45,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:56:45,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:56:45,723 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:45,754 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-11-20 14:56:45,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:56:45,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-20 14:56:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:45,755 INFO L225 Difference]: With dead ends: 127 [2024-11-20 14:56:45,755 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 14:56:45,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:45,756 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 4 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:45,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 359 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:56:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 14:56:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-20 14:56:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 126 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2024-11-20 14:56:45,760 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 21 [2024-11-20 14:56:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:45,760 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2024-11-20 14:56:45,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2024-11-20 14:56:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:56:45,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:45,761 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:45,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 14:56:45,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:45,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:45,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:45,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822092, now seen corresponding path program 1 times [2024-11-20 14:56:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:45,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897110757] [2024-11-20 14:56:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:56:46,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:46,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897110757] [2024-11-20 14:56:46,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897110757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:46,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:46,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:56:46,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833323549] [2024-11-20 14:56:46,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:46,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:56:46,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:46,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:56:46,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:46,086 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:46,157 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2024-11-20 14:56:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:56:46,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 22 [2024-11-20 14:56:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:46,159 INFO L225 Difference]: With dead ends: 124 [2024-11-20 14:56:46,159 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 14:56:46,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:46,160 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:46,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 193 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 14:56:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-20 14:56:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 123 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2024-11-20 14:56:46,163 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 22 [2024-11-20 14:56:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:46,163 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2024-11-20 14:56:46,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2024-11-20 14:56:46,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:56:46,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:46,164 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:46,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:56:46,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:46,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:46,165 INFO L85 PathProgramCache]: Analyzing trace with hash 157247510, now seen corresponding path program 1 times [2024-11-20 14:56:46,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:46,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30187935] [2024-11-20 14:56:46,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:46,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30187935] [2024-11-20 14:56:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30187935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032522603] [2024-11-20 14:56:46,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:46,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:46,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:46,440 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:46,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 14:56:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:46,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 14:56:46,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:46,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:56:46,618 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:56:46,619 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-11-20 14:56:46,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:46,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-20 14:56:46,766 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:56:46,766 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-11-20 14:56:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:46,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:48,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 Int) (v_ArrVal_620 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| v_ArrVal_620) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| v_ArrVal_621))) (or (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| 1)) (not (= (select .cse0 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 1))))) is different from false [2024-11-20 14:56:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-20 14:56:48,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032522603] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:56:48,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:56:48,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-20 14:56:48,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793587527] [2024-11-20 14:56:48,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:56:48,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 14:56:48,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:48,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 14:56:48,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=130, Unknown=1, NotChecked=24, Total=210 [2024-11-20 14:56:48,970 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:49,176 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2024-11-20 14:56:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:56:49,176 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-20 14:56:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:49,178 INFO L225 Difference]: With dead ends: 130 [2024-11-20 14:56:49,178 INFO L226 Difference]: Without dead ends: 130 [2024-11-20 14:56:49,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=67, Invalid=146, Unknown=1, NotChecked=26, Total=240 [2024-11-20 14:56:49,179 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 247 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:49,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 225 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 227 Invalid, 0 Unknown, 127 Unchecked, 0.2s Time] [2024-11-20 14:56:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-20 14:56:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 117. [2024-11-20 14:56:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2024-11-20 14:56:49,183 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 27 [2024-11-20 14:56:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:49,183 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2024-11-20 14:56:49,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2024-11-20 14:56:49,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:56:49,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:49,186 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:49,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 14:56:49,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:49,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:49,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash 157247511, now seen corresponding path program 1 times [2024-11-20 14:56:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:49,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540147015] [2024-11-20 14:56:49,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:49,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:56:49,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540147015] [2024-11-20 14:56:49,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540147015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413356936] [2024-11-20 14:56:49,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:49,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:49,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:49,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:49,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 14:56:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:49,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 14:56:49,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:49,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-20 14:56:49,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:49,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:56:49,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:49,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:56:50,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:56:50,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:56:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:56:50,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:56:50,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413356936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:50,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:56:50,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-20 14:56:50,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020224604] [2024-11-20 14:56:50,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:50,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:56:50,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:50,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:56:50,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:56:50,069 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:50,186 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-11-20 14:56:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:56:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-20 14:56:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:50,187 INFO L225 Difference]: With dead ends: 111 [2024-11-20 14:56:50,187 INFO L226 Difference]: Without dead ends: 111 [2024-11-20 14:56:50,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:56:50,188 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 121 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:50,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 125 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-20 14:56:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-20 14:56:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:50,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2024-11-20 14:56:50,191 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 27 [2024-11-20 14:56:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:50,191 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2024-11-20 14:56:50,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2024-11-20 14:56:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:56:50,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:50,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:50,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-20 14:56:50,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:50,393 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:50,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1248708524, now seen corresponding path program 1 times [2024-11-20 14:56:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:50,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815649100] [2024-11-20 14:56:50,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:50,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:50,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815649100] [2024-11-20 14:56:50,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815649100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:50,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:50,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:56:50,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303729553] [2024-11-20 14:56:50,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:50,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:56:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:50,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:56:50,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:56:50,663 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:50,949 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2024-11-20 14:56:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:56:50,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2024-11-20 14:56:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:50,950 INFO L225 Difference]: With dead ends: 139 [2024-11-20 14:56:50,950 INFO L226 Difference]: Without dead ends: 139 [2024-11-20 14:56:50,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:56:50,951 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 172 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:50,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 375 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:56:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-20 14:56:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2024-11-20 14:56:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 117 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2024-11-20 14:56:50,954 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2024-11-20 14:56:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:50,954 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2024-11-20 14:56:50,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2024-11-20 14:56:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:56:50,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:50,958 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:50,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:56:50,959 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:50,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1248708523, now seen corresponding path program 1 times [2024-11-20 14:56:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:50,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378080926] [2024-11-20 14:56:50,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:50,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:51,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:51,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378080926] [2024-11-20 14:56:51,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378080926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:51,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:51,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:56:51,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96604992] [2024-11-20 14:56:51,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:51,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:56:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:51,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:56:51,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:56:51,345 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:51,660 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2024-11-20 14:56:51,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:56:51,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2024-11-20 14:56:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:51,662 INFO L225 Difference]: With dead ends: 139 [2024-11-20 14:56:51,662 INFO L226 Difference]: Without dead ends: 139 [2024-11-20 14:56:51,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:56:51,663 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 100 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:51,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 409 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:56:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-20 14:56:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2024-11-20 14:56:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 85 states have (on average 1.611764705882353) internal successors, (137), 117 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2024-11-20 14:56:51,667 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 30 [2024-11-20 14:56:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:51,668 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2024-11-20 14:56:51,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2024-11-20 14:56:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:56:51,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:51,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:51,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:56:51,671 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:51,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:51,671 INFO L85 PathProgramCache]: Analyzing trace with hash -55260162, now seen corresponding path program 1 times [2024-11-20 14:56:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651074722] [2024-11-20 14:56:51,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:56:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651074722] [2024-11-20 14:56:51,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651074722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:51,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:51,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:56:51,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103624427] [2024-11-20 14:56:51,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:51,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:56:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:51,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:56:51,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:51,733 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-11-20 14:56:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:51,747 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2024-11-20 14:56:51,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:56:51,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 31 [2024-11-20 14:56:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:51,748 INFO L225 Difference]: With dead ends: 113 [2024-11-20 14:56:51,748 INFO L226 Difference]: Without dead ends: 113 [2024-11-20 14:56:51,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:56:51,748 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:51,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:56:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-20 14:56:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-20 14:56:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.55) internal successors, (124), 112 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2024-11-20 14:56:51,752 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 31 [2024-11-20 14:56:51,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:51,753 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2024-11-20 14:56:51,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-11-20 14:56:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2024-11-20 14:56:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-20 14:56:51,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:51,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:51,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 14:56:51,754 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:51,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:51,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1713045098, now seen corresponding path program 1 times [2024-11-20 14:56:51,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:51,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396492261] [2024-11-20 14:56:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:51,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:56:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:51,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396492261] [2024-11-20 14:56:51,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396492261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:51,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:51,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:56:51,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194957663] [2024-11-20 14:56:51,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:51,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:56:51,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:51,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:56:51,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:51,837 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:51,958 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-11-20 14:56:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:56:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-11-20 14:56:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:51,959 INFO L225 Difference]: With dead ends: 111 [2024-11-20 14:56:51,959 INFO L226 Difference]: Without dead ends: 111 [2024-11-20 14:56:51,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:51,959 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 26 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:51,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 242 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-20 14:56:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-20 14:56:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.5125) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2024-11-20 14:56:51,963 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 32 [2024-11-20 14:56:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:51,963 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2024-11-20 14:56:51,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2024-11-20 14:56:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-20 14:56:51,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:51,966 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:51,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:56:51,966 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:51,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:51,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1713045097, now seen corresponding path program 1 times [2024-11-20 14:56:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875499294] [2024-11-20 14:56:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:51,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:52,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:52,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875499294] [2024-11-20 14:56:52,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875499294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:52,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054638759] [2024-11-20 14:56:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:52,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:52,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:52,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:52,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 14:56:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:52,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:56:52,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:56:52,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:56:52,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054638759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:52,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:56:52,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-20 14:56:52,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139246364] [2024-11-20 14:56:52,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:52,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:56:52,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:52,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:56:52,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:52,345 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:52,364 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2024-11-20 14:56:52,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:56:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-11-20 14:56:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:52,365 INFO L225 Difference]: With dead ends: 113 [2024-11-20 14:56:52,365 INFO L226 Difference]: Without dead ends: 113 [2024-11-20 14:56:52,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:56:52,366 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:52,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 217 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:56:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-20 14:56:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-20 14:56:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 108 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2024-11-20 14:56:52,369 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 32 [2024-11-20 14:56:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:52,369 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2024-11-20 14:56:52,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2024-11-20 14:56:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-20 14:56:52,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:52,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:52,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 14:56:52,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 14:56:52,574 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:52,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1563834333, now seen corresponding path program 1 times [2024-11-20 14:56:52,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:52,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054602518] [2024-11-20 14:56:52,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:52,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:52,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054602518] [2024-11-20 14:56:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054602518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15947477] [2024-11-20 14:56:52,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:52,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:52,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:52,757 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:52,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 14:56:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:52,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 14:56:52,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:56:52,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:56:52,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15947477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:52,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:56:52,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-20 14:56:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457891263] [2024-11-20 14:56:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:52,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:56:52,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:52,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:56:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:56:52,972 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:53,002 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2024-11-20 14:56:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:56:53,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-20 14:56:53,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:53,003 INFO L225 Difference]: With dead ends: 110 [2024-11-20 14:56:53,003 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 14:56:53,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:56:53,004 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 77 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:53,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 223 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:56:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 14:56:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2024-11-20 14:56:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 105 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-20 14:56:53,007 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 33 [2024-11-20 14:56:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:53,007 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-20 14:56:53,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-20 14:56:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 14:56:53,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:53,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:53,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-20 14:56:53,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 14:56:53,208 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:53,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:53,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1234225649, now seen corresponding path program 1 times [2024-11-20 14:56:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:53,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333264625] [2024-11-20 14:56:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:53,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:56:53,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:53,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333264625] [2024-11-20 14:56:53,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333264625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:53,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:53,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:56:53,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012158502] [2024-11-20 14:56:53,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:53,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:56:53,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:53,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:56:53,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:56:53,278 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:53,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:53,371 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2024-11-20 14:56:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:56:53,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-11-20 14:56:53,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:53,372 INFO L225 Difference]: With dead ends: 105 [2024-11-20 14:56:53,372 INFO L226 Difference]: Without dead ends: 105 [2024-11-20 14:56:53,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:56:53,373 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:53,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-20 14:56:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-20 14:56:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2024-11-20 14:56:53,376 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 34 [2024-11-20 14:56:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:53,376 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2024-11-20 14:56:53,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2024-11-20 14:56:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 14:56:53,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:53,377 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:53,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 14:56:53,377 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:53,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1234225648, now seen corresponding path program 1 times [2024-11-20 14:56:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174789440] [2024-11-20 14:56:53,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:53,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:53,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174789440] [2024-11-20 14:56:53,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174789440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:53,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874459286] [2024-11-20 14:56:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:53,622 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:53,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-20 14:56:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:53,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-20 14:56:53,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:56:54,020 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:56:54,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 14:56:54,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-20 14:56:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:56:54,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:54,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:56:54,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-20 14:56:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:56:54,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874459286] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:54,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:56:54,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 7] total 16 [2024-11-20 14:56:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698691235] [2024-11-20 14:56:54,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:54,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:56:54,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:54,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:56:54,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:56:54,183 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:54,261 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-20 14:56:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:56:54,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-11-20 14:56:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:54,262 INFO L225 Difference]: With dead ends: 104 [2024-11-20 14:56:54,262 INFO L226 Difference]: Without dead ends: 104 [2024-11-20 14:56:54,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:56:54,263 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:54,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 243 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-20 14:56:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-20 14:56:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 103 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-11-20 14:56:54,266 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 34 [2024-11-20 14:56:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:54,266 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-11-20 14:56:54,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-11-20 14:56:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 14:56:54,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:54,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:54,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-20 14:56:54,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:54,468 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:54,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash 393710610, now seen corresponding path program 1 times [2024-11-20 14:56:54,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:54,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608812447] [2024-11-20 14:56:54,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:54,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-20 14:56:54,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:54,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608812447] [2024-11-20 14:56:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608812447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:56:54,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:56:54,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:56:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54876828] [2024-11-20 14:56:54,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:56:54,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:56:54,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:56:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:56:54,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:54,667 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:56:54,776 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-11-20 14:56:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:56:54,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 35 [2024-11-20 14:56:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:56:54,777 INFO L225 Difference]: With dead ends: 102 [2024-11-20 14:56:54,777 INFO L226 Difference]: Without dead ends: 102 [2024-11-20 14:56:54,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:56:54,781 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 18 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:56:54,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 245 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:56:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-20 14:56:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-20 14:56:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-20 14:56:54,785 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 35 [2024-11-20 14:56:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:56:54,786 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-20 14:56:54,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:56:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-20 14:56:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-20 14:56:54,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:56:54,786 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:56:54,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 14:56:54,787 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:56:54,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:56:54,787 INFO L85 PathProgramCache]: Analyzing trace with hash -522865965, now seen corresponding path program 1 times [2024-11-20 14:56:54,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:56:54,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869366179] [2024-11-20 14:56:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:56:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:55,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:56:55,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869366179] [2024-11-20 14:56:55,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869366179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:56:55,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358428969] [2024-11-20 14:56:55,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:56:55,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:56:55,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:56:55,831 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:56:55,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-20 14:56:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:56:56,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-20 14:56:56,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:56:56,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:56:56,461 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 14:56:56,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 14:56:56,532 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-11-20 14:56:56,590 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-11-20 14:56:56,643 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:56:56,643 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 34 treesize of output 33 [2024-11-20 14:56:56,848 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-20 14:56:56,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-20 14:56:56,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:56:56,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:56:56,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:56:57,129 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 66 treesize of output 38 [2024-11-20 14:56:57,251 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 33 treesize of output 17 [2024-11-20 14:56:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:56:57,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:56:57,838 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 34 treesize of output 26 [2024-11-20 14:56:57,841 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 30 treesize of output 22 [2024-11-20 14:57:02,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:02,157 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 35 treesize of output 41 [2024-11-20 14:57:02,161 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 90 treesize of output 78 [2024-11-20 14:57:02,166 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 74 treesize of output 66 [2024-11-20 14:57:02,170 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 34 treesize of output 30 [2024-11-20 14:57:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:57:06,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358428969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:57:06,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:57:06,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 50 [2024-11-20 14:57:06,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027372837] [2024-11-20 14:57:06,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:57:06,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-20 14:57:06,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:57:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-20 14:57:06,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2326, Unknown=7, NotChecked=0, Total=2550 [2024-11-20 14:57:06,496 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 51 states, 50 states have (on average 2.16) internal successors, (108), 51 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:57:08,123 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2024-11-20 14:57:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 14:57:08,124 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.16) internal successors, (108), 51 states have internal predecessors, (108), 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 38 [2024-11-20 14:57:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:57:08,125 INFO L225 Difference]: With dead ends: 108 [2024-11-20 14:57:08,125 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 14:57:08,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=412, Invalid=3741, Unknown=7, NotChecked=0, Total=4160 [2024-11-20 14:57:08,127 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 137 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:57:08,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1257 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 14:57:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 14:57:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2024-11-20 14:57:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 99 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-20 14:57:08,129 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 38 [2024-11-20 14:57:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:57:08,129 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-20 14:57:08,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.16) internal successors, (108), 51 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-20 14:57:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-20 14:57:08,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:57:08,130 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:57:08,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-20 14:57:08,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-20 14:57:08,331 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:57:08,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:57:08,331 INFO L85 PathProgramCache]: Analyzing trace with hash -522865964, now seen corresponding path program 1 times [2024-11-20 14:57:08,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:57:08,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325290308] [2024-11-20 14:57:08,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:08,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:57:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:57:09,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:57:09,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325290308] [2024-11-20 14:57:09,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325290308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:57:09,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537372191] [2024-11-20 14:57:09,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:09,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:57:09,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:57:09,561 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:57:09,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-20 14:57:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:10,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-20 14:57:10,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:57:10,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:57:10,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:57:10,299 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:57:10,299 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-11-20 14:57:10,314 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 14:57:10,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 14:57:10,400 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-11-20 14:57:10,405 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-11-20 14:57:10,455 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-11-20 14:57:10,472 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 19 treesize of output 18 [2024-11-20 14:57:10,570 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:57:10,570 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 59 treesize of output 52 [2024-11-20 14:57:10,576 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 31 treesize of output 16 [2024-11-20 14:57:10,759 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-20 14:57:10,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-20 14:57:10,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-20 14:57:10,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:57:10,889 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 31 treesize of output 20 [2024-11-20 14:57:10,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:57:10,921 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 31 treesize of output 20 [2024-11-20 14:57:10,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:57:10,949 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 31 treesize of output 20 [2024-11-20 14:57:11,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2024-11-20 14:57:11,193 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 25 treesize of output 13 [2024-11-20 14:57:11,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 14:57:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:57:11,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:57:11,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (and (forall ((v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1963) .cse0) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1962) .cse0) .cse1)))) (forall ((v_ArrVal_1963 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1963) .cse0) .cse1) 8))))) is different from false [2024-11-20 14:57:11,582 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 76 treesize of output 60 [2024-11-20 14:57:11,587 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 64 treesize of output 48 [2024-11-20 14:57:12,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:12,056 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 64 treesize of output 70 [2024-11-20 14:57:12,059 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 206 treesize of output 194 [2024-11-20 14:57:12,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:12,069 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 190 treesize of output 150 [2024-11-20 14:57:12,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:12,077 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 890 treesize of output 830 [2024-11-20 14:57:12,090 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 50 treesize of output 46 [2024-11-20 14:57:12,095 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 46 treesize of output 42 [2024-11-20 14:57:12,099 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 86 treesize of output 78 [2024-11-20 14:57:12,103 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 78 treesize of output 70 [2024-11-20 14:57:12,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:12,134 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 32 treesize of output 38 [2024-11-20 14:57:12,137 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:57:12,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:12,141 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 50 treesize of output 32 [2024-11-20 14:57:12,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-20 14:57:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:57:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537372191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:57:12,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:57:12,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 15] total 48 [2024-11-20 14:57:12,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060901147] [2024-11-20 14:57:12,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:57:12,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-20 14:57:12,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:57:12,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-20 14:57:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2062, Unknown=6, NotChecked=92, Total=2352 [2024-11-20 14:57:12,728 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 49 states, 48 states have (on average 2.3125) internal successors, (111), 49 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:57:14,752 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2024-11-20 14:57:14,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-20 14:57:14,753 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.3125) internal successors, (111), 49 states have internal predecessors, (111), 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 38 [2024-11-20 14:57:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:57:14,753 INFO L225 Difference]: With dead ends: 106 [2024-11-20 14:57:14,753 INFO L226 Difference]: Without dead ends: 106 [2024-11-20 14:57:14,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=390, Invalid=3390, Unknown=6, NotChecked=120, Total=3906 [2024-11-20 14:57:14,755 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 125 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:57:14,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1208 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1792 Invalid, 0 Unknown, 98 Unchecked, 1.4s Time] [2024-11-20 14:57:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-20 14:57:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2024-11-20 14:57:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-20 14:57:14,757 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 38 [2024-11-20 14:57:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:57:14,757 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-20 14:57:14,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.3125) internal successors, (111), 49 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-20 14:57:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-20 14:57:14,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:57:14,758 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:57:14,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-20 14:57:14,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-20 14:57:14,959 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:57:14,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:57:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1695206362, now seen corresponding path program 1 times [2024-11-20 14:57:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:57:14,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615084854] [2024-11-20 14:57:14,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:14,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:57:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:57:15,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:57:15,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615084854] [2024-11-20 14:57:15,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615084854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:57:15,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296481819] [2024-11-20 14:57:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:15,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:57:15,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:57:15,121 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:57:15,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-20 14:57:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:15,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 14:57:15,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:57:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:57:15,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:57:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:57:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296481819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:57:15,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:57:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-11-20 14:57:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166688034] [2024-11-20 14:57:15,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:57:15,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 14:57:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:57:15,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 14:57:15,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:57:15,526 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:57:15,716 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-11-20 14:57:15,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:57:15,716 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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 40 [2024-11-20 14:57:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:57:15,717 INFO L225 Difference]: With dead ends: 88 [2024-11-20 14:57:15,717 INFO L226 Difference]: Without dead ends: 88 [2024-11-20 14:57:15,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-20 14:57:15,718 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 27 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:57:15,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 883 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:57:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-20 14:57:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-20 14:57:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 87 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-11-20 14:57:15,720 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 40 [2024-11-20 14:57:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:57:15,720 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-11-20 14:57:15,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-20 14:57:15,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 14:57:15,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:57:15,721 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:57:15,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-20 14:57:15,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-20 14:57:15,926 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:57:15,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:57:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1358086886, now seen corresponding path program 1 times [2024-11-20 14:57:15,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:57:15,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379970754] [2024-11-20 14:57:15,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:15,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:57:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:57:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:57:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379970754] [2024-11-20 14:57:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379970754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:57:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758015272] [2024-11-20 14:57:16,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:16,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:57:16,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:57:16,142 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:57:16,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-20 14:57:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:16,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 14:57:16,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:57:16,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-20 14:57:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:57:16,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:57:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:57:16,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758015272] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 14:57:16,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:57:16,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 15 [2024-11-20 14:57:16,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120790257] [2024-11-20 14:57:16,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:57:16,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:57:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:57:16,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:57:16,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-20 14:57:16,636 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:57:16,791 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-11-20 14:57:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:57:16,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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 42 [2024-11-20 14:57:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:57:16,792 INFO L225 Difference]: With dead ends: 96 [2024-11-20 14:57:16,792 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 14:57:16,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-20 14:57:16,793 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:57:16,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 473 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:57:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 14:57:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2024-11-20 14:57:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2024-11-20 14:57:16,796 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 42 [2024-11-20 14:57:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:57:16,796 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2024-11-20 14:57:16,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-11-20 14:57:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 14:57:16,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:57:16,797 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:57:16,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-20 14:57:16,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:57:16,998 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:57:16,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:57:16,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1358086933, now seen corresponding path program 1 times [2024-11-20 14:57:16,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:57:16,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700215841] [2024-11-20 14:57:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:16,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:57:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 14:57:17,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:57:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700215841] [2024-11-20 14:57:17,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700215841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:57:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663500044] [2024-11-20 14:57:17,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:17,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:57:17,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:57:17,188 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:57:17,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-20 14:57:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:17,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 14:57:17,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:57:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:57:17,491 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-20 14:57:17,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-20 14:57:17,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-20 14:57:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:57:17,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:57:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663500044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:57:17,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:57:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2024-11-20 14:57:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676136793] [2024-11-20 14:57:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:57:17,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:57:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:57:17,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:57:17,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:57:17,533 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:57:17,686 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-11-20 14:57:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:57:17,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 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 42 [2024-11-20 14:57:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:57:17,686 INFO L225 Difference]: With dead ends: 91 [2024-11-20 14:57:17,686 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 14:57:17,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:57:17,687 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:57:17,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 266 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:57:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 14:57:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-20 14:57:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-11-20 14:57:17,689 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 42 [2024-11-20 14:57:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:57:17,689 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-11-20 14:57:17,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-11-20 14:57:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 14:57:17,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:57:17,690 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:57:17,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-20 14:57:17,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-20 14:57:17,890 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:57:17,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:57:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1358086934, now seen corresponding path program 1 times [2024-11-20 14:57:17,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:57:17,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012136149] [2024-11-20 14:57:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:57:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:57:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:57:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012136149] [2024-11-20 14:57:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012136149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:57:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516961029] [2024-11-20 14:57:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:18,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:57:18,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:57:18,316 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:57:18,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-20 14:57:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:18,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 14:57:18,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:57:18,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-20 14:57:18,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:57:18,630 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-20 14:57:18,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-20 14:57:18,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-20 14:57:18,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-20 14:57:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:57:18,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:57:18,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516961029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:57:18,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:57:18,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2024-11-20 14:57:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785075290] [2024-11-20 14:57:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:57:18,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:57:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:57:18,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:57:18,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-11-20 14:57:18,736 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:18,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:57:18,927 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2024-11-20 14:57:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:57:18,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 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 42 [2024-11-20 14:57:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:57:18,928 INFO L225 Difference]: With dead ends: 89 [2024-11-20 14:57:18,928 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 14:57:18,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-20 14:57:18,928 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 49 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:57:18,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 259 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:57:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 14:57:18,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-20 14:57:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2024-11-20 14:57:18,930 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 42 [2024-11-20 14:57:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:57:18,931 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2024-11-20 14:57:18,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-11-20 14:57:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-20 14:57:18,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:57:18,931 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:57:18,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-20 14:57:19,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-20 14:57:19,132 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:57:19,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:57:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1648469249, now seen corresponding path program 1 times [2024-11-20 14:57:19,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:57:19,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273722480] [2024-11-20 14:57:19,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:19,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:57:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:57:19,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:57:19,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273722480] [2024-11-20 14:57:19,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273722480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:57:19,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986445368] [2024-11-20 14:57:19,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:19,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:57:19,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:57:19,809 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:57:19,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-20 14:57:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:20,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-20 14:57:20,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:57:20,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:57:20,088 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 14:57:20,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 14:57:20,124 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-11-20 14:57:20,155 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-11-20 14:57:20,181 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:57:20,181 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 34 treesize of output 33 [2024-11-20 14:57:20,291 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-20 14:57:20,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-20 14:57:20,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:57:20,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:57:20,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:57:20,542 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-20 14:57:20,542 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 55 treesize of output 50 [2024-11-20 14:57:20,680 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-20 14:57:20,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 74 [2024-11-20 14:57:20,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-20 14:57:20,808 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 81 treesize of output 58 [2024-11-20 14:57:21,028 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 128 treesize of output 80 [2024-11-20 14:57:21,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 14:57:21,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:21,255 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 81 treesize of output 59 [2024-11-20 14:57:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:57:21,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:57:26,793 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 43 treesize of output 35 [2024-11-20 14:57:26,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 14:57:27,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:27,374 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 66 treesize of output 57 [2024-11-20 14:57:27,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:27,388 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 1148 treesize of output 1134 [2024-11-20 14:57:27,412 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 346 treesize of output 334 [2024-11-20 14:57:27,428 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 340 treesize of output 324 [2024-11-20 14:57:27,446 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 304 treesize of output 288 [2024-11-20 14:57:27,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:27,549 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 44 treesize of output 44 [2024-11-20 14:57:27,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:27,616 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 254 treesize of output 246 [2024-11-20 14:57:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:57:29,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986445368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:57:29,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:57:29,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 22] total 57 [2024-11-20 14:57:29,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241803465] [2024-11-20 14:57:29,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:57:29,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-20 14:57:29,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:57:29,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-20 14:57:29,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2995, Unknown=16, NotChecked=0, Total=3192 [2024-11-20 14:57:29,030 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 57 states, 57 states have (on average 2.4035087719298245) internal successors, (137), 57 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:57:32,091 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2024-11-20 14:57:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-20 14:57:32,091 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.4035087719298245) internal successors, (137), 57 states have internal predecessors, (137), 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 47 [2024-11-20 14:57:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:57:32,091 INFO L225 Difference]: With dead ends: 107 [2024-11-20 14:57:32,092 INFO L226 Difference]: Without dead ends: 107 [2024-11-20 14:57:32,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=420, Invalid=5726, Unknown=16, NotChecked=0, Total=6162 [2024-11-20 14:57:32,093 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 119 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:57:32,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1100 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 14:57:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-20 14:57:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2024-11-20 14:57:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 92 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-11-20 14:57:32,096 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 47 [2024-11-20 14:57:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:57:32,096 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-11-20 14:57:32,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.4035087719298245) internal successors, (137), 57 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:57:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-11-20 14:57:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-20 14:57:32,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:57:32,097 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:57:32,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-20 14:57:32,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-20 14:57:32,298 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-20 14:57:32,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:57:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash -769710694, now seen corresponding path program 1 times [2024-11-20 14:57:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:57:32,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282417867] [2024-11-20 14:57:32,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:32,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:57:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:57:34,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:57:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282417867] [2024-11-20 14:57:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282417867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:57:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618980675] [2024-11-20 14:57:34,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:57:34,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:57:34,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:57:34,310 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:57:34,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-20 14:57:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:57:34,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-20 14:57:34,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:57:34,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-20 14:57:34,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:57:34,700 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:57:34,701 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-11-20 14:57:34,720 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 14:57:34,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 14:57:34,783 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-11-20 14:57:34,787 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-11-20 14:57:34,831 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 19 treesize of output 18 [2024-11-20 14:57:34,842 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-11-20 14:57:34,911 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:57:34,911 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 59 treesize of output 52 [2024-11-20 14:57:34,916 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 31 treesize of output 16 [2024-11-20 14:57:35,098 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-20 14:57:35,098 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 1 case distinctions, treesize of input 22 treesize of output 29 [2024-11-20 14:57:35,120 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-20 14:57:35,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-20 14:57:35,206 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 31 treesize of output 20 [2024-11-20 14:57:35,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:57:35,228 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 31 treesize of output 20 [2024-11-20 14:57:35,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:57:35,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-20 14:57:35,274 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 31 treesize of output 20 [2024-11-20 14:57:35,810 INFO L349 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2024-11-20 14:57:35,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2024-11-20 14:57:35,831 INFO L349 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2024-11-20 14:57:35,831 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 2 case distinctions, treesize of input 36 treesize of output 38 [2024-11-20 14:57:35,997 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-20 14:57:35,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 83 [2024-11-20 14:57:36,013 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-20 14:57:36,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 115 [2024-11-20 14:57:36,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 7 treesize of output 3 [2024-11-20 14:57:36,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-20 14:57:36,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-20 14:57:36,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 58 [2024-11-20 14:57:36,215 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 31 treesize of output 20 [2024-11-20 14:57:36,281 INFO L349 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2024-11-20 14:57:36,281 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 110 treesize of output 84 [2024-11-20 14:57:36,302 INFO L349 Elim1Store]: treesize reduction 76, result has 23.2 percent of original size [2024-11-20 14:57:36,302 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 36 treesize of output 38 [2024-11-20 14:57:36,539 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 243 treesize of output 179 [2024-11-20 14:57:36,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:36,932 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 169 treesize of output 135 [2024-11-20 14:57:36,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:36,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 150 [2024-11-20 14:57:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:57:39,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:57:44,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3028 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_3029 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3028))) (store .cse0 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse2) .cse3) 4) (select |c_#length| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3029))) (store .cse4 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse2) .cse3))))) (forall ((v_ArrVal_3028 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int)) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3028))) (store .cse5 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse2) .cse3))))) is different from false [2024-11-20 14:57:45,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3028 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_3029 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (<= (+ (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3028))) (store .cse0 |c_ULTIMATE.start_dll_insert_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_insert_#t~mem9#1.base|) .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse3) .cse4) 4) (select |c_#length| (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3029))) (store .cse5 |c_ULTIMATE.start_dll_insert_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_insert_#t~mem9#1.base|) .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse3) .cse4))))) (forall ((v_ArrVal_3028 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int)) (<= 0 (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3028))) (store .cse7 |c_ULTIMATE.start_dll_insert_#t~mem9#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_insert_#t~mem9#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse3) .cse4)))))) is different from false [2024-11-20 14:57:46,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3028 (Array Int Int)) (v_ArrVal_3029 (Array Int Int)) (v_subst_20 Int)) (let ((.cse2 (+ v_subst_20 8))) (<= (+ 4 (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3028))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse4) .cse5)) (select |c_#length| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3029))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse4) .cse5))))) (forall ((v_subst_19 Int) (v_ArrVal_3028 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3028))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ v_subst_19 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse4) .cse5)))))) is different from false [2024-11-20 14:57:46,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_3028 (Array Int Int)) (v_ArrVal_3029 (Array Int Int)) (v_subst_20 Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse3 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse1 (select .cse7 .cse3)) (.cse2 (+ v_subst_20 8))) (<= (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3028))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse4) .cse5) 4) (select |c_#length| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse7 .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3029))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse4) .cse5)))))) (forall ((v_subst_19 Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_3028 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse8 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3028)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse10))) (store .cse8 .cse9 (store (select .cse8 .cse9) (+ v_subst_19 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) .cse4) .cse5))))) is different from false [2024-11-20 14:57:46,336 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_3028 (Array Int Int)) (v_ArrVal_3029 (Array Int Int)) (v_subst_20 Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse3 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse1 (select .cse7 .cse3)) (.cse2 (+ v_subst_20 8))) (<= (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse3 |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_3028))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_node_create_#res#1.offset|))) .cse4) .cse5) 4) (select |c_#length| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse7 .cse3 |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_3029))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_node_create_#res#1.base|))) .cse4) .cse5)))))) (forall ((v_subst_19 Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_3028 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse8 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse10 |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_3028)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse10))) (store .cse8 .cse9 (store (select .cse8 .cse9) (+ v_subst_19 8) |c_ULTIMATE.start_node_create_#res#1.offset|)))) .cse4) .cse5))))) is different from false [2024-11-20 14:57:46,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_3028 (Array Int Int)) (v_ArrVal_3029 (Array Int Int)) (v_subst_20 Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse3 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse1 (select .cse7 .cse3)) (.cse2 (+ v_subst_20 8))) (<= (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3028))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse4) .cse5) 4) (select |c_#length| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse7 .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3029))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) .cse4) .cse5)))))) (forall ((v_subst_19 Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_3028 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse8 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3028)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse10))) (store .cse8 .cse9 (store (select .cse8 .cse9) (+ v_subst_19 8) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) .cse4) .cse5))))) is different from false [2024-11-20 14:57:46,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3021 (Array Int Int)) (v_ArrVal_3022 (Array Int Int)) (v_subst_19 Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_3028 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3022) |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3028)) (.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3021) |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_subst_19 8) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) .cse3) .cse4))) (forall ((v_ArrVal_3021 (Array Int Int)) (v_ArrVal_3022 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_3028 (Array Int Int)) (v_ArrVal_3029 (Array Int Int)) (v_subst_20 Int)) (let ((.cse10 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3021) |ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse8 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse6 (select .cse10 .cse8)) (.cse7 (+ v_subst_20 8))) (<= (+ (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3022) |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3028))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse3) .cse4) 4) (select |c_#length| (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse10 .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3029))) (store .cse9 .cse6 (store (select .cse9 .cse6) .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) .cse3) .cse4)))))))) is different from false [2024-11-20 14:57:46,670 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 245 treesize of output 229 [2024-11-20 14:57:46,688 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 233 treesize of output 217 [2024-11-20 14:57:51,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:51,300 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 177 treesize of output 138 [2024-11-20 14:57:51,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:51,340 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 119 treesize of output 110 [2024-11-20 14:57:51,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:51,520 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 543986 treesize of output 526654 [2024-11-20 14:57:52,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:57:52,063 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 18322 treesize of output 17187 [2024-11-20 14:57:52,552 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 9438 treesize of output 9102 [2024-11-20 14:57:52,916 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 8974 treesize of output 8526 [2024-11-20 14:57:53,151 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 8484 treesize of output 8284 [2024-11-20 14:57:53,307 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 8284 treesize of output 7692 [2024-11-20 14:57:53,448 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 8110 treesize of output 7854